1,041 research outputs found
Counting and Enumerating Crossing-free Geometric Graphs
We describe a framework for counting and enumerating various types of
crossing-free geometric graphs on a planar point set. The framework generalizes
ideas of Alvarez and Seidel, who used them to count triangulations in time
where is the number of points. The main idea is to reduce the
problem of counting geometric graphs to counting source-sink paths in a
directed acyclic graph.
The following new results will emerge. The number of all crossing-free
geometric graphs can be computed in time for some .
The number of crossing-free convex partitions can be computed in time
. The number of crossing-free perfect matchings can be computed in
time . The number of convex subdivisions can be computed in time
. The number of crossing-free spanning trees can be computed in time
for some . The number of crossing-free spanning cycles
can be computed in time for some .
With the same bounds on the running time we can construct data structures
which allow fast enumeration of the respective classes. For example, after
time of preprocessing we can enumerate the set of all crossing-free
perfect matchings using polynomial time per enumerated object. For
crossing-free perfect matchings and convex partitions we further obtain
enumeration algorithms where the time delay for each (in particular, the first)
output is bounded by a polynomial in .
All described algorithms are comparatively simple, both in terms of their
analysis and implementation
Counting Triangulations and other Crossing-Free Structures Approximately
We consider the problem of counting straight-edge triangulations of a given
set of points in the plane. Until very recently it was not known
whether the exact number of triangulations of can be computed
asymptotically faster than by enumerating all triangulations. We now know that
the number of triangulations of can be computed in time,
which is less than the lower bound of on the number of
triangulations of any point set. In this paper we address the question of
whether one can approximately count triangulations in sub-exponential time. We
present an algorithm with sub-exponential running time and sub-exponential
approximation ratio, that is, denoting by the output of our
algorithm, and by the exact number of triangulations of , for some
positive constant , we prove that . This is the first algorithm that in sub-exponential time computes a
-approximation of the base of the number of triangulations, more
precisely, . Our algorithm can be
adapted to approximately count other crossing-free structures on , keeping
the quality of approximation and running time intact. In this paper we show how
to do this for matchings and spanning trees.Comment: 19 pages, 2 figures. A preliminary version appeared at CCCG 201
Wall Crossing, Quivers and Crystals
We study the spectrum of BPS D-branes on a Calabi-Yau manifold using the 0+1
dimensional quiver gauge theory that describes the dynamics of the branes at
low energies. The results of Kontsevich and Soibelman predict how the
degeneracies change. We argue that Seiberg dualities of the quiver gauge
theories, which change the basis of BPS states, correspond to crossing the
"walls of the second kind." There is a large class of examples, including local
del Pezzo surfaces, where the BPS degeneracies of quivers corresponding to one
D6 brane bound to arbitrary numbers of D4, D2 and D0 branes are counted by
melting crystal configurations. We show that the melting crystals that arise
are a discretization of the Calabi-Yau geometry. The shape of the crystal is
determined by the Calabi-Yau geometry and the background B-field, and its
microscopic structure by the quiver Q. We prove that the BPS degeneracies
computed from Q and Q' are related by the Kontsevich Soibelman formula, using a
geometric realization of the Seiberg duality in the crystal. We also show that,
in the limit of infinite B-field, the combinatorics of crystals arising from
the quivers becomes that of the topological vertex. We thus re-derive the
Gromov-Witten/Donaldson-Thomas correspondence
- …