F Nous contacter


0

Research talks  | enregistrements trouvés : 715

O

-A +A

Sélection courante (0) : Tout sélectionner / Tout déselectionner

P Q

In this talk, I will present ColDICE[1, 2], a publicly available parallel numerical solver designed to solve the Vlasov-Poisson equations in the cold case limit. The method is based on the representation of the phase-space sheet as a conforming, self-adaptive simplicial tessellation whose vertices follow the Lagrangian equations of motion. In this presentation, I will mainly focus on describing the underlying algorithm and its practical implementation, as well as showing a few practical examples demonstrating its capabilities. In this talk, I will present ColDICE[1, 2], a publicly available parallel numerical solver designed to solve the Vlasov-Poisson equations in the cold case limit. The method is based on the representation of the phase-space sheet as a conforming, self-adaptive simplicial tessellation whose vertices follow the Lagrangian equations of motion. In this presentation, I will mainly focus on describing the underlying algorithm and its practical ...

65Mxx ; 45K05 ; 65Y05 ; 76W05 ; 85A30

Post-edited  Bootstrap percolation on Erdos-Renyi graphs
Angel, Omer (Auteur de la Conférence) | CIRM (Editeur )

We consider bootstrap percolation on the Erdos-Renyi graph: given an initial infected set, a vertex becomes infected if it has at least $r$ infected neighbours. The graph is susceptible if there exists an initial set of size $r$ that infects the whole graph. We identify the critical threshold for susceptibility. We also analyse Bollobas's related graph-bootstrap percolation model.
Joint with Brett Kolesnik.

05C80 ; 60K35 ; 60J85 ; 82B26 ; 82B43

Post-edited  Distributive Aronszajn trees
Rinot, Assaf (Auteur de la Conférence) | CIRM (Editeur )

It is well-known that the statement "all $\aleph_1$-Aronszajn trees are special'' is consistent with ZFC (Baumgartner, Malitz, and Reinhardt), and even with ZFC+GCH (Jensen). In contrast, Ben-David and Shelah proved that, assuming GCH, for every singular cardinal $\lambda$: if there exists a $\lambda^+$-Aronszajn tree, then there exists a non-special one. Furthermore:
Theorem (Ben-David and Shelah, 1986) Assume GCH and that $\lambda$ is singular cardinal. If there exists a special $\lambda^+$-Aronszajn tree, then there exists a $\lambda$-distributive $\lambda^+$-Aronszajn tree.
This suggests that following stronger statement:
Conjecture. Assume GCH and that $\lambda$ is singular cardinal.
If there exists a $\lambda^+$-Aronszajn tree,
then there exists a $\lambda$-distributive $\lambda^+$-Aronszajn tree.

The assumption that there exists a $\lambda^+$-Aronszajn tree is a very mild square-like hypothesis (that is, $\square(\lambda^+,\lambda)$).
In order to bloom a $\lambda$-distributive tree from it, there is a need for a toolbox, each tool taking an abstract square-like sequence and producing a sequence which is slightly better than the original one.
For this, we introduce the monoid of postprocessing functions and study how it acts on the class of abstract square sequences.
We establish that, assuming GCH, the monoid contains some very powerful functions. We also prove that the monoid is closed under various mixing operations.
This allows us to prove a theorem which is just one step away from verifying the conjecture:

Theorem 1. Assume GCH and that $\lambda$ is a singular cardinal.
If $\square(\lambda^+,<\lambda)$ holds, then there exists a $\lambda$-distributive $\lambda^+$-Aronszajn tree.
Another proof, involving a 5-steps chain of applications of postprocessing functions, is of the following theorem.

Theorem 2. Assume GCH. If $\lambda$ is a singular cardinal and $\square(\lambda^+)$ holds, then there exists a $\lambda^+$-Souslin tree which is coherent mod finite.

This is joint work with Ari Brodsky. See: http://assafrinot.com/paper/29
It is well-known that the statement "all $\aleph_1$-Aronszajn trees are special'' is consistent with ZFC (Baumgartner, Malitz, and Reinhardt), and even with ZFC+GCH (Jensen). In contrast, Ben-David and Shelah proved that, assuming GCH, for every singular cardinal $\lambda$: if there exists a $\lambda^+$-Aronszajn tree, then there exists a non-special one. Furthermore:
Theorem (Ben-David and Shelah, 1986) Assume GCH and that $\lambda$ is singular ...

