m
• E

F Nous contacter

0

# Documents  Kulaga-Przymus, Joanna | enregistrements trouvés : 15

O

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Integral points on Markoff type cubic surfaces and dynamics Sarnak, Peter | CIRM H

Post-edited

Research talks;Dynamical Systems and Ordinary Differential Equations;Number Theory

Cubic surfaces in affine three space tend to have few integral points .However certain cubics such as $x^3 + y^3 + z^3 = m$, may have many such points but very little is known. We discuss these questions for Markoff type surfaces: $x^2 +y^2 +z^2 -x\cdot y\cdot z = m$ for which a (nonlinear) descent allows for a study. Specifically that of a Hasse Principle and strong approximation, together with "class numbers" and their averages for the corresponding nonlinear group of morphims of affine three space. Cubic surfaces in affine three space tend to have few integral points .However certain cubics such as $x^3 + y^3 + z^3 = m$, may have many such points but very little is known. We discuss these questions for Markoff type surfaces: $x^2 +y^2 +z^2 -x\cdot y\cdot z = m$ for which a (nonlinear) descent allows for a study. Specifically that of a Hasse Principle and strong approximation, together with "class numbers" and their averages for the ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Interview at CIRM: Peter Sarnak Sarnak, Peter | CIRM H

Post-edited

Outreach;Mathematics Education and Popularization of Mathematics

Peter Sarnak is a South African-born mathematician with dual South-African and American nationalities. He has been Eugene Higgins Professor of Mathematics at Princeton University since 2002, succeeding Andrew Wiles, and is an editor of the Annals of Mathematics. He is known for his work in analytic number theory. Sarnak is also on the permanent faculty at the School of Mathematics of the Institute for Advanced Study. He also sits on the Board of Adjudicators and the selection committee for the Mathematics award, given under the auspices of the Shaw Prize.

Sarnak graduated University of the Witwatersrand (B.Sc. 1975) and Stanford University (Ph.D. 1980), under the direction of Paul Cohen. Sarnak’s highly cited work (with A. Lubotzky and R. Philips) applied deep results in number theory to Ramanujan graphs, with connections to combinatorics and computer science.

Peter Sarnak was awarded the Polya Prize of Society of Industrial & Applied Mathematics in 1998, the Ostrowski Prize in 2001, the Levi L. Conant Prize in 2003, the Frank Nelson Cole Prize in Number Theory in 2005 and a Lester R. Ford Award in 2012. He is the recipient of the 2014 Wolf Prize in Mathematics.

He was also elected as member of the National Academy of Sciences (USA) and Fellow of the Royal Society (UK) in 2002. He was awarded an honorary doctorate by the Hebrew University of Jerusalem in 2010. He was also awarded an honorary doctorate by the University of Chicago in 2015.
Peter Sarnak is a South African-born mathematician with dual South-African and American nationalities. He has been Eugene Higgins Professor of Mathematics at Princeton University since 2002, succeeding Andrew Wiles, and is an editor of the Annals of Mathematics. He is known for his work in analytic number theory. Sarnak is also on the permanent faculty at the School of Mathematics of the Institute for Advanced Study. He also sits on the Board of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Mutually enriching connections between ergodic theory and combinatorics - part 1 Bergelson, Vitaly | CIRM H

Multi angle

Research School;Combinatorics;Dynamical Systems and Ordinary Differential Equations

* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of this result. Third principle: The sought-after configurations which are always to be found in large sets are abundant.

* Furstenberg's Dynamical approach :
Partition Ramsey theory and topological dynamics Dynamical versions of van der Waerden's theorem, Hindman's theorem and Graham-Rothschild-Spencer's geometric Ramsey.
Density Ramsey theory and Furstenberg's correspondence principle Furstenberg's correspondence principle. Ergodic Szemeredi's theorem. Polynomial Szemeredi theorem. Density version of the Hales-Jewett theorem.

* Stone-Cech compactifications and Hindman's theorem :
Topological algebra in Stone-Cech compactifications. Proof of Hind-man's theorem via Poincare recurrence theorem for ultrafilters.

* IP sets and ergodic Ramsey theory :
Applications of IP sets and idempotent ultrafilters to ergodic-theoretical multiple recurrence and to density Ramsey theory. IP-polynomial Szemeredi theorem.

* Open problems and conjectures

If time permits:
* The nilpotent connection,
* Ergodic Ramsey theory and amenable groups
* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Mutually enriching connections between ergodic theory and combinatorics - part 2 Bergelson, Vitaly | CIRM H

