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

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

  • Systems of homogeneous polynomials over finite fields with maximum number of common zeros (Sudhir Ghorpade, IIT Bombay)

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

    It is elementary and well known that a nonzero polynomial in one variable of degree d with coefficients in a field F has at most d zeros in F. It is meaningful to ask similar questions for systems of several polynomials in several variables of a fixed degree, provided the base field F is finite. […]