3,180 research outputs found
Large Limits in Tensor Models: Towards More Universality Classes of Colored Triangulations in Dimension
We review an approach which aims at studying discrete (pseudo-)manifolds in
dimension and called random tensor models. More specifically, we
insist on generalizing the two-dimensional notion of -angulations to higher
dimensions. To do so, we consider families of triangulations built out of
simplices with colored faces. Those simplices can be glued to form new building
blocks, called bubbles which are pseudo-manifolds with boundaries. Bubbles can
in turn be glued together to form triangulations. The main challenge is to
classify the triangulations built from a given set of bubbles with respect to
their numbers of bubbles and simplices of codimension two. While the colored
triangulations which maximize the number of simplices of codimension two at
fixed number of simplices are series-parallel objects called melonic
triangulations, this is not always true anymore when restricting attention to
colored triangulations built from specific bubbles. This opens up the
possibility of new universality classes of colored triangulations. We present
three existing strategies to find those universality classes. The first two
strategies consist in building new bubbles from old ones for which the problem
can be solved. The third strategy is a bijection between those colored
triangulations and stuffed, edge-colored maps, which are some sort of hypermaps
whose hyperedges are replaced with edge-colored maps. We then show that the
present approach can lead to enumeration results and identification of
universality classes, by working out the example of quartic tensor models. They
feature a tree-like phase, a planar phase similar to two-dimensional quantum
gravity and a phase transition between them which is interpreted as a
proliferation of baby universes
Expansive Motions and the Polytope of Pointed Pseudo-Triangulations
We introduce the polytope of pointed pseudo-triangulations of a point set in
the plane, defined as the polytope of infinitesimal expansive motions of the
points subject to certain constraints on the increase of their distances. Its
1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of
the point set and whose edges are flips of interior pseudo-triangulation edges.
For points in convex position we obtain a new realization of the
associahedron, i.e., a geometric representation of the set of triangulations of
an n-gon, or of the set of binary trees on n vertices, or of many other
combinatorial objects that are counted by the Catalan numbers. By considering
the 1-dimensional version of the polytope of constrained expansive motions we
obtain a second distinct realization of the associahedron as a perturbation of
the positive cell in a Coxeter arrangement.
Our methods produce as a by-product a new proof that every simple polygon or
polygonal arc in the plane has expansive motions, a key step in the proofs of
the Carpenter's Rule Theorem by Connelly, Demaine and Rote (2000) and by
Streinu (2000).Comment: 40 pages, 7 figures. Changes from v1: added some comments (specially
to the "Further remarks" in Section 5) + changed to final book format. This
version is to appear in "Discrete and Computational Geometry -- The
Goodman-Pollack Festschrift" (B. Aronov, S. Basu, J. Pach, M. Sharir, eds),
series "Algorithms and Combinatorics", Springer Verlag, Berli
On the Number of Pseudo-Triangulations of Certain Point Sets
We pose a monotonicity conjecture on the number of pseudo-triangulations of
any planar point set, and check it on two prominent families of point sets,
namely the so-called double circle and double chain. The latter has
asymptotically pointed pseudo-triangulations, which lies
significantly above the maximum number of triangulations in a planar point set
known so far.Comment: 31 pages, 11 figures, 4 tables. Not much technical changes with
respect to v1, except some proofs and statements are slightly more precise
and some expositions more clear. This version has been accepted in J. Combin.
Th. A. The increase in number of pages from v1 is mostly due to formatting
the paper with "elsart.cls" for Elsevie
Flip Graphs of Degree-Bounded (Pseudo-)Triangulations
We study flip graphs of triangulations whose maximum vertex degree is bounded
by a constant . In particular, we consider triangulations of sets of
points in convex position in the plane and prove that their flip graph is
connected if and only if ; the diameter of the flip graph is .
We also show that, for general point sets, flip graphs of pointed
pseudo-triangulations can be disconnected for , and flip graphs of
triangulations can be disconnected for any . Additionally, we consider a
relaxed version of the original problem. We allow the violation of the degree
bound by a small constant. Any two triangulations with maximum degree at
most of a convex point set are connected in the flip graph by a path of
length , where every intermediate triangulation has maximum degree
at most .Comment: 13 pages, 12 figures, acknowledgments update
Euclidean Dynamical Triangulation revisited: is the phase transition really 1st order? (extended version)
The transition between the two phases of 4D Euclidean Dynamical Triangulation
[1] was long believed to be of second order until in 1996 first order behavior
was found for sufficiently large systems [5,9]. However, one may wonder if this
finding was affected by the numerical methods used: to control volume
fluctuations, in both studies [5,9] an artificial harmonic potential was added
to the action; in [9] measurements were taken after a fixed number of accepted
instead of attempted moves which introduces an additional error. Finally the
simulations suffer from strong critical slowing down which may have been
underestimated. In the present work, we address the above weaknesses: we allow
the volume to fluctuate freely within a fixed interval; we take measurements
after a fixed number of attempted moves; and we overcome critical slowing down
by using an optimized parallel tempering algorithm [12]. With these improved
methods, on systems of size up to 64k 4-simplices, we confirm that the phase
transition is first order.
In addition, we discuss a local criterion to decide whether parts of a
triangulation are in the elongated or crumpled state and describe a new
correspondence between EDT and the balls in boxes model. The latter gives rise
to a modified partition function with an additional, third coupling. Finally,
we propose and motivate a class of modified path-integral measures that might
remove the metastability of the Markov chain and turn the phase transition into
second order.Comment: 26 pages, 21 figures, extended version of arXiv:1311.471
Pseudo-Cartesian coordinates in a model of Causal Dynamical Triangulations
Causal Dynamical Triangulations is a non-perturbative quantum gravity model,
defined with a lattice cut-off. The model can be viewed as defined with a
proper time but with no reference to any three-dimensional spatial background
geometry. It has four phases, depending on the parameters (the coupling
constants) of the model. The particularly interesting behavior is observed in
the so-called de Sitter phase, where the spatial three-volume distribution as a
function of proper time has a semi-classical behavior which can be obtained
from an effective mini-superspace action. In the case of the three-sphere
spatial topology, it has been difficult to extend the effective semi-classical
description in terms of proper time and spatial three-volume to include genuine
spatial coordinates, partially because of the background independence inherent
in the model. However, if the spatial topology is that of a three-torus, it is
possible to define a number of new observables that might serve as spatial
coordinates as well as new observables related to the winding numbers of the
three-dimensional torus. The present paper outlines how to define the
observables, and how they can be used in numerical simulations of the model.Comment: 26 pages, 15 figure
New higher-order transition in causal dynamical triangulations
We reinvestigate the recently discovered bifurcation phase transition in
Causal Dynamical Triangulations (CDT) and provide further evidence that it is a
higher order transition. We also investigate the impact of introducing matter
in the form of massless scalar fields to CDT. We discuss the impact of scalar
fields on the measured spatial volumes and fluctuation profiles in addition to
analysing how the scalar fields influence the position of the bifurcation
transition.Comment: 15 pages, 11 figures. Conforms with version accepted for publication
in Phys. Rev.
- …