SpeakerBridget Tenner Massachusetts Institute of Technologyhttp://math.depaul.edu/bridget/ Description Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their...
Description Abstract: Kenneth May in 1952 proved a classical theorem characterizing simple majority rule for two alternatives. Surprising recent work has employed this type of axiomatic approach for...
SpeakerDavid Fernandez-BacaIowa State Universityhttp://www.cs.iastate.edu/~fernande/ Description The treatment of conflict within data sets is among the most debated questions in phylogenetics, and it...
Speaker Marcus Schaefer DePaul University, Chicago http://ovid.cs.depaul.edu Description A string graph is the intersection graph of a set of Jordan curves in the plane. Each curve is represented by a...
Description Asymptotically exact and conservative confidence bands are obtained for the nonparametric regression function based on piecewise constant and piecewise linear spline estimation...
Description Abstract: Kenneth May in 1952 proved a classical theorem characterizing simple majority rule for two alternatives. Surprising recent work has employed this type of axiomatic approach for...
SpeakerRoger LeeUniversity of Chicagohttp://www.math.uchicago.edu/~rl/ Description Variance swaps, which pay the realized variance of [the returns on] an underlying price process, have become a...
Speaker Roger Lee University of Chicago http://www.math.uchicago.edu/~rl/ Description Variance swaps, which pay the realized variance of [the returns on] an underlying price process, have become a...
Speaker Michael Pelsmajer IIT Applied Mathematics Description Graph drawing considers ways to nicely embed graphs on the plane or other surfaces. The first thing that one tries to avoid is having two...
Description Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in the class...
