m
• E

F Nous contacter

0

# Documents  CIRM | enregistrements trouvés : 1 427

O

P Q

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

## Chain conditions, unbounded colorings and the $C$-sequence spectrum Rinot, Assaf | CIRM H

Post-edited

Research talks

The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970’s, consistent examples of $kappa-cc$ posets whose squares are not $\kappa-cc$ were constructed by Laver, Galvin, Roitman and Fleissner. Later, ZFC examples were constructed by Todorcevic, Shelah, and others. The most difficult case, that in which $\kappa = \aleph{_2}$, was resolved by Shelah in 1997.
In the first part of this talk, we shall present analogous results regarding the infinite productivity of chain conditions stronger than $\kappa-cc$. In particular, for any successor cardinal $\kappa$, we produce a ZFC example of a poset with precaliber $\kappa$ whose $\omega ^{th}$ power is not $\kappa-cc$. To do so, we introduce and study the principle $U(\kappa , \mu , \theta , \chi )$ asserting the existence of a coloring $c:\left [ \kappa \right ]^{2}\rightarrow \theta$ satisfying a strong unboundedness condition.
In the second part of this talk, we shall introduce and study a new cardinal invariant $\chi \left ( \kappa \right )$ for a regular uncountable cardinal $\kappa$ . For inaccessible $\kappa$, $\chi \left ( \kappa \right )$ may be seen as a measure of how far away $\kappa$ is from being weakly compact. We shall prove that if $\chi \left ( \kappa \right )> 1$, then $\chi \left ( \kappa \right )=max(Cspec(\kappa ))$, where:
(1) Cspec$(\kappa)$ := {$\chi (\vec{C})\mid \vec{C}$ is a sequence over $\kappa$} $\setminus \omega$, and
(2) $\chi \left ( \vec{C} \right )$ is the least cardinal $\chi \leq \kappa$ such that there exist $\Delta\in\left [ \kappa \right ]^{\kappa }$ and
b : $\kappa \rightarrow \left [ \kappa \right ]^{\chi }$ with $\Delta \cap \alpha \subseteq \cup _{\beta \in b(\alpha )}C_{\beta }$ for every $\alpha < \kappa$.
We shall also prove that if $\chi (\kappa )=1$, then $\kappa$ is greatly Mahlo, prove the consistency (modulo the existence of a supercompact) of $\chi (\aleph_{\omega +1})=\aleph_{0}$, and carry a systematic study of the effect of square principles on the $C$-sequence spectrum.
In the last part of this talk, we shall unveil an unexpected connection between the two principles discussed in the previous parts, proving that, for infinite regular cardinals $\theta< \kappa ,\theta \in Cspec(\kappa )$ if there is a closed witness to $U_{(\kappa ,\kappa ,\theta ,\theta )}$.
This is joint work with Chris Lambie-Hanson.
The productivity of the $\kappa$-chain condition, where $\kappa$ is a regular, uncountable cardinal, has been the focus of a great deal of set-theoretic research. In the 1970’s, consistent examples of $kappa-cc$ posets whose squares are not $\kappa-cc$ were constructed by Laver, Galvin, Roitman and Fleissner. Later, ZFC examples were constructed by Todorcevic, Shelah, and others. The most difficult case, that in which $\kappa = \aleph{_2}$, ...

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

## Challenges in achieving scalable and robust linear solvers Grigori, Laura | CIRM H

Post-edited

Research talks

This talk focuses on challenges that we address when designing linear solvers that aim at achieving scalability on large scale computers, while also preserving numerical robustness. We will consider preconditioned Krylov subspace solvers. Getting scalability relies on reducing global synchronizations between processors, while also increasing the arithmetic intensity on one processor. Achieving robustness relies on ensuring that the condition number of the preconditioned matrix is bounded. We will discuss two different approaches for this. The first approach relies on enlarged Krylov subspace methods that aim at computing an enlarged subspace and obtain a faster convergence of the iterative method. The second approach relies on a multilevel Schwarz preconditioner, a multilevel extension of the GenEO preconditioner, that is basedon constructing robustly a hierarchy of coarse spaces. Numerical results on large scale computers, in particular for linear systems arising from solving linear elasticity problems, will discuss the efficiency of the proposed methods. This talk focuses on challenges that we address when designing linear solvers that aim at achieving scalability on large scale computers, while also preserving numerical robustness. We will consider preconditioned Krylov subspace solvers. Getting scalability relies on reducing global synchronizations between processors, while also increasing the arithmetic intensity on one processor. Achieving robustness relies on ensuring that the condition ...

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

