• 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 […]

  • Biquandle arrow weights (Sam Nelson, CMC)

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

    Many knot invariants are defined from features of knot projections such as arcs or crossings. Gauss diagrams provide an alternative combinatorial scheme for representing knots. In this talk we will […]

  • On zeros of multilinear polynomials (Max Forst, CGU)

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

    Consider rational polynomials in multiple variables that are linear with respect to some of the variables. In this talk we discuss the problem of finding a zero of such polynomials […]

  • Robust properties of graphs (Asaf Ferber, UC Irvine)

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

    In this talk we will consider some notions of `robustness' of graph/hypergraph properties. We will survey some existing results and will try to emphasize the following new result (joint with […]

  • Noise stability of ranked choice voting (Steven Heilman, USC)

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

    Given votes for candidates, what is the best way to determine the winner of the election, if some of the votes have been corrupted or miscounted?  As we saw in […]