Title: Geometric classification problems with the Bergman metric Abstract: One of the common problems in mathematics is the classification problem: When are two mathematical structures really the same? The classification […]
We'll be back next week!
CCMS Colloquium invites you to a talk by Professor Ko Honda, Professor of Mathematics at UCLA. Title: Morse theory, Floer homology, and string topology Abstract: One of the most important theories in […]
In a remarkable series of papers Zlil Sela classified the first-order theories of free groups and torsion-free hyperbolic groups using geometric structures he called towers, and independently Olga Kharlampovich and […]
We prove, in this joint work with Maksym Radziwill, a 1978 conjecture of S. Patterson (conditional on the Generalized Riemann Hypothesis) concerning the bias of cubic Gauss sums. This explains […]
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. […]
Discrete Calculus studies discrete structures, such as sequences and graphs, using techniques similar to those used in Calculus for continuous functions. The basic idea of generating functions is to associate […]
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 […]
Given a prime p, let P(t) be a non-constant monic polynomial in t over the ring of p-adic integers. Let X(n) be an n x n uniformly random (0,1)-matrix over […]
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 […]
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 […]
There are two different measures of how far a given Euclidean lattice is from being orthogonal -- the orthogonality defect and the average coherence. The first of these comes from […]