## Twistor theory for LQG Eastwood, Michael | CIRM H

Post-edited

Research talks

Twistor Theory was proposed in the late 1960s by Roger Penrose as a potential geometric unification of general relativity and quantum mechanics. During the past 50 years, there have been many mathematical advances and achievements in twistor theory. In physics, however, there are aspirations yet to be realised. Twistor Theory and Loop Quantum Gravity (LQG) share a common background. Their aims are very much related. Is there more to it? This talk will sketch the geometry and symmetry behind twistor theory with the hope that links with LQG can be usefully strengthened. We believe there is something significant going on here: what could it be? Twistor Theory was proposed in the late 1960s by Roger Penrose as a potential geometric unification of general relativity and quantum mechanics. During the past 50 years, there have been many mathematical advances and achievements in twistor theory. In physics, however, there are aspirations yet to be realised. Twistor Theory and Loop Quantum Gravity (LQG) share a common background. Their aims are very much related. Is there more to it? This ...

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

## Descent in Bruhat-Tits theory Prasad, Gopal | CIRM H

Post-edited

Research schools

Bruhat-Tits theory applies to a semisimple group G, defined over an henselian discretly valued field K, such that G admits a Borel K-subgroup after an extension of K. The construction of the theory goes then by a deep Galois descent argument for the building and also for the parahoric group scheme. In the case of unramified extension, that descent has been achieved by Bruhat-Tits at the end of [BT2]. The tamely ramified case is due to G. Rousseau [R]. Recently, G. Prasad found a new way to investigate the descent part of the theory. This is available in the preprints [Pr1, Pr2] dealing respectively with the unramified case and the tamely ramified case. It is much shorter and the method is based more on fine geometry of the building (e.g. galleries) than algebraic groups techniques. Bruhat-Tits theory applies to a semisimple group G, defined over an henselian discretly valued field K, such that G admits a Borel K-subgroup after an extension of K. The construction of the theory goes then by a deep Galois descent argument for the building and also for the parahoric group scheme. In the case of unramified extension, that descent has been achieved by Bruhat-Tits at the end of [BT2]. The tamely ramified case is due to G. ...

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

## Branching random walks and Galton-Watson trees Gantert, Nina | CIRM H

Post-edited

Research schools

We give some results about tree-indexed random walks aka branching random walks. In particular, we investigate the growth of the maximum of such a walk.
Based on joint work with Piotr Dyszewski and Thomas Hofelsauer.

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

## Sampling algorithms and phase transitions Randall, Dana | CIRM H

Post-edited

Research talks

Markov chain Monte Carlo methods have become ubiquitous across science and engineering to model dynamics and explore large combinatorial sets. Over the last 20 years there have been tremendous advances in the design and analysis of efficient sampling algorithms for this purpose. One of the striking discoveries has been the realization that many natural Markov chains undergo phase transitions, whereby they abruptly change from being efficient to inefficient as some parameter of the system is modified. Generating functions can offer an alternative approach to sampling and they play a role in showing when certain Markov chains are efficient or not. We will explore the interplay between Markov chains, generating functions, and phase transitions for a variety of combinatorial problems, including graded posets, Boltzmann sampling, and 3-colorings on $Z^{2}$. Markov chain Monte Carlo methods have become ubiquitous across science and engineering to model dynamics and explore large combinatorial sets. Over the last 20 years there have been tremendous advances in the design and analysis of efficient sampling algorithms for this purpose. One of the striking discoveries has been the realization that many natural Markov chains undergo phase transitions, whereby they abruptly change from being efficient to ...

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

## The conjugacy problem for polynomially growing elements of $Out(F_{n})$ Feighn, Mark | CIRM H

Post-edited

Research talks

