Related papers: Minimum-Turn Tours of Even Polyominoes

We provide a classification of minimal sets of homeomorphisms of the two-torus, in terms of the structure of their complement. We show that this structure is exactly one of the following types: (1) a disjoint union of topological disks, or…

We prove that, among the polygons in a punctured disc with fixed angles, the perimeter is minimized by the polygon with an inscribed horocycle centered at the puncture. We generalize this to a disc with a cone point and to an annulus with a…

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…

We prove the existence of at least $cl(M)$ periodic orbits for certain time dependant Hamiltonian systems on the cotangent bundle of an arbitrary compact manifold $M$. These Hamiltonians are not necessarily convex but they satisfy a certain…

We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by K\"uhn…

Let T denote Thompson's group of piecewise 2-adic linear homeomorphisms of the circle. Ghys and Sergiescu showed that the rotation number of every element of T is rational, but their proof is very indirect. We give here a short, direct…

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Let $E=\{e_1,\ldots,e_n\}$ be a set of $C$-oriented disjoint segments in the plane, where $C$ is a given finite set of orientations that spans the plane, and let $s$ and $t$ be two points. %(We also require that for each orientation in $C$,…

We prove that closed surfaces of all topological types, except for the non-orientable odd-genus ones, can be minimally embedded in the Riemannian product of a sphere and a circle of arbitrary radius. We illustrate it by obtaining some…

Whitney proved in 1931 that 4-connected planar triangulations are Hamiltonian. Hakimi, Schmeichel, and Thomassen conjectured in 1979 that if $G$ is a 4-connected planar triangulation with $n$ vertices then $G$ contains at least…

We prove D=11 supermembrane theories wrapping around in an irreducible way over $S^{1} \times S^{1}\times M^{9}$ on the target manifold, have a hamiltonian with strict minima and without infinite dimensional valleys at the minima for the…

The subdivided double construction on 4-regular graphs was used by Poto\v{c}nik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that…

We propose the following conjecture extending Dirac's theorem: if $G$ is a graph with $n\ge 3$ vertices and minimum degree $\delta(G)\ge n/2$, then in every orientation of $G$ there is a Hamilton cycle with at least $\delta(G)$ edges…

We show that every $k$-uniform hypergraph on $n$ vertices whose minimum $(k-2)$-degree is at least $(5/9+o(1))n^2/2$ contains a Hamiltonian cycle. A construction due to Han and Zhao shows that this minimum degree condition is optimal. The…

We prove a "gluing" theorem for monotone homotopies; a monotone homotopy is a homotopy through simple contractible closed curves which themselves are pairwise disjoint. We show that two monotone homotopies which have appropriate overlap can…

The Hamiltonian flow of the standard metric Hamiltonian with respect to the twisted symplectic structure on the cotangent bundle describes the motion of a charged particle on the base. We prove that under certain natural hypotheses the…

A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph $K_n$ admits a plane Hamiltonian cycle. It turned out that already the existence of much simpler non-crossing substructures in such drawings is hard to…

We give a proof of the convergence of an algorithm for the construction of lower dimensional elliptic tori in nearly integrable Hamiltonian systems. The existence of such invariant tori is proved by leading the Hamiltonian to a suitable…

In this note, we study the emergence of Hamiltonian Berge cycles in random $r$-uniform hypergraphs. For $r\geq 3$, we prove an optimal stopping-time result that if edges are sequently added to an initially empty $r$-graph, then as soon as…

We show that the total time of evolution from the initial quantum state to final quantum state and then back to the initial state, i.e., making a round trip along the great circle over S^2, must have a lower bound in quantum mechanics, if…