Classification Problems in Ergodic Theory

Speaker: 

Matthew Foreman

Institution: 

UC Irvine

Time: 

Friday, February 26, 2016 - 4:00pm

Location: 

MSTB 120

In 1932 von Neumann proposed classifying the statistical behavior of physical systems. The idea was to take a diffeomorphism of a compact manifold and describe what one might observe as random (as in coin flipping) or predictable (as in a translation on a compact group), or even better have a dictionary  in which one could look up the precise behavior.

Remarkable progress was made on this problem; benchmarks include the Halmos-von Neumann theorem on discrete spectrum and the work of Kolmogorov on Entropy that culminated in the Ornstein classification of Bernoulli shifts. One genre of applications of this theory were the results of Furstenberg on Szemeredi’s theorem and eventually the work of  Green and Tao.

Still the problem resisted a complete solution. Strange examples of completely determined systems that showed completely random statistical behavior began to surface. Starting in the 1990’s anti-classification theorems began to appear. These results showed, in a rigorous way, that complete invariants for measure preserving systems cannot exist. Moreover the isomorphism relation itself is completely intractable. Very recently these results were extended to measure preserving diffeomorphisms of the 2-torus.

Curves over Finite Fields and Coding Theory

Speaker: 

Nathan Kaplan

Institution: 

UC Irvine

Time: 

Friday, December 4, 2015 - 4:00pm

Location: 

MSTB 120

What is the maximum number of rational points on a curve of genus g over a finite field of size q?  What is the distribution of rational point counts for degree d plane curves over a fixed finite field?  We discuss these and several related questions and show how to use curves over finite fields to construct interesting error-correcting codes.

Question and answer session with experienced TAs

Speaker: 

Alessandra Pantano, Chris Davis

Institution: 

UC Irvine

Time: 

Friday, November 13, 2015 - 4:00pm

Location: 

MSTB 120

This week's graduate seminar will feature a question-and-answer session with experienced TAs.  Come prepared with your own questions, and try to make them as specific as possible.  For example, "How do you teach effectively?" vs "How do you encourage participation?" vs "Have you ever had a class where students will not speak, no matter how hard you try?"  Do you agree that the last one is so much easier to answer?  

Perfect and Scattered Subsets of Generalized Cantor Space V

Speaker: 

Geoff Galgon

Institution: 

UCI

Time: 

Monday, November 9, 2015 - 4:00pm to 5:30pm

Host: 

Location: 

RH 440R

We continue our discussion of perfect and scattered subsets in the generalized Cantor space. This week we finish the proof of the fact that \kappa-closed forcings don't add branches to \kappa-scattered subsets of 2^{\kappa}. We then introduce a collection of topologies over 2^{\lambda} whose restrictions to P_{\kappa}\lambda have some desirable properties. These topologies will rely on the notion of a P_{\kappa}\lambda-forest, which is a natural generalization of a tree. 

The spectral gap for random regular graphs

Speaker: 

Tobias Johnson

Institution: 

USC

Time: 

Tuesday, January 12, 2016 - 11:00am to 12:00pm

Host: 

Location: 

RH 306

Expander graphs are useful across mathematics, all the way from number theory to applied computer science. The smaller the second eigenvalue of a regular graph, the better expander it is. Since this connection was discovered in the 1980s, researchers have tried to pinpoint the second eigenvalue of random regular graphs. The most prominent work in this direction was Joel Friedman's proof of Noga Alon's conjecture from 1985 that for a random d-regular graph on n vertices, the second eigenvalue is almost as small as possible, with high probability as n tends to infinity with d held fixed.

We consider the case of denser graphs, where d and n are both growing. Here, the best result (Broder, Frieze, Suen, Upfal 1999) holds only if d = o(n^(1/2)). We extend this to d = O(n^(2/3)). Our result relies on new concentration inequalities for statistics of random regular graphs based on the theory of size biased couplings, an offshoot of Stein's method. The theory we develop should be useful for proving concentration inequalities in a broad range of settings. This is joint with Nicholas Cook and Larry Goldstein.

Pages

Subscribe to UCI Mathematics RSS