Construction of periodic adapted orthonormal frames on closed space curves

The construction of continuous adapted orthonormal frames along C1 closed–loop spatial curves is addressed. Such frames are important in the design of periodic spatial rigid–body motions along smooth closed paths. The construction is illustrated through the simplest non–trivial context — namely, C1 closed loops defined by a single Pythagorean–hodograph (PH) quintic space curve of a prescribed total arc length. It is shown that such curves comprise a two–parameter family, dependent on two angular variables, and they degenerate to planar curves when these parameters differ by an integer multiple of π. The desired frame is constructed through a rotation applied to the normal–plane vectors of the Euler–Rodrigues frame, so as to interpolate a given initial/final frame orientation. A general solution for periodic adapted frames of minimal twist on C1 closed–loop PH curves is possible, although this incurs transcendental terms. However, the C1 closed–loop PH quintics admit particularly simple rational periodic adapted frames

The efficient certification of knottedness and Thurston norm

We show that the problem of determining whether a knot in the 3-sphere is non-trivial lies in NP. This is a consequence of the following more general result. The problem of determining whether the Thurston norm of a second homology class in a compact orientable 3-manifold is equal to a given integer is in NP. As a corollary, the problem of determining the genus of a knot in the 3-sphere is in NP. We also show that the problem of determining whether a compact orientable 3-manifold has incompressible boundary is in NP.Comment: 101 pages, 24 figures; v2 contains some improvements suggested by the referee, which have strengthened the main theorem

All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs

We describe algorithms, based on Avis and Fukuda's reverse search paradigm, for listing all maximal independent sets in a sparse graph in polynomial time and delay per output. For bounded degree graphs, our algorithms take constant time per set generated; for minor-closed graph families, the time is O(n) per set, and for more general sparse graph families we achieve subquadratic time per set. We also describe new data structures for maintaining a dynamic vertex set S in a sparse or minor-closed graph family, and querying the number of vertices not dominated by S; for minor-closed graph families the time per update is constant, while it is sublinear for any sparse graph family. We can also maintain a dynamic vertex set in an arbitrary m-edge graph and test the independence of the maintained set in time O(sqrt m) per update. We use the domination data structures as part of our enumeration algorithms.Comment: 10 page

A dedicated algorithm for calculating ground states for the triangular random bond Ising model

In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. Therefore, it is explained how the respective ground state problem can be mapped to an auxiliary minimum-weight perfect matching problem, solvable in polynomial time. Consequently, the ground state properties as well as minimum-energy domain wall (MEDW) excitations for very large 2d systems, e.g. lattice graphs with up to N=384x384 spins, can be analyzed very fast. Here, we investigate the critical behavior of the corresponding T=0 ferromagnet to spin-glass transition, signaled by a breakdown of the magnetization, using finite-size scaling analyses of the magnetization and MEDW excitation energy and we contrast our numerical results with previous simulations and presumably exact results.Comment: 5 pages, 5 figure

Spanning trees of 3-uniform hypergraphs

Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to the class of Pfaffian graphs. We prove a complexity result for recognizing a 3-Pfaffian 3-graph and describe two large classes of 3-Pfaffian 3-graphs -- one of these is given by a forbidden subgraph characterization analogous to Little's for bipartite Pfaffian graphs, and the other consists of a class of partial Steiner triple systems for which the property of being 3-Pfaffian can be reduced to the property of an associated graph being Pfaffian. We exhibit an infinite set of partial Steiner triple systems that are not 3-Pfaffian, none of which can be reduced to any other by deletion or contraction of triples. We also find some necessary or sufficient conditions for the existence of a spanning tree of a 3-graph (much more succinct than can be obtained by the currently fastest polynomial-time algorithm of Gabow and Stallmann for finding a spanning tree) and a superexponential lower bound on the number of spanning trees of a Steiner triple system.Comment: 34 pages, 9 figure