Three Fairy Math Stories

Speaker: 

D.Burago

Institution: 

Penn State University

Time: 

Thursday, October 25, 2018 - 2:00pm to 3:00pm

Location: 

RH 306

 Three different math stories in one lecture. Only definitions, motivations, results, some ideas behind proofs, open questions. 

1. One of the greatest achievements in Dynamics in the XX century is the KAM Theory. It says that a small perturbation of a non-degenerate completely integrable system still has an overwhelming measure of invariant tori with quasi-periodic dynamics. What happens outside KAM tori remains a great mystery. The main quantitate invariants so far are entropies.  It is easy, by modern standards, to show that topological entropy can be positive. It lives, however, on a zero measure set. We are now able to show that metric entropy can become positive too, under arbitrarily small C^{infty} perturbations, answering an old-standing problem of Kolmogorov. Furthermore, a slightly modified construction resolves another long–standing problem of the existence of entropy non-expansive systems. In these modified examples  positive metric entropy is generated in arbitrarily small tubular neighborhoods of one trajectory. Joint with S. Ivanov and Dong Chen.

2. 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 in the ocean? This is related to the G-Equation and has applications to its homogenization. The G-equation is believed to govern many combustion processes, say wood fires or combustion in combustion engines (generally, in pre-mixed media with “turbulence".  Based on a joint work with S. Ivanov and A. Novikov.

3. Just 20 years ago the topic of my talk at the ICM was a solution of a problem which goes back to Boltzmann and has been formulated mathematically by 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, one sees that  there can be $n(n-1)/2$ collisions, and this is the 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 perfectly match. Many open questions left.

Study of scarless wound healing goes digital with 5-year, $3.3 million NIH grant to UCI trio

Wound healing is a complex process that involves intricate interplay among multiple skin and immune cell types. When optimal conditions are achieved, wounds can heal by true regeneration, when new hairs and new adipose tissue re-form. However, more commonly, optimal conditions cannot be achieved, and wounds heal by making scars.

Discrete analogues in Harmonic Analysis beyond the Calderon-Zygmund paradigm

Speaker: 

Benjamin Krause

Institution: 

Caltech

Time: 

Tuesday, November 13, 2018 - 3:00pm

Host: 

Location: 

RH 306

Motivated by questions in pointwise ergodic theory, modern discrete harmonic analysis, as developed by Bourgain, has focused on understanding the oscillation of averaging operators - or related singular integral operators - along polynomial curves. In this talk we present the first example of a discrete analog of polynomially modulated oscillatory singular integrals; this begins to unify the work of Bourgain, Stein, and Stein-Wainger. The argument combines a wide range of techniques from Euclidean harmonic analysis and analytic number theory.  

Introduction to engineering topology optimization

Speaker: 

Louis Komzsik

Institution: 

UC Irvine

Time: 

Monday, October 15, 2018 - 4:00pm to 5:00pm

Location: 

RH 306

Engineering topology optimization is a technique to minimize the mass of a structure while maintaining or even increasing its robustness in certain lifecycle applications. The presentation will show the technical foundation based on the finite element method with an embedded gradient based mathematical optimizer. Characteristic application solutions utilizing the method and the intriguing connection to additive manufacturing (3D printing) will also be discussed.

The Minkowski formula and the quasi-local mass

Speaker: 

Po-Ning Chen

Institution: 

UC Riverside

Time: 

Tuesday, November 6, 2018 - 4:00pm to 5:00pm

Location: 

RH 306

In this talk, we will discuss the relationship between the Minkowski formula and the quasi-local mass in general relativity, In particular, we will use the Minkowski formula to estimate the quasi-local mass. Combining the estimate and the positive mass theorem, we obtain rigidity theorems which characterize the Euclidean space and the hyperbolic space.

The degenerate special Lagrangian equation on Riemannian manifolds.

Speaker: 

Matthew Dellatorre

Institution: 

University of Maryland

Time: 

Tuesday, November 13, 2018 - 4:00pm

Location: 

RH 306

We show that the degenerate special Lagrangian equation (DSL), recently introduced by Rubinstein–Solomon, induces a global equation on every Riemannian manifold, and that for certain associated geometries this equation governs, as it does in the Euclidean setting, geodesics in the space of positive Lagrangians. For example, geodesics in the space of positive Lagrangian sections of a smooth Calabi–Yau torus fibration are governed by the Riemannian DSL on the base manifold. We then develop their analytic techniques, specifically modifications of the Dirichlet duality theory of Harvey–Lawson, in the Riemannian setting to obtain continuous solutions to the Dirichlet problem for the Riemannian DSL and hence continuous geodesics in the space of positive Lagrangians

The Computational Spectral Problem and a New Classification Theory: Novel Algorithms, Impossibility Results and Computer Assisted Proofs

Speaker: 

Matt Colbrook

Institution: 

University of Cambridge

Time: 

Monday, November 19, 2018 - 4:00pm

Location: 

RH 306

We will discuss and extend the Solvability Complexity Index (SCI) hierarchy, which is a classification hierarchy for all types of problems in computational mathematics that allows for classifications determining the boundaries of what computers can achieve in scientific computing. The SCI hierarchy captures many key computational issues in the history of mathematics including Smale's problem on the existence of iterative generally convergent algorithm for polynomial root, the computational spectral problem, inverse problems, optimisation, numerical solution of PDEs etc., and also mathematical logic. Perhaps surprisingly, many of the classifications in the SCI hierarchy do not depend on the model of computation used (e.g. BSS, Turing) and in some sense the hierarchy seeks to bridge the gap between numerical analysts (who deal with the continuum) and computer scientists (who deal with the discrete). Informally we classify the number of successive limits (SCI index) of algorithms needed to solve a problem.

The study of the non-computable is needed for several reasons. It is crucial in the field of rigorous numerical analysis and in fact many everyday problems turn out to be not computable. Moreover, the SCI hierarchy helps classifying problems suitable for computer assisted proofs. In particular, undecidable or non-computable problems are used in computer assisted proofs, where the recent example of the resolution of Kepler's conjecture (Hilbert's 18th problem) is a striking example. However, only certain classes of non-computable problems can be used in computer assisted proofs, and the SCI hierarchy helps detecting such classes. Finally, the construction of several limits of algorithms can help tell us what information within the problem is needed to lower the index and provide a numerical procedure.

The SCI hierarchy allows for solving the long standing computational spectral problem, and reveals potential surprises. For example, the problem of computing spectra of compact operators, for which the method has been known for decades, is strictly harder than the problem of computing spectra of Schrodinger operators with bounded potentials, which has been open for more than half a century. We provide an algorithm for the latter problem, thus finally resolving this issue. We also provide the first algorithm that can compute spectra without spectral pollution. The method also provides error control on the output and we provide cutting edge numerical examples showing it to be competitive with state of the art methods (which do not converge in general). The SCI hierarchy also allows one to prove that detecting the problem of spectral pollution is strictly harder than computing the spectrum itself. These problems are samples of what is likely to be a very rich classification theory.

 

p-converse to a theorem of Gross-Zagier, Kolyvagin and Rubin

Speaker: 

Ashay Burungale

Institution: 

Caltech

Time: 

Thursday, November 1, 2018 - 3:00pm to 4:00pm

Location: 

RH 306

Let E be a CM elliptic curve over the rationals with conductor N and p a prime coprime to 6N. If the p^{infty}-Selmer group of E has Z_{p}-corank one, we show that the analytic rank of E is also one (joint with Chris Skinner and Ye Tian). We plan to discuss the setup and strategy in the ordinary case.

Pages

Subscribe to UCI Mathematics RSS