Georgia Institute of Technology College of Sciences

Combinatorial mathematics exhibits a number of elegant, simply stated problems that turn out to be surprisingly challenging. In this talk, I report on a problem of this type on which I have been working with Noah Streib, Stephen Young and Ruidong Wang from Georgia Tech, as well as Piotr Micek, Bartek Walczak and Tomek Krawczyk, all computer scientists from Poland. Given positive integers $k$ and $w$, what is the largest integer $t = f(k,w)$ for which there exists a family $\mathcal{F}$ of $t$ vectors in $N^{w}$ so that: \begin{enumerate} \item Any two vectors in the family $\mathcal{F}$ are incomparable in the product ordering; and \item There do not exist two vectors $A$ and $B$ in the family for which there are distinct $i$ and $j$ so that $a_i\ge k +b_i$ and $b_j \ge k + a_j$. \end{enumerate} The Polish group posed the problem to us at the SIAM Discrete Mathematics held in Austin, Texas, this summer. They were able to establish the following bounds: \[ k^{w-1} \le t \le k^w \] We were able to show that the lower bound is essentially correct by showing that there is a constant $c_w$ so that $t \l c_w k^{w-1}$. But recent work suggests that the lower bound might actually be tight.

The study of collective behavior---of animals, mechanical systems, or even abstract oscillators---has fascinated a large number of researchers from observational geologists to pure mathematicians. We consider the collective behavior of herds of cattle. We first consider some results from an agent-based model and then formulate a mathematical model for the daily activities of a cow (eating, lying down, and standing) in terms of a piecewise affine dynamical system. We analyze the properties of this bovine dynamical system representing the single animal and develop an exact integrative form as a discrete-time mapping. We then couple multiple cow "oscillators" together to study synchrony and cooperation in cattle herds, finding that it is possible for cows to synchronize less when the coupling is increased. [This research is in collaboration with Jie Sun, Erik Bollt, and Marian Dawkins.]

The mapping class group is the group of symmetries of a surface (modulo homotopy). One way to study the mapping class group of a surface S is to understand its action on the set of simple closed curves in S (up to homotopy). The set of homotopy classes of simple closed curves can be organized into a simplicial complex called the complex of curves. This complex has some amazing features, and we will use it to prove a variety of theorems about the mapping class group. We will also state some open questions. This talk will be accessible to second year graduate students.

The purpose of this talk is to describe a variational approach to the problemof A.D. Aleksandrov concerning existence and uniqueness of a closed convexhypersurface in Euclidean space $R^{n+1}, ~n \geq 2$ with prescribed integral Gauss curvature. It is shown that this problem in variational formulation is closely connected with theproblem of optimal transport on $S^n$ with a geometrically motivated cost function.