Yonatan Gutman (Polish Academy of Sciences)
Probabilistic delay embedding and prediction abstract
Abstract:
Let $X \\subset \\R^N$ be a Borel set, $\\mu$ a Borel probability measure on $X$ and $T:X \\to X$ a Lipschitz and injective map. Fix $k \\in \\N$ greater than the Hausdorff dimension of $X$ and assume that the set of $p$-periodic points has dimension smaller than $p$ for $p=1, \\ldots,k-1$. We prove that for a typical polynomial perturbation $\\tilde{h}$ of a given Lipschitz map $h : X \\to \\R$, the $k$-delay coordinate map $x \\mapsto (\\tilde{h}(x), \\tilde{h}(Tx), \\ldots, \\tilde{h}(T^{k-1}x))$is injective on a set of full measure $\\mu$. This is a probabilistic version of the Takens delay embedding theorem as proven by Sauer, Yorke and Casdagli (1991). We use this theorem in order to establishan almost-sure predictable reconstruction conjecture by Shroer, Sauer, Ott and Yorke (1998) for ergodic measures.
This is joint work with Krzysztof Barański and Adam Śpiewak.
16:15 • Université de Genève, Section Mathématiques, Salle 1-15
Prof. Dr. Bjorn Poonen (Massachusetts Institute of Technology)
Abstract:Hilbert\'s tenth problem asked for an algorithm that, given a multivariable polynomial equation with integer coefficients, would decide whether there exists a solution in integers. Around 1970, Matiyasevich, building on earlier work of Davis, Putnam, and Robinson, showed that no such algorithm exists. But the answer to the analogous question with integers replaced by rational numbers is still unknown, and there is not even agreement among experts as to what the answer should be. The second half of the lecture will explore some of the techniques from arithmetic geometry that have been used towards answering this question and the related question for the ring of integers of a number field.
Note: in order to obtain a Zoom link, please inscribe yourself ahead of time at
https://vinberg.combgeo.org 16:30 • Université de Neuchâtel, MIPT, and Rutgers University: Zoom