arXiv subjects

E. Guitter

Publications and source records attributed to E. Guitter.

At least 37 records · Page 2Linked to original sources

arXiv2005

Combinatorics of bicubic maps with hard particles

We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be performed upon introducing a larger class of "admissible" trees with possibly doubly-occupied edges and summing them with appropriate signed weights. The proof relies on an extension of the cutting procedure allowing for the presence on the maps of special non-sectile edges. The admissible trees are characterized by simple local rules, allowing eventually for an exact enumeration of planar bicubic maps with hard particles. We also discuss generalizations for maps with particles subject to more general exclusion rules and show how to re-derive the enumeration of quartic maps with Ising spins in the present framework of admissible trees. We finally comment on a possible interpretation in terms of branching processes.

math.CO↗

arXiv2004

Planar maps as labeled mobiles

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call mobiles. Our bijection covers all the classes of maps previously enumerated by either the two-matrix model used by physicists or by the bijection with blossom trees used by combinatorists. Our bijection reduces the enumeration of maps to that, much simpler, of mobiles and moreover keeps track of the geodesic distance within the initial maps via the mobiles' labels. Generating functions for mobiles are shown to obey systems of algebraic recursion relations.

math.CO↗

arXiv2003

Random trees between two walls: Exact partition function

We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that adjacent vertices have labels differing by +1 or -1. A non-trivial partition function is obtained whenever the target space is bounded by walls. We concentrate on the two cases where the target space is (i) the half-line bounded by a wall at the origin or (ii) a segment bounded by two walls at a finite distance. The general solution has a soliton-like structure involving elliptic functions. We derive the corresponding continuum scaling limit which takes the remarkable form of the Weierstrass p-function with constrained periods. These results are used to analyze the probability for an evolving population spreading in one dimension to attain the boundary of a given domain with the geometry of the target (i) or (ii). They also translate, via suitable bijections, into generating functions for bounded planar graphs.

cond-mat.stat-mech↗

arXiv2003

Statistics of planar graphs viewed from a vertex: A study via labeled trees

We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of edges and vertices at given geodesic distances from the origin. Our analysis relies on bijections with labeled trees, in which the labels encode the information on the geodesic distance from the origin. In the case of infinitely large graphs, we give in particular explicit formulas for the probabilities that the origin have given numbers of neighboring edges and/or vertices, as well as explicit values for the corresponding moments.

cond-mat.stat-mech↗

arXiv2003

Geodesic Distance in Planar Graphs

We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection with decorated trees, leading to a recursion relation on the geodesic distance. The latter is solved exactly in terms of discrete soliton-like expressions, suggesting an underlying integrable structure. We extract from this solution the fractal dimensions at the various (multi)-critical points, as well as the precise scaling forms of the continuum two-point functions and the probability distributions for the geodesic distance in (multi)-critical random surfaces. The two-point functions are shown to obey differential equations involving the residues of the KdV hierarchy.

cond-mat.stat-mech↗

arXiv2002

Combinatorics of Hard Particles on Planar Graphs

We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in this purely combinatorial language.

cond-mat.stat-mech↗

arXiv2002

Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof

We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an alternative and purely combinatorial solution to the problem of counting arbitrary planar maps with prescribed vertex degrees.

cond-mat.stat-mech↗

arXiv2002

Counting Colored Random Triangulations

We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to the enumeration of decorated trees. We give a direct combinatorial derivation of the associated counting function, involving tricolored trees. This is generalized to arbitrary k-gonal tessellations with cyclic colorings and checked by use of matrix models.

cond-mat.stat-mech↗

arXiv2002

Critical and Tricritical Hard Objects on Bicolorable Random Lattices: Exact Solutions

We address the general problem of hard objects on random lattices, and emphasize the crucial role played by the colorability of the lattices to ensure the existence of a crystallization transition. We first solve explicitly the naive (colorless) random-lattice version of the hard-square model and find that the only matter critical point is the non-unitary Lee-Yang edge singularity. We then show how to restore the crystallization transition of the hard-square model by considering the same model on bicolored random lattices. Solving this model exactly, we show moreover that the crystallization transition point lies in the universality class of the Ising model coupled to 2D quantum gravity. We finally extend our analysis to a new two-particle exclusion model, whose regular lattice version involves hard squares of two different sizes. The exact solution of this model on bicolorable random lattices displays a phase diagram with two (continuous and discontinuous) crystallization transition lines meeting at a higher order critical point, in the universality class of the tricritical Ising model coupled to 2D quantum gravity.

cond-mat.stat-mech↗

arXiv2001

Generalized Lorentzian Triangulations and the Calogero Hamiltonian

We introduce and solve a generalized model of 1+1D Lorentzian triangulations in which a certain subclass of outgrowths is allowed, the occurrence of these being governed by a coupling constant β. Combining transfer matrix-, saddle point- and path integral techniques we show that for β<1 it is possible to take a continuum limit in which the model is described by a 1D quantum Calogero Hamiltonian. The coupling constant βsurvives the continuum limit and appears as a parameter of the Calogero potential.

hep-th↗

