m

F Nous contacter


0

Documents  | enregistrements trouvés : 200

O

-A +A

P Q

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

​I will discuss recent developments concerning the non-uniqueness of distributional solutions to the Navier-Stokes equation.

35Q30 ; 76D05 ; 35Q35

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

The Lüroth problem asks whether every unirational variety is rational. Over the complex numbers, it has a positive answer for curves and surfaces, but fails in higher dimensions. In this talk, I will consider the Lüroth problem for real algebraic varieties that are geometrically rational, and explain a counterexample not accounted for by the topology of the real locus or by unramified cohomology. This is joint work with Olivier Wittenberg.

14M20 ; 14E08

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

In this talk we will present a Verlinde formula for the quantization of the Higgs bundle moduli spaces and stacks for any simple and simply-connected group. We further present a Verlinde formula for the quantization of parabolic Higgs bundle moduli spaces and stacks. We will explain how all these dimensions fit into a one parameter family of 2D TQFT’s, encoded in a one parameter family of Frobenius algebras, which we will construct.

14D20 ; 14H60 ; 57R56 ; 81T40 ; 14F05 ; 14H10 ; 22E46 ; 81T45

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

Let $X$ be a compact Kähler manifold. The so-called Kodaira problem asks whether $X$ has arbitrarily small deformations to some projective varieties. While Kodaira proved that such deformations always exist for surfaces. Starting from dimension 4, there are examples constructed by Voisin which answer the Kodaira problem in the negative. In this talk, we will focus on threefolds, as well as compact Kähler manifolds of algebraic dimension $a(X) = dim(X) -1$. We will explain our positive solution to the Kodaira problem for these manifolds.
Let $X$ be a compact Kähler manifold. The so-called Kodaira problem asks whether $X$ has arbitrarily small deformations to some projective varieties. While Kodaira proved that such deformations always exist for surfaces. Starting from dimension 4, there are examples constructed by Voisin which answer the Kodaira problem in the negative. In this talk, we will focus on threefolds, as well as compact Kähler manifolds of algebraic dimension $a(X) = ...

32J17 ; 32J27 ; 32J25 ; 32G05 ; 14D06 ; 14E30

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

A new type of a simple iterated game with natural biological motivation is introduced. Two individuals are chosen at random from a population. They must survive a certain number of steps. They start together, but if one of them dies the other one tries to survive on its own. The only payoff is to survive the game. We only allow two strategies: cooperators help the other individual, while defectors do not. There is no strategic complexity. There are no conditional strategies. Depending on the number of steps we recover various forms of stringent and relaxed cooperative dilemmas. We derive conditions for the evolution of cooperation.
Specifically, we describe an iterated game between two players, in which the payoff is to survive a number of steps. Expected payoffs are probabilities of survival. A key feature of the game is that individuals have to survive on their own if their partner dies. We consider individuals with simple, unconditional strategies. When both players are present, each step is a symmetric two-player game. As the number of iterations tends to infinity, all probabilities of survival decrease to zero. We obtain general, analytical results for n-step payoffs and use these to describe how the game changes as n increases. In order to predict changes in the frequency of a cooperative strategy over time, we embed the survival game in three different models of a large, well-mixed population. Two of these models are deterministic and one is stochastic. Offspring receive their parent’s type without modification and fitnesses are determined by the game. Increasing the number of iterations changes the prospects for cooperation. All models become neutral in the limit $(n \rightarrow \infty)$. Further, if pairs of cooperative individuals survive together with high probability, specifically higher than for any other pair and for either type when it is alone, then cooperation becomes favored if the number of iterations is large enough. This holds regardless of the structure of pairwise interactions in a single step. Even if the single-step interaction is a Prisoner’s Dilemma, the cooperative type becomes favored. Enhanced survival is crucial in these iterated evolutionary games: if players in pairs start the game with a fitness deficit relative to lone individuals, the prospects for cooperation can become even worse than in the case of a single-step game.
A new type of a simple iterated game with natural biological motivation is introduced. Two individuals are chosen at random from a population. They must survive a certain number of steps. They start together, but if one of them dies the other one tries to survive on its own. The only payoff is to survive the game. We only allow two strategies: cooperators help the other individual, while defectors do not. There is no strategic complexity. There ...

