Previous Conferences & Workshops

we will describe various models of sparse and planar graphs and the associated distributions of eigenvalues (and eigenvalue spacings) which come up. The talk will be light on theorems, and heavy on experimental data.

If K is the rational function field K=Q(t), then a polynomial f in K[x] can be regarded as a one-parameter family of polynomials. If f is irreducible, then a basic form of Hilbert's irreducibility theorem states that there are infinitely many...

Let p and l be two distinct prime numbers, and fix a positive integer d . I will explain how the F_l-cohomology complex of the Lubin-Tate tower of height d of a p-adic field K realizes mod l versions of both the semi-simple Langlands correspondence...

Let p be an odd prime number and let F be a totally real field. Let F_cyc be the cyclotomic extension of F generated by the roots of unity of order a power of p . From the maximal abelian extension of F_cyc which is unramified (resp. unramified...

Associated to any simplicial graph there is a right-angled Coxeter group. Invariants of the Coxeter group such as its growth series or its weighted L^2 Betti numbers can be computed from the graph's clique complex (i.e., its flag complex).

A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns intersect in at...

The systolic inequality says that if we take any metric on an n-dimensional torus with volume 1, then we can find a non-contractible curve in the torus with length at most C(n). A remarkable feature of the inequality is how general it is: it holds...