Multi angle

Research School;Combinatorics;Dynamical Systems and Ordinary Differential Equations

* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of this result. Third principle: The sought-after configurations which are always to be found in large sets are abundant.

* Furstenberg's Dynamical approach :
Partition Ramsey theory and topological dynamics Dynamical versions of van der Waerden's theorem, Hindman's theorem and Graham-Rothschild-Spencer's geometric Ramsey.
Density Ramsey theory and Furstenberg's correspondence principle Furstenberg's correspondence principle. Ergodic Szemeredi's theorem. Polynomial Szemeredi theorem. Density version of the Hales-Jewett theorem.

* Stone-Cech compactifications and Hindman's theorem :
Topological algebra in Stone-Cech compactifications. Proof of Hind-man's theorem via Poincare recurrence theorem for ultrafilters.

* IP sets and ergodic Ramsey theory :
Applications of IP sets and idempotent ultrafilters to ergodic-theoretical multiple recurrence and to density Ramsey theory. IP-polynomial Szemeredi theorem.

* Open problems and conjectures

If time permits:
* The nilpotent connection,
* Ergodic Ramsey theory and amenable groups
* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Mutually enriching connections between ergodic theory and combinatorics - part 3 Bergelson, Vitaly | CIRM H

Multi angle

Research School;Combinatorics;Dynamical Systems and Ordinary Differential Equations

* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of this result. Third principle: The sought-after configurations which are always to be found in large sets are abundant.

* Furstenberg's Dynamical approach :
Partition Ramsey theory and topological dynamics Dynamical versions of van der Waerden's theorem, Hindman's theorem and Graham-Rothschild-Spencer's geometric Ramsey.
Density Ramsey theory and Furstenberg's correspondence principle Furstenberg's correspondence principle. Ergodic Szemeredi's theorem. Polynomial Szemeredi theorem. Density version of the Hales-Jewett theorem.

* Stone-Cech compactifications and Hindman's theorem :
Topological algebra in Stone-Cech compactifications. Proof of Hind-man's theorem via Poincare recurrence theorem for ultrafilters.

* IP sets and ergodic Ramsey theory :
Applications of IP sets and idempotent ultrafilters to ergodic-theoretical multiple recurrence and to density Ramsey theory. IP-polynomial Szemeredi theorem.

* Open problems and conjectures

If time permits:
* The nilpotent connection,
* Ergodic Ramsey theory and amenable groups
* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Mutually enriching connections between ergodic theory and combinatorics - part 4 Bergelson, Vitaly | CIRM H

Multi angle

Research School;Combinatorics;Dynamical Systems and Ordinary Differential Equations

* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of this result. Third principle: The sought-after configurations which are always to be found in large sets are abundant.

* Furstenberg's Dynamical approach :
Partition Ramsey theory and topological dynamics Dynamical versions of van der Waerden's theorem, Hindman's theorem and Graham-Rothschild-Spencer's geometric Ramsey.
Density Ramsey theory and Furstenberg's correspondence principle Furstenberg's correspondence principle. Ergodic Szemeredi's theorem. Polynomial Szemeredi theorem. Density version of the Hales-Jewett theorem.

* Stone-Cech compactifications and Hindman's theorem :
Topological algebra in Stone-Cech compactifications. Proof of Hind-man's theorem via Poincare recurrence theorem for ultrafilters.

* IP sets and ergodic Ramsey theory :
Applications of IP sets and idempotent ultrafilters to ergodic-theoretical multiple recurrence and to density Ramsey theory. IP-polynomial Szemeredi theorem.

* Open problems and conjectures

If time permits:
* The nilpotent connection,
* Ergodic Ramsey theory and amenable groups
* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Mutually enriching connections between ergodic theory and combinatorics - part 5 Bergelson, Vitaly | CIRM H

Multi angle

Research School;Combinatorics;Dynamical Systems and Ordinary Differential Equations

* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of this result. Third principle: The sought-after configurations which are always to be found in large sets are abundant.

* Furstenberg's Dynamical approach :
Partition Ramsey theory and topological dynamics Dynamical versions of van der Waerden's theorem, Hindman's theorem and Graham-Rothschild-Spencer's geometric Ramsey.
Density Ramsey theory and Furstenberg's correspondence principle Furstenberg's correspondence principle. Ergodic Szemeredi's theorem. Polynomial Szemeredi theorem. Density version of the Hales-Jewett theorem.

