889 research outputs found
Counting Polygon Triangulations is Hard
We prove that it is #P-complete to count the triangulations of a (non-simple) polygon
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
The number of triangulations of a planar n point set is known to be ,
where the base lies between and The fastest known algorithm
for counting triangulations of a planar n point set runs in time.
The fastest known arbitrarily close approximation algorithm for the base of the
number of triangulations of a planar n point set runs in time subexponential in
We present the first quasi-polynomial approximation scheme for the base of
the number of triangulations of a planar point set
Geodesic-Preserving Polygon Simplification
Polygons are a paramount data structure in computational geometry. While the
complexity of many algorithms on simple polygons or polygons with holes depends
on the size of the input polygon, the intrinsic complexity of the problems
these algorithms solve is often related to the reflex vertices of the polygon.
In this paper, we give an easy-to-describe linear-time method to replace an
input polygon by a polygon such that (1)
contains , (2) has its reflex
vertices at the same positions as , and (3) the number of vertices
of is linear in the number of reflex vertices. Since the
solutions of numerous problems on polygons (including shortest paths, geodesic
hulls, separating point sets, and Voronoi diagrams) are equivalent for both
and , our algorithm can be used as a preprocessing
step for several algorithms and makes their running time dependent on the
number of reflex vertices rather than on the size of
Large induced subgraphs via triangulations and CMSO
We obtain an algorithmic meta-theorem for the following optimization problem.
Let \phi\ be a Counting Monadic Second Order Logic (CMSO) formula and t be an
integer. For a given graph G, the task is to maximize |X| subject to the
following: there is a set of vertices F of G, containing X, such that the
subgraph G[F] induced by F is of treewidth at most t, and structure (G[F],X)
models \phi.
Some special cases of this optimization problem are the following generic
examples. Each of these cases contains various problems as a special subcase:
1) "Maximum induced subgraph with at most l copies of cycles of length 0
modulo m", where for fixed nonnegative integers m and l, the task is to find a
maximum induced subgraph of a given graph with at most l vertex-disjoint cycles
of length 0 modulo m.
2) "Minimum \Gamma-deletion", where for a fixed finite set of graphs \Gamma\
containing a planar graph, the task is to find a maximum induced subgraph of a
given graph containing no graph from \Gamma\ as a minor.
3) "Independent \Pi-packing", where for a fixed finite set of connected
graphs \Pi, the task is to find an induced subgraph G[F] of a given graph G
with the maximum number of connected components, such that each connected
component of G[F] is isomorphic to some graph from \Pi.
We give an algorithm solving the optimization problem on an n-vertex graph G
in time O(#pmc n^{t+4} f(t,\phi)), where #pmc is the number of all potential
maximal cliques in G and f is a function depending of t and \phi\ only. We also
show how a similar running time can be obtained for the weighted version of the
problem. Pipelined with known bounds on the number of potential maximal
cliques, we deduce that our optimization problem can be solved in time
O(1.7347^n) for arbitrary graphs, and in polynomial time for graph classes with
polynomial number of minimal separators
Quantum Gravity and Matter: Counting Graphs on Causal Dynamical Triangulations
An outstanding challenge for models of non-perturbative quantum gravity is
the consistent formulation and quantitative evaluation of physical phenomena in
a regime where geometry and matter are strongly coupled. After developing
appropriate technical tools, one is interested in measuring and classifying how
the quantum fluctuations of geometry alter the behaviour of matter, compared
with that on a fixed background geometry.
In the simplified context of two dimensions, we show how a method invented to
analyze the critical behaviour of spin systems on flat lattices can be adapted
to the fluctuating ensemble of curved spacetimes underlying the Causal
Dynamical Triangulations (CDT) approach to quantum gravity. We develop a
systematic counting of embedded graphs to evaluate the thermodynamic functions
of the gravity-matter models in a high- and low-temperature expansion. For the
case of the Ising model, we compute the series expansions for the magnetic
susceptibility on CDT lattices and their duals up to orders 6 and 12, and
analyze them by ratio method, Dlog Pad\'e and differential approximants. Apart
from providing evidence for a simplification of the model's analytic structure
due to the dynamical nature of the geometry, the technique introduced can shed
further light on criteria \`a la Harris and Luck for the influence of random
geometry on the critical properties of matter systems.Comment: 40 pages, 15 figures, 13 table
Ergodicity and Slowing Down in Glass-Forming Systems with Soft Potentials: No Finite-Temperature Singularities
The aim of this paper is to discuss some basic notions regarding generic
glass forming systems composed of particles interacting via soft potentials.
Excluding explicitly hard-core interaction we discuss the so called `glass
transition' in which super-cooled amorphous state is formed, accompanied with a
spectacular slowing down of relaxation to equilibrium, when the temperature is
changed over a relatively small interval. Using the classical example of a
50-50 binary liquid of N particles with different interaction length-scales we
show that (i) the system remains ergodic at all temperatures. (ii) the number
of topologically distinct configurations can be computed, is temperature
independent, and is exponential in N. (iii) Any two configurations in phase
space can be connected using elementary moves whose number is polynomially
bounded in N, showing that the graph of configurations has the `small world'
property. (iv) The entropy of the system can be estimated at any temperature
(or energy), and there is no Kauzmann crisis at any positive temperature. (v)
The mechanism for the super-Arrhenius temperature dependence of the relaxation
time is explained, connecting it to an entropic squeeze at the glass
transition. (vi) There is no Vogel-Fulcher crisis at any finite temperature T>0Comment: 10 pages, 9 figures, submitted to PR
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some
weighted and, respectively, non-weighted common geometric graphs drawn on n
points in the plane in general position (with no three points collinear):
perfect matchings, spanning trees, spanning cycles (tours), and triangulations.
(i) We present a new lower bound construction for the maximum number of
triangulations a set of n points in general position can have. In particular,
we show that a generalized double chain formed by two almost convex chains
admits {\Omega}(8.65^n) different triangulations. This improves the bound
{\Omega}(8.48^n) achieved by the double zig-zag chain configuration studied by
Aichholzer et al.
(ii) We present a new lower bound of {\Omega}(12.00^n) for the number of
non-crossing spanning trees of the double chain composed of two convex chains.
The previous bound, {\Omega}(10.42^n), stood unchanged for more than 10 years.
(iii) Using a recent upper bound of 30^n for the number of triangulations,
due to Sharir and Sheffer, we show that n points in the plane in general
position admit at most O(68.62^n) non-crossing spanning cycles.
(iv) We derive lower bounds for the number of maximum and minimum weighted
geometric graphs (matchings, spanning trees, and tours). We show that the
number of shortest non-crossing tours can be exponential in n. Likewise, we
show that both the number of longest non-crossing tours and the number of
longest non-crossing perfect matchings can be exponential in n. Moreover, we
show that there are sets of n points in convex position with an exponential
number of longest non-crossing spanning trees. For points in convex position we
obtain tight bounds for the number of longest and shortest tours. We give a
combinatorial characterization of the longest tours, which leads to an O(nlog
n) time algorithm for computing them
- …