91A80 ; 91A40 ; 91A22 ; 91A12 ; 91A20 ; 92D15

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

Aim of the lecture is to give an introduction to $K3$ surfaces, that are special algebraic surfaces with an extremely rich geometry. The most easy example of such a surface is the Fermat quartic in complex three-dimensional space.
The name $K3$ was given by André Weil in 1958 in honour of the three remarkable mathematicians: Kummer, Kähler and Kodaira and of the beautiful K2 mountain at Cachemire.
The topics of the lecture are the following:

* $K3$ surfaces in the Enriques-Kodaira classification.
* Examples; Kummer surfaces.
* Basic properties of $K3$ surfaces; Torelli theorem and surjectivity of the period map.
* The study of automorphisms on $K3$ surfaces: basic facts, examples.
* Symplectic automorphisms of $K3$ surfaces, classification, moduli spaces.
Aim of the lecture is to give an introduction to $K3$ surfaces, that are special algebraic surfaces with an extremely rich geometry. The most easy example of such a surface is the Fermat quartic in complex three-dimensional space.
The name $K3$ was given by André Weil in 1958 in honour of the three remarkable mathematicians: Kummer, Kähler and Kodaira and of the beautiful K2 mountain at Cachemire.
The topics of the lecture are the following:

* ...

14J10 ; 14J28 ; 14J50 ; 14C20 ; 14C22 ; 14J27 ; 14L30

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

Post-edited  Interview at CIRM: Edward Frenkel
Frenkel, Edward (Personne interviewée) | CIRM (Editeur )

Edward Frenkel is a professor of mathematics at the University of California, Berkeley, which he joined in 1997 after being on the faculty at Harvard University. He is a member of the American Academy of Arts and Sciences, a Fellow of the American Mathematical Society, and the winner of the Hermann Weyl Prize in mathematical physics. Frenkel’s research is on the interface of mathematics and quantum physics, with an emphasis on the Langlands Program, which he describes as a Grand Unified Theory of mathematics. He has authored three books and over eighty scholarly articles in academic journals, and he has lectured on his work around the world. His YouTube videos have garnered millions of views.
Frenkel’s latest book Love and Math was a New York Times bestseller, has been named one of the Best Books of the year by both Amazon and iBooks, and won the Euler Book Prize from the Mathematical Association of America. It has been published in 18 languages. Frenkel has also co-produced, co-directed and played the lead in the film Rites of Love and Math.
Edward Frenkel is a professor of mathematics at the University of California, Berkeley, which he joined in 1997 after being on the faculty at Harvard University. He is a member of the American Academy of Arts and Sciences, a Fellow of the American Mathematical Society, and the winner of the Hermann Weyl Prize in mathematical physics. Frenkel’s research is on the interface of mathematics and quantum physics, with an emphasis on the Langlands ...

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

In the recent years, the nature of the generating series of walks in the quarter plane has attracted the attention of many authors in combinatorics and probability. The main questions are: are they algebraic, holonomic (solutions of linear differential equations) or at least hyperalgebraic (solutions of algebraic differential equations)? In this talk, we will show how the nature of the generating function can be approached via the study of a discrete functional equation over a curve E, of genus zero or one. In the first case, the functional equation corresponds to a so called q-difference equation and all the related generating series are differentially transcendental. For the genus one case, the dynamic of the functional equation corresponds to the addition by a given point P of the elliptic curve E. In that situation, one can relate the nature of the generating series to the fact that the point P is of torsion or not.
In the recent years, the nature of the generating series of walks in the quarter plane has attracted the attention of many authors in combinatorics and probability. The main questions are: are they algebraic, holonomic (solutions of linear differential equations) or at least hyperalgebraic (solutions of algebraic differential equations)? In this talk, we will show how the nature of the generating function can be approached via the study of a ...

05A15 ; 30D05 ; 39A13 ; 12F10 ; 12H10 ; 12H05

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

Post-edited  Interview au CIRM : Claire Voisin
Voisin, Claire (Personne interviewée) | CIRM (Editeur )