03E05 ; 03E65 ; 03E35 ; 05C05

The Toeplitz square peg problem asks if every simple closed curve in the plane inscribes a square. This is known for sufficiently regular curves (e.g. polygons), but is open in general. We show that the answer is affirmative if the curve consists of two Lipschitz graphs of constant less than 1 using an integration by parts technique, and give some related problems which look more tractable.

55N45

In the first part, we describe the canonical model structure on the category of strict $\omega$-categories and how it transfers to related subcategories. We then characterize the cofibrant objects as $\omega$-categories freely generated by polygraphs and introduce the key notion of polygraphic resolution. Finally, by considering a monoid as a particular $\omega$-category, this polygraphic point of view will lead us to an alternative definition of monoid homology, which happens to coincide with the usual one. In the first part, we describe the canonical model structure on the category of strict $\omega$-categories and how it transfers to related subcategories. We then characterize the cofibrant objects as $\omega$-categories freely generated by polygraphs and introduce the key notion of polygraphic resolution. Finally, by considering a monoid as a particular $\omega$-category, this polygraphic point of view will lead us to an alternative definition ...

18D05 ; 18G55 ; 18G50 ; 18G10

I will explain how to bound from above and below the expected Betti numbers of a random subcomplex in a simplicial complex and get asymptotic results under infinitely many barycentric subdivisions. This is a joint work with Nermin Salepci. It complements previous joint works with Damien Gayet on random topology.

52Cxx ; 60C05 ; 60B05 ; 55U10

The partially disjoint paths problem asks for paths $P_1, \ldots,P_k$ between given pairs of terminals, while certain pairs of paths $P_i$,$P_j$ are required to be disjoint. With the help of combinatorial group theory, we show that, for fixed $k$, this problem can be solved in polynomial time for planar directed graphs. We also discuss related problems. No specific foreknowledge is required.

05C10 ; 05C20 ; 05C25 ; 05C38 ; 68Q25 ; 90C27

I shall classify current approaches to multiple inferences according to goals, and discuss the basic approaches being used. I shall then highlight a few challenges that await our attention : some are simple inequalities, others arise in particular applications.

62J15 ; 62P10

The cubic Szegö equation has been introduced as a toy model for totally non dispersive evolution equations. It turned out that it is a complete integrable Hamiltonian system for which we built a non linear Fourier transform giving an explicit expression of the solutions.
This explicit formula allows to study the dynamics of the solutions. We will explain different aspects of it: almost-periodicity of the solutions in the energy space, uniform analyticity for a large set of initial data, turbulence phenomenon for a dense set of smooth initial data in large Sobolev spaces.
From joint works with Patrick Gérard.
The cubic Szegö equation has been introduced as a toy model for totally non dispersive evolution equations. It turned out that it is a complete integrable Hamiltonian system for which we built a non linear Fourier transform giving an explicit expression of the solutions.
This explicit formula allows to study the dynamics of the solutions. We will explain different aspects of it: almost-periodicity of the solutions in the energy space, uniform ...

35B40 ; 35B15 ; 35Q55 ; 37K15 ; 47B35

Post-edited  Taming the coloured multizetas
Ecalle, Jean (Auteur de la Conférence) | CIRM (Editeur )

1. We shall briefly describe the ARI-GARI structure; recall its double origin in Analysis and mould theory; explain what makes it so well-suited to the study of multizetas; and review the most salient results it led to, beginning with the exchanger $adari(pal^\bullet)$ of double symmetries $(\underline{al}/\underline{il}) \leftrightarrow (\underline{al}/\underline{al})$, and culminating in the explicit decomposition of multizetas into a remarkable system of irreducibles, positioned exactly half-way between the two classical multizeta encodings, symmetral resp. symmetrel.

2. Although the coloured, esp. two-coloured, multizetas are in many ways more regular and better-behaved than the plain sort, their sheer numbers soon make them computationally intractable as the total weight $\sum s_i$ increases. But help is at hand: we shall show a conceptual way round this difficulty; make explicit its algebraic implementation; and sketch some of the consequences.

