Jérémie Bouttier
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jérémie Bouttier has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Emmanuel Guitter
Université Paris-Saclay, Gif-sur-Yvette, France
18 shared publications - Gaëtan Borot
Section de Mathématiques Université de Genève 2-4 rue du Lièvre Case Postale 64 1211 Genève 4 Suisse
4 shared publications P Di Francesco
Service de Physique Theorique|CEA / DSM
3 shared publications- Emmanuel Guitter
Service de Physique Théorique CEA/DSM SPhT
2 shared publications - M. Jeng
Physics Department Syracuse University Syracuse 13244-1130 NY USA
2 shared publications - Mark J. Bowick
Department of Physics Syracuse University 13244 Syracuse NY USA
2 shared publications
Latest Publications
- Open Access
- 24 April 2017
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 369 (8) , 5921-5959
From Aztec diamonds to pyramids: Steep tilings
We introduce a family of domino tilings that includes tilings of the Aztec diamond and pyramid partitions as special cases. These tilings live in a strip of Z 2 \mathbb {Z}^2 of the form 1 ≤ x − y ≤ 2 ℓ 1\leq x-y\leq 2\ell for some integer ℓ ≥ 1 \ell \geq 1 , and are parametrized by a binary word w ∈ { + , − } 2 ℓ w\in \{+,-\}^{2\ell } that encodes some periodicity conditions at infinity. Aztec diamond and pyramid partitions correspond respectively to w = ( + − ) ℓ w=(+-)^\ell and to the limit case w = + ∞ − ∞ w=+^\infty -^\infty . For each word w w and for different types of boundary conditions, we obtain a nice product formula for the generating function of the associated tilings with respect to the number of flips, that admits a natural multivariate generalization. The main tools are a bijective correspondence with sequences of interlaced partitions and the vertex operator formalism (which we slightly extend in order to handle Littlewood-type identities). In probabilistic terms our tilings map to Schur processes of different types (standard, Pfaffian and periodic). We also introduce a more general model that interpolates between domino tilings and plane partitions.
- 24 April 2017
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 369 (8) , 5921-5959
Open AccessFrom Aztec diamonds to pyramids: Steep tilings
We introduce a family of domino tilings that includes tilings of the Aztec diamond and pyramid partitions as special cases. These tilings live in a strip of Z 2 \mathbb {Z}^2 of the form 1 ≤ x − y ≤ 2 ℓ 1\leq x-y\leq 2\ell for some integer ℓ ≥ 1 \ell \geq 1 , and are parametrized by a binary word w ∈ { + , − } 2 ℓ w\in \{+,-\}^{2\ell } that encodes some periodicity conditions at infinity. Aztec diamond and pyramid partitions correspond respectively to w = ( + − ) ℓ w=(+-)^\ell and to the limit case w = + ∞ − ∞ w=+^\infty -^\infty . For each word w w and for different types of boundary conditions, we obtain a nice product formula for the generating function of the associated tilings with respect to the number of flips, that admits a natural multivariate generalization. The main tools are a bijective correspondence with sequences of interlaced partitions and the vertex operator formalism (which we slightly extend in order to handle Littlewood-type identities). In probabilistic terms our tilings map to Schur processes of different types (standard, Pfaffian and periodic). We also introduce a more general model that interpolates between domino tilings and plane partitions.
- Open Access
Multivariate Juggling Probabilities
We consider refined versions of Markov chains related to juggling introduced by Warrington. We further generalize the construction to juggling with arbitrary heights as well as infinitely many balls, which are expressed more succinctly in terms of Markov chains on integer partitions. In all cases, we give explicit product formulas for the stationary probabilities. The normalization factor in one case can be explicitly written as a homogeneous symmetric polynomial. We also refine and generalize enriched Markov chains on set partitions. Lastly, we prove that in one case, the stationary distribution is attained in bounded time.
Open AccessMultivariate Juggling Probabilities
We consider refined versions of Markov chains related to juggling introduced by Warrington. We further generalize the construction to juggling with arbitrary heights as well as infinitely many balls, which are expressed more succinctly in terms of Markov chains on integer partitions. In all cases, we give explicit product formulas for the stationary probabilities. The normalization factor in one case can be explicitly written as a homogeneous symmetric polynomial. We also refine and generalize enriched Markov chains on set partitions. Lastly, we prove that in one case, the stationary distribution is attained in bounded time.
- 9 July 2014
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 23 (6) , 914-972
On Irreducible Maps and Slices
We consider the problem of enumeratingd-irreducible maps,i.e., planar maps all of whose cycles have length at leastd, and such that any cycle of lengthdis the boundary of a face of degreed. We develop two approaches in parallel: the natural approach via substitution, where these maps are obtained from general maps by a replacement of alld-cycles by elementary faces, and a bijective approach via slice decomposition, which consists in cutting the maps along shortest paths. Both lead to explicit expressions for the generating functions ofd-irreducible maps with controlled face degrees, summarized in some elegant ‘pointing formula’. We provide an equivalent description ofd-irreducible slices in terms of so-calledd-oriented trees. We finally show that irreducible maps give rise to a hierarchy of discrete integrable equations which include equations encountered previously in the context of naturally embedded trees.
- 9 July 2014
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 23 (6) , 914-972
On Irreducible Maps and Slices
We consider the problem of enumeratingd-irreducible maps,i.e., planar maps all of whose cycles have length at leastd, and such that any cycle of lengthdis the boundary of a face of degreed. We develop two approaches in parallel: the natural approach via substitution, where these maps are obtained from general maps by a replacement of alld-cycles by elementary faces, and a bijective approach via slice decomposition, which consists in cutting the maps along shortest paths. Both lead to explicit expressions for the generating functions ofd-irreducible maps with controlled face degrees, summarized in some elegant ‘pointing formula’. We provide an equivalent description ofd-irreducible slices in terms of so-calledd-oriented trees. We finally show that irreducible maps give rise to a hierarchy of discrete integrable equations which include equations encountered previously in the context of naturally embedded trees.
- Open Access
On the two-point function of general planar maps and hypermaps
We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have faces of arbitrarily large degree, which requires new bijections to be tackled. We obtain exact expressions for the following cases: general and bipartite maps counted by their number of edges, 3-hypermaps and 3-constellations counted by their number of dark faces, and finally general and bipartite maps counted by both their number of edges and their number of faces.
Open AccessOn the two-point function of general planar maps and hypermaps
We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have faces of arbitrarily large degree, which requires new bijections to be tackled. We obtain exact expressions for the following cases: general and bipartite maps counted by their number of edges, 3-hypermaps and 3-constellations counted by their number of dark faces, and finally general and bipartite maps counted by both their number of edges and their number of faces.
- Open Access
On irreducible maps and slices
We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the natural approach via substitution where these maps are obtained from general maps by a replacement of all d-cycles by elementary faces, and a bijective approach via slice decomposition which consists in cutting the maps along shortest paths. Both lead to explicit expressions for the generating functions of d-irreducible maps with controlled face degrees, summarized in some elegant "pointing formula". We provide an equivalent description of d-irreducible slices in terms of so-called d-oriented trees. We finally show that irreducible maps give rise to a hierarchy of discrete integrable equations which include equations encountered previously in the context of naturally embedded trees.
Open AccessOn irreducible maps and slices
We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the natural approach via substitution where these maps are obtained from general maps by a replacement of all d-cycles by elementary faces, and a bijective approach via slice decomposition which consists in cutting the maps along shortest paths. Both lead to explicit expressions for the generating functions of d-irreducible maps with controlled face degrees, summarized in some elegant "pointing formula". We provide an equivalent description of d-irreducible slices in terms of so-called d-oriented trees. We finally show that irreducible maps give rise to a hierarchy of discrete integrable equations which include equations encountered previously in the context of naturally embedded trees.
- Open Access
A note on irreducible maps with several boundaries
We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary (non necessarily irreducible) bipartite planar maps, which we recover by taking d=0. As an application, we obtain an expression for the number of d-irreducible bipartite planar maps with a prescribed number of faces of each allowed degree. Very explicit expressions are given in the case of maps without multiple edges (d=2), 4-irreducible maps and maps of girth at least 6 (d=4). Our derivation is based on a tree interpretation of the various encountered generating functions.
Open AccessA note on irreducible maps with several boundaries
We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary (non necessarily irreducible) bipartite planar maps, which we recover by taking d=0. As an application, we obtain an expression for the number of d-irreducible bipartite planar maps with a prescribed number of faces of each allowed degree. Very explicit expressions are given in the case of maps without multiple edges (d=2), 4-irreducible maps and maps of girth at least 6 (d=4). Our derivation is based on a tree interpretation of the various encountered generating functions.
- 27 November 2012
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 45 (49)
Loop models on random maps via nested loops: the case of domain symmetry breaking and application to the Potts model
- 27 November 2012
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 45 (49)
Loop models on random maps via nested loops: the case of domain symmetry breaking and application to the Potts model
- Open Access
Loop models on random maps via nested loops: case of domain symmetry breaking and application to the Potts model
We use the nested loop approach to investigate loop models on random planar maps where the domains delimited by the loops are given two alternating colors, which can be assigned different local weights, hence allowing for an explicit Z_2 domain symmetry breaking. Each loop receives a non local weight n, as well as a local bending energy which controls loop turns. By a standard cluster construction that we review, the Q = n^2 Potts model on general random maps is mapped to a particular instance of this problem with domain-non-symmetric weights. We derive in full generality a set of coupled functional relations for a pair of generating series which encode the enumeration of loop configurations on maps with a boundary of a given color, and solve it by extending well-known complex analytic techniques. In the case where loops are fully-packed, we analyze in details the phase diagram of the model and derive exact equations for the position of its non-generic critical points. In particular, we underline that the critical Potts model on general random maps is not self-dual whenever Q \neq 1. In a model with domain-symmetric weights, we also show the possibility of a spontaneous domain symmetry breaking driven by the bending energy.
Open AccessLoop models on random maps via nested loops: case of domain symmetry breaking and application to the Potts model
We use the nested loop approach to investigate loop models on random planar maps where the domains delimited by the loops are given two alternating colors, which can be assigned different local weights, hence allowing for an explicit Z_2 domain symmetry breaking. Each loop receives a non local weight n, as well as a local bending energy which controls loop turns. By a standard cluster construction that we review, the Q = n^2 Potts model on general random maps is mapped to a particular instance of this problem with domain-non-symmetric weights. We derive in full generality a set of coupled functional relations for a pair of generating series which encode the enumeration of loop configurations on maps with a boundary of a given color, and solve it by extending well-known complex analytic techniques. In the case where loops are fully-packed, we analyze in details the phase diagram of the model and derive exact equations for the position of its non-generic critical points. In particular, we underline that the critical Potts model on general random maps is not self-dual whenever Q \neq 1. In a model with domain-symmetric weights, we also show the possibility of a spontaneous domain symmetry breaking driven by the bending energy.
- Open Access
More on the O(n) model on random maps via nested loops: loops with bending energy
We continue our investigation of the nested loop approach to the O(n) model on random maps, by extending it to the case where loops may visit faces of arbitrary degree. This allows to express the partition function of the O(n) loop model as a specialization of the multivariate generating function of maps with controlled face degrees, where the face weights are determined by a fixed point condition. We deduce a functional equation for the resolvent of the model, involving some ring generating function describing the immediate vicinity of the loops. When the ring generating function has a single pole, the model is amenable to a full solution. Physically, such situation is realized upon considering loops visiting triangles only and further weighting these loops by some local bending energy. Our model interpolates between the two previously solved cases of triangulations without bending energy and quadrangulations with rigid loops. We analyze the phase diagram of our model in details and derive in particular the location of its non-generic critical points, which are in the universality classes of the dense and dilute O(n) model coupled to 2D quantum gravity. Similar techniques are also used to solve a twisting loop model on quadrangulations where loops are forced to make turns within each visited square. Along the way, we revisit the problem of maps with controlled, possibly unbounded, face degrees and give combinatorial derivations of the one-cut lemma and of the functional equation for the resolvent.
Open AccessMore on the O(n) model on random maps via nested loops: loops with bending energy
We continue our investigation of the nested loop approach to the O(n) model on random maps, by extending it to the case where loops may visit faces of arbitrary degree. This allows to express the partition function of the O(n) loop model as a specialization of the multivariate generating function of maps with controlled face degrees, where the face weights are determined by a fixed point condition. We deduce a functional equation for the resolvent of the model, involving some ring generating function describing the immediate vicinity of the loops. When the ring generating function has a single pole, the model is amenable to a full solution. Physically, such situation is realized upon considering loops visiting triangles only and further weighting these loops by some local bending energy. Our model interpolates between the two previously solved cases of triangulations without bending energy and quadrangulations with rigid loops. We analyze the phase diagram of our model in details and derive in particular the location of its non-generic critical points, which are in the universality classes of the dense and dilute O(n) model coupled to 2D quantum gravity. Similar techniques are also used to solve a twisting loop model on quadrangulations where loops are forced to make turns within each visited square. Along the way, we revisit the problem of maps with controlled, possibly unbounded, face degrees and give combinatorial derivations of the one-cut lemma and of the functional equation for the resolvent.
- 22 June 2012
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 45 (27)
More on theO(n) model on random maps via nested loops: loops with bending energy
- 22 June 2012
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 45 (27)
More on theO(n) model on random maps via nested loops: loops with bending energy