arXiv2000

Meanders: Exact Asymptotics

We conjecture that meanders are governed by the gravitational version of a c=-4 two-dimensional conformal field theory, allowing for exact predictions for the meander configuration exponent α=\sqrt{29}(\sqrt{29}+\sqrt{5})/12, and the semi-meander exponent {\barα}=1+\sqrt{11}(\sqrt{29}+\sqrt{5})/24. This result follows from an interpretation of meanders as pairs of fully packed loops on a random surface, described by two c=-2 free fields. The above values agree with recent numerical estimates. We generalize these results to a score of meandric numbers with various geometries and arbitrary loop fugacities.

cond-mat.stat-mech↗

arXiv1999

Integrable 2D Lorentzian Gravity and Random Walks

We introduce and solve a family of discrete models of 2D Lorentzian gravity with higher curvature, which possess mutually commuting transfer matrices, and whose spectral parameter interpolates between flat and curved space-times. We further establish a one-to-one correspondence between Lorentzian triangulations and directed Random Walks. This gives a simple explanation why the Lorentzian triangulations have fractal dimension 2 and why the curvature model lies in the universality class of pure Lorentzian gravity. We also study integrable generalizations of the curvature model with arbitrary polygonal tiles. All of them are found to lie in the same universality class.

hep-th↗

arXiv1999

Fully Packed O(n=1) Model on Random Eulerian Triangulations

We introduce a matrix model describing the fully-packed O(n) model on random Eulerian triangulations (i.e. triangulations with all vertices of even valency). For n=1 the model is mapped onto a particular gravitational 6-vertex model with central charge c=1, hence displaying the expected shift c -> c+1 when going from ordinary random triangulations to Eulerian ones. The case of arbitrary n is also discussed.

cond-mat.stat-mech↗

arXiv1998

Hamiltonian Cycles on Random Eulerian Triangulations

A random Eulerian triangulation is a random triangulation where an even number of triangles meet at any given vertex. We argue that the central charge increases by one if the fully packed O(n) model is defined on a random Eulerian triangulation instead of an ordinary random triangulation. Considering the case n -> 0, this implies that the system of random Eulerian triangulations equipped with Hamiltonian cycles describes a c=-1 matter field coupled to 2D quantum gravity as opposed to the system of usual random triangulations equipped with Hamiltonian cycles which has c=-2. Hence, in this case one should see a change in the entropy exponent from the value gamma=-1 to the irrational value gamma=(-1-\sqrt{13})/6=-0.76759... when going from a usual random triangulation to an Eulerian one. A direct enumeration of configurations confirms this change in gamma.

cond-mat.stat-mech↗

arXiv1998

Hamiltonian Cycles on a Random Three-coordinate Lattice

Consider a random three-coordinate lattice of spherical topology having 2v vertices and being densely covered by a single closed, self-avoiding walk, i.e. being equipped with a Hamiltonian cycle. We determine the number of such objects as a function of v. Furthermore we express the partition function of the corresponding statistical model as an elliptic integral.

cond-mat.stat-mech↗

arXiv1997

Folding of the Triangular Lattice in the FCC Lattice with Quenched Random Spontaneous Curvature

We study the folding of the regular two-dimensional triangular lattice embedded in the regular three-dimensional Face Centered Cubic lattice, in the presence of quenched random spontaneous curvature. We consider two types of quenched randomness: (1) a ``physical'' randomness arising from a prior random folding of the lattice, creating a prefered spontaneous curvature on the bonds; (2) a simple randomness where the spontaneous curvature is chosen at random independently on each bond. We study the folding transitions of the two models within the hexagon approximation of the Cluster Variation Method. Depending on the type of randomness, the system shows different behaviors. We finally discuss a Hopfield-like model as an extension of the physical randomness problem to account for the case where several different configurations are stored in the prior pre-folding process.

cond-mat.stat-mech↗

arXiv1997

Coloring Random Triangulations

We introduce and solve a two-matrix model for the tri-coloring problem of the vertices of a random triangulation. We present three different solutions: (i) by orthogonal polynomial techniques (ii) by use of a discrete Hirota bilinear equation (iii) by direct expansion. The model is found to lie in the universality class of pure two-dimensional quantum gravity, despite the non-polynomiality of its potential.

cond-mat↗

arXiv1996

Folding of the Triangular Lattice with Quenched Random Bending Rigidity

We study the problem of folding of the regular triangular lattice in the presence of a quenched random bending rigidity + or - K and a magnetic field h (conjugate to the local normal vectors to the triangles). The randomness in the bending energy can be understood as arising from a prior marking of the lattice with quenched creases on which folds are favored. We consider three types of quenched randomness: (1) a ``physical'' randomness where the creases arise from some prior random folding; (2) a Mattis-like randomness where creases are domain walls of some quenched spin system; (3) an Edwards-Anderson-like randomness where the bending energy is + or - K at random independently on each bond. The corresponding (K,h) phase diagrams are determined in the hexagon approximation of the cluster variation method. Depending on the type of randomness, the system shows essentially different behaviors.

cond-mat↗