A few corrections and comments about this talk are available in the PDF file at the bottom of the page.
1. We shall briefly describe the ARI-GARI structure; recall its double origin in Analysis and mould theory; explain what makes it so well-suited to the study of multizetas; and review the most salient results it led to, beginning with the exchanger $adari(pal^\bullet)$ of double symmetries $(\underline{al}/\underline{il}) \leftrightarrow (\underline{al}/\underline{al})$, and culminating in the explicit decomposition of multizetas into a ...

11M32

Birch gave an extremely efficient algorithm to compute a certain subspace of classical modular forms using the Hecke action on classes of ternary quadratic forms. We extend this method to compute all forms of non-square level using the spinor norm, and we exhibit an implementation that is very fast in practice. This is joint work with Jeffery Hein and Gonzalo Tornaria.

11E20 ; 11F11 ; 11F37 ; 11F27

In spite of enormous success of the theory of integrable systems, at least three important problems are not resolved yet or are resolved only partly. They are the following:
1. The IST in the case of arbitrary bounded initial data.
2. The statistical description of the systems integrable by the IST. Albeit, the development of the theory of integrable turbulence.
3. Integrability of the deep water equations.
These three problems will be discussed in the talk.
In spite of enormous success of the theory of integrable systems, at least three important problems are not resolved yet or are resolved only partly. They are the following:
1. The IST in the case of arbitrary bounded initial data.
2. The statistical description of the systems integrable by the IST. Albeit, the development of the theory of integrable turbulence.
3. Integrability of the deep water equations.
These three problems will be discussed ...

37K10 ; 35C07 ; 35C08 ; 35Q53 ; 35Q55 ; 76B15 ; 76Fxx

We consider the operator $\mathcal{A}_h = -h^2 \Delta + iV$ in the semi-classical limit $h \to 0$, where $V$ is a smooth real potential with no critical points. We obtain both the left margin of the spectrum, as well as resolvent estimates on the left side of this margin. We extend here previous results obtained for the Dirichlet realization of $\mathcal{A}_h$ by removing significant limitations that were formerly imposed on $V$. In addition, we apply our techniques to the more general Robin boundary condition and to a transmission problem which is of significant interest in physical applications. We consider the operator $\mathcal{A}_h = -h^2 \Delta + iV$ in the semi-classical limit $h \to 0$, where $V$ is a smooth real potential with no critical points. We obtain both the left margin of the spectrum, as well as resolvent estimates on the left side of this margin. We extend here previous results obtained for the Dirichlet realization of $\mathcal{A}_h$ by removing significant limitations that were formerly imposed on $V$. In addition, ...

35J10 ; 35P10 ; 35P15 ; 47A10 ; 81Q12 ; 82D55

In the first half of the talk, I will survey results and open problems on transience of self-interacting martingales. In particular, I will describe joint works with S. Popov, P. Sousi, R. Eldan and F. Nazarov on the tradeoff between the ambient dimension and the number of different step distributions needed to obtain a recurrent process. In the second, unrelated, half of the talk, I will present joint work with Tom Hutchcroft, showing that the component structure of the uniform spanning forest in $\mathbb{Z}^d$ changes every dimension for $d > 8$. This sharpens an earlier result of Benjamini, Kesten, Schramm and the speaker (Annals Math 2004), where we established a phase transition every four dimensions. The proofs are based on a the connection to loop-erased random walks. In the first half of the talk, I will survey results and open problems on transience of self-interacting martingales. In particular, I will describe joint works with S. Popov, P. Sousi, R. Eldan and F. Nazarov on the tradeoff between the ambient dimension and the number of different step distributions needed to obtain a recurrent process. In the second, unrelated, half of the talk, I will present joint work with Tom Hutchcroft, showing that the ...

05C05 ; 05C80 ; 60G50 ; 60J10 ; 60K35 ; 82B43

Post-edited  Large gaps between primes in subsets
Maynard, James (Auteur de la Conférence) | CIRM (Editeur )

