Sensitivity analysis of reflected diffusions Reflected diffusions (RDs) constrained to remain in convex polyhedral domains arise in a variety of contexts, including as “heavy traffic” limits of queueing networks and in the study of rankbased interacting particle models. Sensitivity analysis of such an RD with respect to its defining parameters is of interest from both … Continue reading Mathematics Colloquium – Dr. David Lipshutz
Cayley-Bacharach theorems and polynomials vanishing on points in projective space If Z is a set of points in real n-space, we can ask which polynomials of degree d in n variables vanish at every point in Z. If P is one point of Z, the vanishing of a polynomial at P imposes one linear condition … Continue reading Mathematics Colloquium – Dr. Brooke Ullery
Homogeneous perfect binary trees Perfect binary trees typically have highly inhomogeneous branches; for example, if a perfect tree is computable, then for any set A there is a branch of higher degree than A. I will examine properties such that it is possible to construct perfect binary trees every branch of which have the property. … Continue reading Mathematics Colloquium – Dr. Achilles Beros
Orbit equivalences of Borel flows We provide an overview of the orbit equivalence theory of Borel flows. In general, an orbit equivalence of two group actions is a bijective map between phase spaces that maps orbits onto orbits. Such maps are often further required to posses regularity properties depending on the category of group actions … Continue reading Mathematics Colloquium – Dr. Konstantin Slutsky
Large random pattern-avoiding permutations A pattern in a permutation is a subsequence with a specific relative order. What can we say about a typical large random permutation that avoids a particular pattern? We use a variety of approaches. For certain classes we give a geometric description that relates these classes to other types of well-studied … Continue reading Mathematics Colloquium – Dr. Erik Slivken
Perspectives on the transformation of random sequences The theory of algorithmic randomness provides a framework for studying the behavior of algorithmically random sequences under effective transformations, i.e. transformations that are Turing computable. In this talk, I will take as a starting point a theorem due to Demuth, which states that if we apply a total … Continue reading Mathematics Colloquium – Dr. Christopher Porter
Come to a day of mathematics-filled fun for young women in grades 6-12 and their teachers/guardians! The day will include a keynote session featuring “The One-Cut Problem”, hands-on mathematical workshops, and opportunities to meet women working in mathematics! In honor of Sonia Kovalevsky, Iowa State University is organizing a Sonia Kovalevsky Mathematics Day. Young women … Continue reading Sonia Kovalevsky Mathematics Day 2019
Please join us as we celebrate our undergraduate and graduate students!
Please join us to congratulate two Mathematics leaders upon their retirements from Iowa State University!