(joint work with Michael Handel) $Out(F_{n}) := Aut(F_{n})/Inn(F_{n})$ denotes the outer automorphism group of the rank n free group $F_{n}$. An element $f$ of $Out(F_{n})$ is polynomially growing if the word lengths of conjugacy classes in Fn grow at most polynomially under iteration by $f$. The existence in $Out(F_{n}), n > 2$, of elements with non-linear polynomial growth is a feature of $Out(F_{n})$ not shared by mapping class groups of surfaces.
To avoid some finite order behavior, we restrict attention to the subset $UPG(F_{n})$ of $Out(F_{n})$ consisting of polynomially growing elements whose action on $H_{1}(F_{n}, Z)$ is unipotent. In particular, if $f$ is polynomially growing and acts trivially on $H_{1}(F_{n}, Z_{3})$ then $f$ is in $UPG(F_{n})$ and further every polynomially growing element of $Out(F_{n})$ has a power that is in $UPG(F_{n})$. The goal of the talk is to describe an algorithm to decide given $f,g$ in $UPG(F_{n})$ whether or not there is h in $Out(F_{n})$ such that $hf h^{-1} = g$.
The conjugacy problem for linearly growing elements of $UPG(F_{n})$ was solved by Cohen-Lustig. Krstic-Lustig-Vogtmann solved the case of linearly growing elements of $Out(F_{n})$.
A key technique is our use of train track representatives for elements of $Out(F_{n})$, a method pioneered by Bestvina-Handel in the early 1990s that has since been ubiquitous in the study of $Out(F_{n})$.
(joint work with Michael Handel) $Out(F_{n}) := Aut(F_{n})/Inn(F_{n})$ denotes the outer automorphism group of the rank n free group $F_{n}$. An element $f$ of $Out(F_{n})$ is polynomially growing if the word lengths of conjugacy classes in Fn grow at most polynomially under iteration by $f$. The existence in $Out(F_{n}), n > 2$, of elements with non-linear polynomial growth is a feature of $Out(F_{n})$ not shared by mapping class groups of ...

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

## The symplectic type of congruences between elliptic curves Cremona, John | CIRM H

Post-edited

Research talks

In this talk I will describe a systematic investigation into congruences between the mod $p$ torsion modules of elliptic curves defined over $\mathbb{Q}$. For each such curve $E$ and prime $p$ the $p$-torsion $E[p]$ of $E$, is a 2-dimensional vector space over $\mathbb{F}_{p}$ which carries a Galois action of the absolute Galois group $G_{\mathbb{Q}}$. The structure of this $G_{\mathbb{Q}}$-module is very well understood, thanks to the work of J.-P. Serre and others. When we say the two curves $E$ and $E'$ are ”congruent” we mean that $E[p]$ and $E'[p]$ are isomorphic as $G_{\mathbb{Q}}$-modules. While such congruences are known to exist for all primes up to 17, the Frey-Mazur conjecture states that p is bounded: more precisely, that there exists $B$ > 0 such that if $p > B$ and $E[p]$ and $E'[p]$ are isomorphic then $E$ and $E'$ are isogenous. We report on work toward establishing such a bound for the elliptic curves in the LMFDB database. Secondly, we describe methods for determining whether or not a given isomorphism between $E[p]$ and $E'[p]$ is symplectic (preserves the Weil pairing) or antisymplectic, and report on the results of applying these methods to the curves in the database.
This is joint work with Nuno Freitas (Warwick).
In this talk I will describe a systematic investigation into congruences between the mod $p$ torsion modules of elliptic curves defined over $\mathbb{Q}$. For each such curve $E$ and prime $p$ the $p$-torsion $E[p]$ of $E$, is a 2-dimensional vector space over $\mathbb{F}_{p}$ which carries a Galois action of the absolute Galois group $G_{\mathbb{Q}}$. The structure of this $G_{\mathbb{Q}}$-module is very well understood, thanks to the work of ...

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

## Graphon mean field games and the GMFG equations Caines, Peter E. | CIRM H

Post-edited

Research talks

Very large networks linking dynamical agents are now ubiquitous and there is significant interest in their analysis, design and control. The emergence of the graphon theory of large networks and their infinite limits has recently enabled the formulation of a theory of the centralized control of dynamical systems distributed on asymptotically infinite networks [Gao and Caines, IEEE CDC 2017, 2018]. Furthermore, the study of the decentralized control of such systems has been initiated in [Caines and Huang, IEEE CDC 2018] where Graphon Mean Field Games (GMFG) and the GMFG equations are formulated for the analysis of non-cooperative dynamical games on unbounded networks. In this talk the GMFG framework will be first be presented followed by the basic existence and uniqueness results for the GMFG equations, together with an epsilon-Nash theorem relating the infinite population equilibria on infinite networks to that of finite population equilibria on finite networks. Very large networks linking dynamical agents are now ubiquitous and there is significant interest in their analysis, design and control. The emergence of the graphon theory of large networks and their infinite limits has recently enabled the formulation of a theory of the centralized control of dynamical systems distributed on asymptotically infinite networks [Gao and Caines, IEEE CDC 2017, 2018]. Furthermore, the study of the decentralized ...

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

## $L^2$ curvature for surfaces in Riemannian manifolds Kuwert, Ernst | CIRM H

Post-edited

Research talks