Claire Voisin, mathématicienne française, est Directrice de recherche au Centre national de la recherche scientifique (CNRS) à l'Institut de mathématiques de Jussieu, elle est membre de l'Académie des sciences et titulaire de la nouvelle chaire de mathématiques " géométrie algébrique " au Collège de France. Elle a reçu de nombreux prix nationaux et internationaux pour ses travaux en géométrie algébrique, et en particulier pour la résolution de la conjecture de Koidara sur les variétés de Kälher compactes et celle de la conjecture de Green sur les syzygies. Elle est depuis 2010 membre de l'Académie des sciences. Depuis le 2 juin 2016, elle est titulaire de la nouvelle chaire de mathématique " géométrie algébrique " devenant ainsi la première femme mathématicienne à entrer au Collège de France. Ses recherches portent sur la géométrie algébrique, notamment sur la conjecture de Hodge4, dans la lignée d'Alexandre Grothendieck ; la symétrie miroir et la géométrie complexe kählérienne.

Distinctions :

Médaille de bronze du CNRS (1988) puis médaille d'argent (2006)et médaille d'or (2016)
Prix IBM jeune chercheur (1989)
Prix EMS de la Société mathématique européenne (1992)
Prix Servant décerné par l'Académie des sciences (1996)
Prix Sophie-Germain décerné par l'Académie des sciences (2003)
Prix Ruth Lyttle Satter décerné par l'AMS (2007)
Clay Research Award en 2008
Prix Heinz Hopf (2015)
Officier de l'ordre national de la Légion d'honneur (2016)
Prix Shaw (2017)
Claire Voisin, mathématicienne française, est Directrice de recherche au Centre national de la recherche scientifique (CNRS) à l'Institut de mathématiques de Jussieu, elle est membre de l'Académie des sciences et titulaire de la nouvelle chaire de mathématiques " géométrie algébrique " au Collège de France. Elle a reçu de nombreux prix nationaux et internationaux pour ses travaux en géométrie algébrique, et en particulier pour la résolution de ...

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

​Assume that a renormalized Birkhoff sum $S_n f/B_n$ converges in distribution to a nontrivial limit. What can one say about the sequence $B_n$? Most natural statements in the literature involve sequences $B_n$ of the form $B_n = n^\alpha L(n)$, where $L$ is slowly varying. We will discuss the possible growth rate of $B_n$ both in the probability preserving case and the conservative case. In particular, we will describe examples where $B_n$ grows superpolynomially, or where $B_{n+1}/B_n$ does not tend to $1$.
​Assume that a renormalized Birkhoff sum $S_n f/B_n$ converges in distribution to a nontrivial limit. What can one say about the sequence $B_n$? Most natural statements in the literature involve sequences $B_n$ of the form $B_n = n^\alpha L(n)$, where $L$ is slowly varying. We will discuss the possible growth rate of $B_n$ both in the probability preserving case and the conservative case. In particular, we will describe examples where $B_n$ ...

37A40 ; 60F05

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

Post-edited  Local acyclicity in $p$-adic geometry
Scholze, Peter (Auteur de la Conférence) | CIRM (Editeur )

Motivated by applications to the geometric Satake equivalence and in particular the construction of the fusion product, we define a notion of universally locally acyclic for rigid spaces and diamonds, and prove that it has the expected properties.

14G22 ; 11S37 ; 11F80 ; 14F30

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

Depuis les années 2000, l'informatique a vu émerger de nouvelles technologies, cloud et big data, qui bouleversent l'industrie avec l'arrivée d'outils de traitement à grande échelle.
De nouveaux besoins sont apparus comme la possibilité d'extraire de la valeur des données en s'appuyant sur des outils qui répondent aux nouvelles exigences technologiques.
Les architectures distribuées comme Hadoop, les bases de données non-relationnelles, les traitements parallélisés avec MapReduce constituent des outils qui répondent aux accroissements massifs des données, que ce soit en volumétrie, en nombre ou en type. Cette explosion de données a conduit à la terminologie Big Data.
Nous découvrirons les différents concepts des systèmes Big Data, ce que signifient les termes comme base NoSQL, MapReduce, lac de données, ETL ou ELT, etc.
Nous nous attarderons sur deux grands outils du BigData : Hadoop et MongoDB.
Depuis les années 2000, l'informatique a vu émerger de nouvelles technologies, cloud et big data, qui bouleversent l'industrie avec l'arrivée d'outils de traitement à grande échelle.
De nouveaux besoins sont apparus comme la possibilité d'extraire de la valeur des données en s'appuyant sur des outils qui répondent aux nouvelles exigences technologiques.
Les architectures distribuées comme Hadoop, les bases de données non-relationnelles, les ...

