1,729 research outputs found
On the Enumeration of all Minimal Triangulations
We present an algorithm that enumerates all the minimal triangulations of a
graph in incremental polynomial time. Consequently, we get an algorithm for
enumerating all the proper tree decompositions, in incremental polynomial time,
where "proper" means that the tree decomposition cannot be improved by removing
or splitting a bag
Face pairing graphs and 3-manifold enumeration
The face pairing graph of a 3-manifold triangulation is a 4-valent graph
denoting which tetrahedron faces are identified with which others. We present a
series of properties that must be satisfied by the face pairing graph of a
closed minimal P^2-irreducible triangulation. In addition we present
constraints upon the combinatorial structure of such a triangulation that can
be deduced from its face pairing graph. These results are then applied to the
enumeration of closed minimal P^2-irreducible 3-manifold triangulations,
leading to a significant improvement in the performance of the enumeration
algorithm. Results are offered for both orientable and non-orientable
triangulations.Comment: 30 pages, 57 figures; v2: clarified some passages and generalised the
final theorem to the non-orientable case; v3: fixed a flaw in the proof of
the conical face lemm
The Weak-Coupling Limit of Simplicial Quantum Gravity
In the weak-coupling limit, kappa_0 going to infinity, the partition function
of simplicial quantum gravity is dominated by an ensemble of triangulations
with the ratio N_0/N_D close to the upper kinematic limit. For a combinatorial
triangulation of the D--sphere this limit is 1/D. Defining an ensemble of
maximal triangulations, i.e. triangulations that have the maximal possible
number of vertices for a given volume, we investigate the properties of this
ensemble in three dimensions using both Monte Carlo simulations and a
strong-coupling expansion of the partition function, both for pure simplicial
gravity and a with a suitable modified measure. For the latter we observe a
continuous phase transition to a crinkled phase and we investigate the fractal
properties of this phase.Comment: 32 pages, latex2e + 17 eps file
Combinatorial 3-manifolds with 10 vertices
We give a complete enumeration of all combinatorial 3-manifolds with 10
vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as
well as 518 vertex-minimal triangulations of the sphere product
and 615 triangulations of the twisted sphere product S^2_\times_S^1.
All the 3-spheres with up to 10 vertices are shellable, but there are 29
vertex-minimal non-shellable 3-balls with 9 vertices.Comment: 9 pages, minor revisions, to appear in Beitr. Algebra Geo
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic three-dimensional
topology, and the enumeration of vertex normal surfaces is the computational
bottleneck in many important algorithms. However, it is not well understood how
the number of such surfaces grows in relation to the size of the underlying
triangulation. Here we address this problem in both theory and practice. In
theory, we tighten the exponential upper bound substantially; furthermore, we
construct pathological triangulations that prove an exponential bound to be
unavoidable. In practice, we undertake a comprehensive analysis of millions of
triangulations and find that in general the number of vertex normal surfaces is
remarkably small, with strong evidence that our pathological triangulations may
in fact be the worst case scenarios. This analysis is the first of its kind,
and the striking behaviour that we observe has important implications for the
feasibility of topological algorithms in three dimensions.Comment: Extended abstract (i.e., conference-style), 14 pages, 8 figures, 2
tables; v2: added minor clarification
Entropy of random coverings and 4D quantum gravity
We discuss the counting of minimal geodesic ball coverings of -dimensional
riemannian manifolds of bounded geometry, fixed Euler characteristic and
Reidemeister torsion in a given representation of the fundamental group. This
counting bears relevance to the analysis of the continuum limit of discrete
models of quantum gravity. We establish the conditions under which the number
of coverings grows exponentially with the volume, thus allowing for the search
of a continuum limit of the corresponding discretized models. The resulting
entropy estimates depend on representations of the fundamental group of the
manifold through the corresponding Reidemeister torsion. We discuss the sum
over inequivalent representations both in the two-dimensional and in the
four-dimensional case. Explicit entropy functions as well as significant bounds
on the associated critical exponents are obtained in both cases.Comment: 54 pages, latex, no figure
- …