For surfaces immersed into a compact Riemannian manifold, we consider the curvature functional given by the $L^{2}$ integral of the second fundamental form. We discuss an area bound in terms of the energy, with application to the existence of minimizers. This is joint work with V. Bangert.

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

## Gradient discretisations : tools and applications Eymard, Robert | CIRM H

Post-edited

Research talks

Some convergence properties for the approximation of second order elliptic problems with a variety of boundary conditions (homogeneous Dirichlet, homogeneous or non-homogeneous Neumann or Fourier boundary conditions), using a given discretisation method, can be obtained when this method is plugged into the Gradient Discretisation Method (GDM) framework.
Instead of defining one GDM framework for each of these boundary conditions, we show that these properties can be stated using the same abstract tools for all the above boundary conditions. Then these tools enable the application of the GDM to a larger class of elliptic problems.
Some convergence properties for the approximation of second order elliptic problems with a variety of boundary conditions (homogeneous Dirichlet, homogeneous or non-homogeneous Neumann or Fourier boundary conditions), using a given discretisation method, can be obtained when this method is plugged into the Gradient Discretisation Method (GDM) framework.
Instead of defining one GDM framework for each of these boundary conditions, we show that ...

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

## Mathematical topics around fractional quantization - lecture 1 Rougerie, Nicolas | CIRM H

Post-edited

Research school

The 1983 discovery of the fractional quantum Hall effect marks a milestone in condensed matter physics: systems of “ordinary particles at ordinary energies” displayed highly exotic effects, most notably fractional quantum numbers. It was later recognized that this was due to emergent quasi-particles carrying a fraction of the charge of an electron. It was also conjectured that these quasi-particles had fractional statistics, i.e. a behavior interpolating between that of bosons and fermions, the only two types of fundamental particles.
These lectures will be an introduction to the basic physics of the fractional quantum Hall effect, with an emphasis on the challenges to rigorous many-body quantum mechanics emerging thereof. Some progress has been made on some of these, but lots remains to be done, and open problems will be mentioned.

After the lectures a few references regarding the spectrum of the magnetic Schrödinger operator were suggested to me.
See the bibiography below.

Thanks to Alix Deleporte, Frédéric Faure, Stéphane Nonnenmacher and others for discussions relative to the magnetic Weyl law.
The 1983 discovery of the fractional quantum Hall effect marks a milestone in condensed matter physics: systems of “ordinary particles at ordinary energies” displayed highly exotic effects, most notably fractional quantum numbers. It was later recognized that this was due to emergent quasi-particles carrying a fraction of the charge of an electron. It was also conjectured that these quasi-particles had fractional statistics, i.e. a behavior ...

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

## Understanding the growth of Laplace eigenfunctions (part 1 of 2) Canzani, Yaiza | CIRM H

Post-edited

Research talks

In this talk we will discuss a new geodesic beam approach to understanding eigenfunction concentration. We characterize the features that cause an eigenfunction to saturate the standard supremum bounds in terms of the distribution of $L^{2}$ mass along geodesic tubes emanating from a point. We also show that the phenomena behind extreme supremum norm growth is identical to that underlying extreme growth of eigenfunctions when averaged along submanifolds. Using the description of concentration, we obtain quantitative improvements on the known bounds in a wide variety of settings. In this talk we will discuss a new geodesic beam approach to understanding eigenfunction concentration. We characterize the features that cause an eigenfunction to saturate the standard supremum bounds in terms of the distribution of $L^{2}$ mass along geodesic tubes emanating from a point. We also show that the phenomena behind extreme supremum norm growth is identical to that underlying extreme growth of eigenfunctions when averaged along ...

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

## Interactions of analytic number theory and geometry - lecture 1 Schindler, Damaris | CIRM H

Post-edited

Research schools

A general introduction to the state of the art in counting of rational and integral points on varieties, using various analytic methods with the Brauer-Manin obstruction.

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

## Graph data management - part 1 Martens, Wim | CIRM H

Post-edited

Ecoles de recherche

After giving a motivation of graph databases and an overview of the main data models, we will dive into foundational aspects of graph database query languages, with a strong focus on regular path queries (RPQs) and conjunctive regular path queries (CRPQs). We will consider the different semantics that graph database systems use for such queries (every path, simple path, trail), and we will look into the computational complexities of query evaluation and query containment.
After having gone through these foundations, we plan to do some excursions into connections between tree-structured and graph-structured data, adding data value comparisons, and aspects of real-life queries.
After giving a motivation of graph databases and an overview of the main data models, we will dive into foundational aspects of graph database query languages, with a strong focus on regular path queries (RPQs) and conjunctive regular path queries (CRPQs). We will consider the different semantics that graph database systems use for such queries (every path, simple path, trail), and we will look into the computational complexities of query ...

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