* Stone-Cech compactifications and Hindman's theorem :
Topological algebra in Stone-Cech compactifications. Proof of Hind-man's theorem via Poincare recurrence theorem for ultrafilters.

* IP sets and ergodic Ramsey theory :
Applications of IP sets and idempotent ultrafilters to ergodic-theoretical multiple recurrence and to density Ramsey theory. IP-polynomial Szemeredi theorem.

* Open problems and conjectures

If time permits:
* The nilpotent connection,
* Ergodic Ramsey theory and amenable groups
* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Mutually enriching connections between ergodic theory and combinatorics - part 6 Bergelson, Vitaly | CIRM H

Multi angle

Research School;Combinatorics;Dynamical Systems and Ordinary Differential Equations

* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of this result. Third principle: The sought-after configurations which are always to be found in large sets are abundant.

* Furstenberg's Dynamical approach :
Partition Ramsey theory and topological dynamics Dynamical versions of van der Waerden's theorem, Hindman's theorem and Graham-Rothschild-Spencer's geometric Ramsey.
Density Ramsey theory and Furstenberg's correspondence principle Furstenberg's correspondence principle. Ergodic Szemeredi's theorem. Polynomial Szemeredi theorem. Density version of the Hales-Jewett theorem.

* Stone-Cech compactifications and Hindman's theorem :
Topological algebra in Stone-Cech compactifications. Proof of Hind-man's theorem via Poincare recurrence theorem for ultrafilters.

* IP sets and ergodic Ramsey theory :
Applications of IP sets and idempotent ultrafilters to ergodic-theoretical multiple recurrence and to density Ramsey theory. IP-polynomial Szemeredi theorem.

* Open problems and conjectures

If time permits:
* The nilpotent connection,
* Ergodic Ramsey theory and amenable groups
* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Mutually enriching connections between ergodic theory and combinatorics - part 7 Bergelson, Vitaly | CIRM H

Multi angle

Research School;Combinatorics;Dynamical Systems and Ordinary Differential Equations

* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of this result. Third principle: The sought-after configurations which are always to be found in large sets are abundant.

* Furstenberg's Dynamical approach :
Partition Ramsey theory and topological dynamics Dynamical versions of van der Waerden's theorem, Hindman's theorem and Graham-Rothschild-Spencer's geometric Ramsey.
Density Ramsey theory and Furstenberg's correspondence principle Furstenberg's correspondence principle. Ergodic Szemeredi's theorem. Polynomial Szemeredi theorem. Density version of the Hales-Jewett theorem.

* Stone-Cech compactifications and Hindman's theorem :
Topological algebra in Stone-Cech compactifications. Proof of Hind-man's theorem via Poincare recurrence theorem for ultrafilters.

* IP sets and ergodic Ramsey theory :
Applications of IP sets and idempotent ultrafilters to ergodic-theoretical multiple recurrence and to density Ramsey theory. IP-polynomial Szemeredi theorem.

* Open problems and conjectures

If time permits:
* The nilpotent connection,
* Ergodic Ramsey theory and amenable groups
* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Mutually enriching connections between ergodic theory and combinatorics - part 8 Bergelson, Vitaly | CIRM H

Multi angle

Research School;Combinatorics;Dynamical Systems and Ordinary Differential Equations

* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of this result. Third principle: The sought-after configurations which are always to be found in large sets are abundant.

* Furstenberg's Dynamical approach :
Partition Ramsey theory and topological dynamics Dynamical versions of van der Waerden's theorem, Hindman's theorem and Graham-Rothschild-Spencer's geometric Ramsey.
Density Ramsey theory and Furstenberg's correspondence principle Furstenberg's correspondence principle. Ergodic Szemeredi's theorem. Polynomial Szemeredi theorem. Density version of the Hales-Jewett theorem.

* Stone-Cech compactifications and Hindman's theorem :
Topological algebra in Stone-Cech compactifications. Proof of Hind-man's theorem via Poincare recurrence theorem for ultrafilters.

* IP sets and ergodic Ramsey theory :
Applications of IP sets and idempotent ultrafilters to ergodic-theoretical multiple recurrence and to density Ramsey theory. IP-polynomial Szemeredi theorem.

* Open problems and conjectures

If time permits:
* The nilpotent connection,
* Ergodic Ramsey theory and amenable groups
* The early results of Ramsey theory :
Hilbert's irreducibility theorem, Dickson-Schur work on Fermat's equation over finite fields, van der Waerden's theorem, Ramsey's theoremand its rediscovery by Erdos and Szekeres.