68P15 ; 68P05 ; 68P20

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

Post-edited  Algebraicity of the metric tangent cones
Wang, Xiaowei (Auteur de la Conférence) | CIRM (Editeur )

We proved that any K-semistable log Fano cone admits a special degeneration to a uniquely determined K-polystable log Fano cone. This confirms a conjecture of Donaldson-Sun stating that the metric tangent cone of any close point appearing on a Gromov-Hausdorff limit of Kähler-Einstein Fano manifolds depends only on the algebraic structure of the singularity. This is a joint work with Chi Li and Chenyang Xu.

14J45 ; 32Q15 ; 32Q20 ; 53C55

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

Post-edited  Mathematical modelling of angiogenesis
Maini, Philip (Auteur de la Conférence) | CIRM (Editeur )

Tumour vascular is highly disordered and has been the subject of intense interest both clinically (anti-angiogenesis therapies) and theoretically (many models have been proposed). In this talk, I will review aspects of modelling tumour angiogenesis and how different modelling assumptions impact conclusions on oxygen delivery and, therefore, predictions on the possible effects of radiation treatments.

93A30 ; 92C50 ; 92C37 ; 92C17 ; 65C20 ; 35Q92

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

In these lectures, we will review what it means for a 3-manifold to have a hyperbolic structure, and give tools to show that a manifold is hyperbolic. We will also discuss how to decompose examples of 3-manifolds, such as knot complements, into simpler pieces. We give conditions that allow us to use these simpler pieces to determine information about the hyperbolic geometry of the original manifold. Most of the tools we present were developed in the 1970s, 80s, and 90s, but continue to have modern applications.
In these lectures, we will review what it means for a 3-manifold to have a hyperbolic structure, and give tools to show that a manifold is hyperbolic. We will also discuss how to decompose examples of 3-manifolds, such as knot complements, into simpler pieces. We give conditions that allow us to use these simpler pieces to determine information about the hyperbolic geometry of the original manifold. Most of the tools we present were developed in ...

57M27 ; 57M50 ; 57M25

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

This course presents an overview of modern Bayesian strategies for solving imaging inverse problems. We will start by introducing the Bayesian statistical decision theory framework underpinning Bayesian analysis, and then explore efficient numerical methods for performing Bayesian computation in large-scale settings. We will pay special attention to high-dimensional imaging models that are log-concave w.r.t. the unknown image, related to so-called “convex imaging problems”. This will provide an opportunity to establish connections with the convex optimisation and machine learning approaches to imaging, and to discuss some of their relative strengths and drawbacks. Examples of topics covered in the course include: efficient stochastic simulation and optimisation numerical methods that tightly combine proximal convex optimisation with Markov chain Monte Carlo techniques; strategies for estimating unknown model parameters and performing model selection, methods for calculating Bayesian confidence intervals for images and performing uncertainty quantification analyses; and new theory regarding the role of convexity in maximum-a-posteriori and minimum-mean-square-error estimation. The theory, methods, and algorithms are illustrated with a range of mathematical imaging experiments.
This course presents an overview of modern Bayesian strategies for solving imaging inverse problems. We will start by introducing the Bayesian statistical decision theory framework underpinning Bayesian analysis, and then explore efficient numerical methods for performing Bayesian computation in large-scale settings. We will pay special attention to high-dimensional imaging models that are log-concave w.r.t. the unknown image, related to ...

49N45 ; 65C40 ; 65C60 ; 65J22 ; 68U10 ; 62C10 ; 62F15 ; 94A08

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