All previous methods of showing the existence of large gaps between primes have relied on the fact that smooth numbers are unusually sparse. This feature of the argument does not seem to generalise to showing large gaps between primes in subsets, such as values of a polynomial. We will talk about recent work which allows us to show large gaps between primes without relying on smooth number estimates. This then generalizes naturally to show long strings of consecutive composite values of a polynomial. This is joint work with Ford, Konyagin, Pomerance and Tao. All previous methods of showing the existence of large gaps between primes have relied on the fact that smooth numbers are unusually sparse. This feature of the argument does not seem to generalise to showing large gaps between primes in subsets, such as values of a polynomial. We will talk about recent work which allows us to show large gaps between primes without relying on smooth number estimates. This then generalizes naturally to show long ...

11N05 ; 11N35 ; 11N36

Post-edited  Detection theory and novelty filters
Morel, Jean-Michel (Auteur de la Conférence) | CIRM (Editeur )

In this presentation based on on-line demonstrations of algorithms and on the examination of several practical examples, I will reflect on the problem of modeling a detection task in images. I will place myself in the (very frequent) case where the detection task can not be formulated in a Bayesian framework or, rather equivalently that can not be solved by simultaneous learning of the model of the object and that of the background. (In the case where there are plenty of examples of the background and of the object to be detected, the neural networks provide a practical answer, but without explanatory power). Nevertheless for the detection without "learning", I will show that we can not avoid building a background model, or possibly learn it. But this will not require many examples.

Joint works with Axel Davy, Tristan Dagobert, Agnes Desolneux, Thibaud Ehret.
In this presentation based on on-line demonstrations of algorithms and on the examination of several practical examples, I will reflect on the problem of modeling a detection task in images. I will place myself in the (very frequent) case where the detection task can not be formulated in a Bayesian framework or, rather equivalently that can not be solved by simultaneous learning of the model of the object and that of the background. (In the case ...

65D18 ; 68U10 ; 68T05

Post-edited  The Onsager Theorem
De Lellis, Camillo (Auteur de la Conférence) | CIRM (Editeur )

In the fifties John Nash astonished the geometers with his celebrated isometric embedding theorems. A folkloristic explanation of his first theorem is that you should be able to put any piece of paper in your pocket without crumpling or folding it, no matter how large it is.
Ten years ago László Székelyhidi and I discovered unexpected similarities with the behavior of some classical equations in fluid dynamics. Our remark sparked a series of discoveries and works which have gone in several directions. Among them the most notable is the recent proof of Phil Isett of a long-standing conjecture of Lars Onsager in the theory of turbulent flows. In a joint work with László, Tristan Buckmaster and Vlad Vicol we improve Isett's theorem to show the existence of dissipative solutions of the incompressible Euler equations below the Onsager's threshold.
In the fifties John Nash astonished the geometers with his celebrated isometric embedding theorems. A folkloristic explanation of his first theorem is that you should be able to put any piece of paper in your pocket without crumpling or folding it, no matter how large it is.
Ten years ago László Székelyhidi and I discovered unexpected similarities with the behavior of some classical equations in fluid dynamics. Our remark sparked a series of ...

35Q31 ; 35D30 ; 76B03

There is a very general story, due to Joyce and Kontsevich-Soibelman, which associates to a CY3 (three-dimensional Calabi-Yau) triangulated category equipped with a stability condition some rational numbers called Donaldson-Thomas (DT) invariants. The point I want to emphasise is that the wall-crossing formula, which describes how these numbers change as the stability condition is varied, takes the form of an iso-Stokes condition for a family of connections on the punctured disc, where the structure group is the infinite-dimensional group of symplectic automorphisms of an algebraic torus. I will not assume any knowledge of stability conditions, DT invariants etc. There is a very general story, due to Joyce and Kontsevich-Soibelman, which associates to a CY3 (three-dimensional Calabi-Yau) triangulated category equipped with a stability condition some rational numbers called Donaldson-Thomas (DT) invariants. The point I want to emphasise is that the wall-crossing formula, which describes how these numbers change as the stability condition is varied, takes the form of an iso-Stokes condition for a family of ...

14F05 ; 18E30 ; 14D20 ; 81T20 ; 32G15

Z