* Three main principles of Ramsey theory :
First principle: Complete disorder is impossible. Second principle: Behind every 'Partition' result there is a notion of largeness which is responsible for a 'Density' enhancement of ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Ergodicity of the Liouville system implies the Chowla conjecture Frantzikinakis, Nikos | CIRM H

Multi angle

Research talks;Dynamical Systems and Ordinary Differential Equations;Number Theory

The Chowla conjecture asserts that the signs of the Liouville function are distributed randomly on the integers. Reinterpreted in the language of ergodic theory this conjecture asserts that the Liouville dynamical system is a Bernoulli system. We prove that ergodicity of the Liouville system implies the Chowla conjecture. Our argument has an ergodic flavor and combines recent results in analytic number theory, finitistic and infinitary decomposition results involving uniformity norms, and equidistribution results on nilmanifolds. The Chowla conjecture asserts that the signs of the Liouville function are distributed randomly on the integers. Reinterpreted in the language of ergodic theory this conjecture asserts that the Liouville dynamical system is a Bernoulli system. We prove that ergodicity of the Liouville system implies the Chowla conjecture. Our argument has an ergodic flavor and combines recent results in analytic number theory, finitistic and infinitary ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## The diameter of the symmetric group: ideas and tools Helfgott, Harald | CIRM H

Multi angle

Research talks;Combinatorics;Number Theory

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G, A))$ of the Cayley graph $\Gamma(G, A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup A^{-1}$. We are concerned with bounding diam$(G) := max_A$ diam$(\Gamma(G, A))$.
It has long been conjectured that the diameter of the symmetric group of degree $n$ is polynomially bounded in $n$. In 2011, Helfgott and Seress gave a quasipolynomial bound, namely, $O\left (e^{(log n)^{4+\epsilon}}\right )$. We will discuss a recent, much simplified version of the proof.
Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G, A))$ of the Cayley graph $\Gamma(G, A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup A^{-1}$. We are concerned with bounding diam$(G) := max_A$ diam$(\Gamma(G, A))$.
It has long been conjectured that the diameter of the symmetric group of degree $n$ is polynomially bounded in $n$. In 2011, ...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Primes with missing digits Maynard, James | CIRM H

Multi angle

Research talks;Number Theory

We will talk about recent work showing there are infinitely many primes with no $7$ in their decimal expansion. (And similarly with $7$ replaced by any other digit.) This shows the existence of primes in a 'thin' set of numbers (sets which contain at most $X^{1-c}$ elements less than $X$) which is typically vey difficult.
The proof relies on a fun mixture of tools including Fourier analysis, Markov chains, Diophantine approximation, combinatorial geometry as well as tools from analytic number theory.
We will talk about recent work showing there are infinitely many primes with no $7$ in their decimal expansion. (And similarly with $7$ replaced by any other digit.) This shows the existence of primes in a 'thin' set of numbers (sets which contain at most $X^{1-c}$ elements less than $X$) which is typically vey difficult.
The proof relies on a fun mixture of tools including Fourier analysis, Markov chains, Diophantine approximation, com...

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## The unsolved problems of Halmos Weiss, Benjamin | CIRM H

Multi angle

Research talks;Dynamical Systems and Ordinary Differential Equations

Sixty years ago Paul Halmos concluded his Lectures on Ergodic Theory with a chapter Unsolved Problems which contained a list of ten problems. I will discuss some of these and some of the work that has been done on them. He considered actions of $\mathbb{Z}$ but I will also widen the scope to actions of general countable groups.

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

## Ergodic theory and dynamical systems in their interactions with arithmetics and combinatorics.CIRM Jean-Morlet Chair, Fall 2016 Ferenczi, Sébastien ; Kulaga-Przymus, Joanna ; Lemanczyk, Mariusz | Springer;Société Mathématique de France 2018

Ouvrage

- xiv; 431 p.
ISBN 978-3-319-74907-5

Lecture notes in mathematics , 2213

Localisation : Collection 1er étage

Chaire Jean-Morlet # CIRM # système dynamique # théorie des nombres # combinatoire # théorie ergodique # conjecture de Sarnak # disjonction de Möbius # équidistribution # dynamique homogène # spectre de Lagrange # spectre de Markov # ordre apériodique

#### Filtrer

##### Codes MSC

Titres de périodiques et e-books électroniques (Depuis le CIRM)

Ressources Electroniques

Books & Print journals

Recherche avancée

0
Z