## On the general linear group over arithmetic orders and corresponding cohomology groups Schwermer, Joachim | CIRM H

Post-edited

Research talks

Orders in finite-dimensional algebras over number fi give rise to interesting locally symmetric spaces and algebraic varieties. Hilbert modular varieties or arithmetically defined hyperbolic 3-manifolds, compact ones as well as noncompact ones, are familiar examples. In this talk we discuss various cases related to the general linear group $GL(2)$ over orders in division algebras defined over some number field. Geometry, arithmetic, and the theory of automorphic forms are interwoven in a most fruitful way in this work. Finally we indicate a construction of non-vanishing square-integrable cohomology classes for such arithmetically defined groups. Orders in finite-dimensional algebras over number fi give rise to interesting locally symmetric spaces and algebraic varieties. Hilbert modular varieties or arithmetically defined hyperbolic 3-manifolds, compact ones as well as noncompact ones, are familiar examples. In this talk we discuss various cases related to the general linear group $GL(2)$ over orders in division algebras defined over some number field. Geometry, arithmetic, and the ...

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

## Autour de la mesure de Plancherel sur les partitions d'entiers (une introduction aux processus de Schur) - Partie 1 Bouttier, Jérémie | CIRM H

Post-edited

Research schools

Le but de ce cours sera de présenter quelques techniques liées aux processus de Schur, dans le cadre le plus simple de la mesure de Plancherel sur les partitions d'entiers.
La mesure de Plancherel est une mesure sur l'ensemble des partitions d'un entier n, où une partition donnée apparaît avec une probabilité proportionnelle au carré de son nombre de tableaux de Young standard. Cette mesure apparaît très naturellement en lien avec le fameux problème de Ulam-Hammersley, qui consiste à étudier la longueur d'une plus longue sous-suite croissante d'une permutation uniforme de {1,...,n}. Il est en fait fructueux de travailler avec une version "poissonisée" du problème, où la taille n est tirée selon une loi de Poisson, dont on fera tendre le paramètre vers l'infini afin d'étudier les asymptotiques.
Dans la première séance, nous verrons que la mesure de Plancherel poissonisée est en fait un processus déterminantal, dont le noyau de corrélation fait intervenir les fonctions de Bessel. Nous utiliserons pour cela le formalisme de l'espace de Fock fermionique. (Toutes les notions nécessaires seront introduites au fur et à mesure, de la manière la plus élémentaire possible.)
Dans la seconde séance, nous étudierons les différentes asymptotiques du noyau de corrélation, par une application élégante de la méthode du col due à Okounkov et Reshetikhin. Nous verrons en particulier apparaître un phénomène de forme-limite, le noyau sinus discret dans le cas des limites "bulk" et le noyau d'Airy dans la limite "edge". In fine, nous aboutirons à une preuve du théorème de Baik-Deift-Johansson (1998) énonçant que les fluctuations de la longueur d'une plus longue sous-suite croissante d'une permutation uniforme ont asymptotiquement la même distribution que la plus grande valeur propre d'une matrice hermitienne aléatoire.
Le but de ce cours sera de présenter quelques techniques liées aux processus de Schur, dans le cadre le plus simple de la mesure de Plancherel sur les partitions d'entiers.
La mesure de Plancherel est une mesure sur l'ensemble des partitions d'un entier n, où une partition donnée apparaît avec une probabilité proportionnelle au carré de son nombre de tableaux de Young standard. Cette mesure apparaît très naturellement en lien avec le fameux ...

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

## ​Construction of lattices defining fake projective planes - Lecture 2 Cartwright, Donald I. | CIRM H

Post-edited

Research talks

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

## ​Construction of lattices defining fake projective planes - Lecture 1 Cartwright, Donald I. | CIRM H

Post-edited

Research talks

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

## Improved bounds for jet differential operators and the Kobayashi conjecture Demailly, Jean-Pierre | CIRM H

Post-edited

Research talks

We will discuss several new ideas that can show the existence of jet differential operators on arbitrary projective varieties, and also on general hypersurfaces of $\mathbb{P}^n$ of sufficiently high degree. These results can be applied to improve degree bounds in several hyperbolicity problems and especially in the proof of the Kobayashi conjecture.

#### Filtrer

##### Codes MSC

Ressources Electroniques (Depuis le CIRM)

Books & Print journals

Recherche avancée

0
Z