14,511 research outputs found
Hamiltonian cycles and subsets of discounted occupational measures
We study a certain polytope arising from embedding the Hamiltonian cycle
problem in a discounted Markov decision process. The Hamiltonian cycle problem
can be reduced to finding particular extreme points of a certain polytope
associated with the input graph. This polytope is a subset of the space of
discounted occupational measures. We characterize the feasible bases of the
polytope for a general input graph , and determine the expected numbers of
different types of feasible bases when the underlying graph is random. We
utilize these results to demonstrate that augmenting certain additional
constraints to reduce the polyhedral domain can eliminate a large number of
feasible bases that do not correspond to Hamiltonian cycles. Finally, we
develop a random walk algorithm on the feasible bases of the reduced polytope
and present some numerical results. We conclude with a conjecture on the
feasible bases of the reduced polytope.Comment: revised based on referees comment
Periodic points of Hamiltonian surface diffeomorphisms
The main result of this paper is that every non-trivial Hamiltonian
diffeomorphism of a closed oriented surface of genus at least one has periodic
points of arbitrarily high period. The same result is true for S^2 provided the
diffeomorphism has at least three fixed points. In addition we show that up to
isotopy relative to its fixed point set, every orientation preserving
diffeomorphism F: S --> S of a closed orientable surface has a normal form. If
the fixed point set is finite this is just the Thurston normal form.Comment: Published by Geometry and Topology at
http://www.maths.warwick.ac.uk/gt/GTVol7/paper20.abs.htm
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time
It is well known that many local graph problems, like Vertex Cover and
Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time for graphs G=(V,E)
with a given tree decomposition of width tw. However, for nonlocal problems,
like the fundamental class of connectivity problems, for a long time we did not
know how to do this faster than tw^{O(tw)}|V|^{O(1)}. Recently, Cygan et al.
(FOCS 2011) presented Monte Carlo algorithms for a wide range of connectivity
problems running in time $c^{tw}|V|^{O(1)} for a small constant c, e.g., for
Hamiltonian Cycle and Steiner tree. Naturally, this raises the question whether
randomization is necessary to achieve this runtime; furthermore, it is
desirable to also solve counting and weighted versions (the latter without
incurring a pseudo-polynomial cost in terms of the weights).
We present two new approaches rooted in linear algebra, based on matrix rank
and determinants, which provide deterministic c^{tw}|V|^{O(1)} time algorithms,
also for weighted and counting versions. For example, in this time we can solve
the traveling salesman problem or count the number of Hamiltonian cycles. The
rank-based ideas provide a rather general approach for speeding up even
straightforward dynamic programming formulations by identifying "small" sets of
representative partial solutions; we focus on the case of expressing
connectivity via sets of partitions, but the essential ideas should have
further applications. The determinant-based approach uses the matrix tree
theorem for deriving closed formulas for counting versions of connectivity
problems; we show how to evaluate those formulas via dynamic programming.Comment: 36 page
Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
We construct an exactly solvable Hamiltonian acting on a 3-dimensional
lattice of spin- systems that exhibits topological quantum order.
The ground state is a string-net and a membrane-net condensate. Excitations
appear in the form of quasiparticles and fluxes, as the boundaries of strings
and membranes, respectively. The degeneracy of the ground state depends upon
the homology of the 3-manifold. We generalize the system to , were
different topological phases may occur. The whole construction is based on
certain special complexes that we call colexes.Comment: Revtex4 file, color figures, minor correction
- …