Graphons and graphexes are limits of graphs which allow us to model and estimate properties of large-scale networks. In this pair of talks, we review the theory of dense graph limits, and give two alterative theories for limits of sparse graphs - one leading to unbounded graphons over probability spaces, and the other leading to bounded graphons (and graphexes) over sigma-finite measure spaces. Talk I, given by Jennifer, will review the general theory, highlight the unbounded graphons, and show how they can be used to consistently estimate properties of large sparse networks. This talk will also give an application of these sparse graphons to collaborative filtering on sparse bipartite networks. Talk II, given by Christian, will recast limits of dense graphs in terms of exchangeability and the Aldous Hoover Theorem, and generalize this to obtain sparse graphons and graphexes as limits of subgraph samples from sparse graph sequences. This will provide a dual view of sparse graph limits as processes and random measures, an approach which allows a generalization of many of the well-known results and techniques for dense graph sequences.
Graphons and graphexes are limits of graphs which allow us to model and estimate properties of large-scale networks. In this pair of talks, we review the theory of dense graph limits, and give two alterative theories for limits of sparse graphs - one leading to unbounded graphons over probability spaces, and the other leading to bounded graphons (and graphexes) over sigma-finite measure spaces. Talk I, given by Jennifer, will review the general ...

05C80 ; 05C60 ; 60F10 ; 82B20

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

Graphons and graphexes are limits of graphs which allow us to model and estimate properties of large-scale networks. In this pair of talks, we review the theory of dense graph limits, and give two alterative theories for limits of sparse graphs - one leading to unbounded graphons over probability spaces, and the other leading to bounded graphons (and graphexes) over sigma-finite measure spaces. Talk I, given by Jennifer, will review the general theory, highlight the unbounded graphons, and show how they can be used to consistently estimate properties of large sparse networks. This talk will also give an application of these sparse graphons to collaborative filtering on sparse bipartite networks. Talk II, given by Christian, will recast limits of dense graphs in terms of exchangeability and the Aldous Hoover Theorem, and generalize this to obtain sparse graphons and graphexes as limits of subgraph samples from sparse graph sequences. This will provide a dual view of sparse graph limits as processes and random measures, an approach which allows a generalization of many of the well-known results and techniques for dense graph sequences.
Graphons and graphexes are limits of graphs which allow us to model and estimate properties of large-scale networks. In this pair of talks, we review the theory of dense graph limits, and give two alterative theories for limits of sparse graphs - one leading to unbounded graphons over probability spaces, and the other leading to bounded graphons (and graphexes) over sigma-finite measure spaces. Talk I, given by Jennifer, will review the general ...

05C80 ; 05C60 ; 60F10 ; 82B20

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

In many situations where stochastic modeling is used, one desires to choose the coefficients of a stochastic differential equation which represents the reality as simply as possible. For example one desires to approximate a diffusion model
with high complexity coefficients by a model within a class of simple diffusion models. To achieve this goal, we introduce a new Wasserstein type distance on the set of laws of solutions to d-dimensional stochastic differential equations.
This new distance $\widetilde{W}^{2}$ is defined similarly to the classical Wasserstein distance $\widetilde{W}^{2}$ but the set of couplings is restricted to the set of laws of solutions of 2$d$-dimensional stochastic differential equations. We prove that this new distance $\widetilde{W}^{2}$ metrizes the weak topology. Furthermore this distance $\widetilde{W}^{2}$ is characterized in terms of a stochastic control problem. In the case d = 1 we can construct an explicit solution. The multi-dimensional case, is more tricky and classical results do not apply to solve the HJB equation because of the degeneracy of the differential operator. Nevertheless, we prove that this HJB equation admits a regular solution.
In many situations where stochastic modeling is used, one desires to choose the coefficients of a stochastic differential equation which represents the reality as simply as possible. For example one desires to approximate a diffusion model
with high complexity coefficients by a model within a class of simple diffusion models. To achieve this goal, we introduce a new Wasserstein type distance on the set of laws of solutions to d-dimensional ...

91B70 ; 60H30 ; 60H15 ; 60J60 ; 93E20

Z