##### Department of Mathematics,

University of California San Diego

****************************

### Math 295 - Mathematics Colloquium

## Dmitri. Burago

#### Penn State

## Two fairy math tales

##### Abstract:

\textbf{Counting collisions.}20 years ago the topic of my talk at the ICM was a solution of a problem which goes back to Boltzmann and Ya. Sinai. The conjecture of Boltzmann-Sinai states that the number of collisions in a system of $n$ identical balls colliding elastically in empty space is uniformly bounded for all initial positions and velocities of the balls. The answer is affirmative and the proven upper bound is exponential in $n$. The question is how many collisions can actually occur. On the line, there can be $n(n-1)/2$ collisions, and this is he maximum. Since the line embeds in any Euclidean space, the same example works in all dimensions. The only non-trivial (and counter-intuitive) example I am aware of is an observation by Thurston and Sandri who gave an example of 4 collisions between 3 balls in $R^2$. Recently, Sergei Ivanov and me proved that there are examples with exponentially many collisions between $n$ identical balls in $R^3$, even though the exponents in the lower and upper bounds do not match. \noindent \textbf{A survival guide for a feeble fish and homogenization of the G-Equation.} How fish can get from A to B in turbulent waters which maybe much fasted than the locomotive speed of the fish provided that there is no large-scale drift of the water? This is related to G-Equation and has applications to its homogenization. G-equation which is believed to govern many combustion processes. Based on a joint work with S. Ivanov and A. Novikov.

Host: Lei Ni

### October 24, 2018

### 4:00 PM

### AP&M 7321

****************************