• Bounds for nonzero Littlewood-Richardson coefficients (Müge Taskin, Boğaziçi University, Turkey)

    On Zoom

    As  $\lambda$ runs through all integer partitions, the set of   Schur functions $\{s_{\lambda}\}_\lambda$ forms a basis in the ring of symmetric functions. Hence the rule $$s_{\lambda}s_{\mu}=\sum c_{\lambda,\mu}^{\gamma} s_{\gamma}$$ makes sense and the coefficients $c_{\lambda,\mu}^{\gamma}$ are called \textit{Littlewood-Richardson (LR) coefficients}. The calculations of Littlewood-Richardson coefficients has been an important problem from the first time they were […]

  • Beran’s tests of uniformity for discrete data (Michael Orrison, HMC)

    On Zoom

    Suppose you are given a data set that can be viewed as a nonnegative integer-valued function defined on a finite set. A natural question to ask is whether the data can be viewed as a sample from the uniform distribution on the set, in which case you might want to apply some sort of test […]

  • Arithmetical structures (Luis Garcia Puente, Colorado College)

    Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United States

    An arithmetical structure on a finite, connected graph G without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there […]

  • Spinning switches on a wreath product (Peter Kagey, HMC)

    Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United States

    This talk discusses a puzzle called “Spinning Switches,” based on a problem popularized by Martin Gardner in his February 1979 column of “Mathematical Games". This puzzle can be generalized to […]

  • On the geometry of lattice extensions (Max Forst, CGU)

    Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United States

    Given a lattice L, an extension of L is a lattice M of strictly greater rank so that L is equal to the intersection of the subspace spanned by L […]

  • Properties of redistricting Markov chains (Sarah Cannon, CMC)

    Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United States

    Markov chains have become widely-used to generate random political districting plans. These random districting plans can be used to form a baseline for comparison, and any proposed districting plans that […]

  • Factoring translates of polynomials (Arvind Suresh, University of Arizona – Tucson)

    Davidson Lecture Hall, CMC 340 E 9th St, Claremont, CA, United States

    Given a degree d polynomial f(x) in Q, consider the subset S_f  of Q consisting of rational numbers t for which the translated polynomial f(x) - t factors completely in Q. For example, if f is linear or quadratic then S_f is always infinite, but if degree of f is at least 3, then interesting […]