We generalize the well-known "12" and "24" Theorems for reflexive polytopes of dimension 2 and 3 to any smooth reflexive polytope. Our methods apply to a wider category of objects, here called reflexive GKM graphs, that are associated with certain monotone symplectic manifolds which do not necessarily admit a toric action.As an application, we provide bounds on the Betti numbers for certain monotone Hamiltonian spaces which depend on the minimal Chern number of the manifold.
Lattice-based reformulation techniques have been used successfully both theoretically and computationally. One such reformulation is obtained from the kernel lattice associated with an input matrix. Some of the hard instances in the literature that have been successfully tackled by lattice-based techniques have randomly generated input. Since the considered instances are very hard even in low dimension, less experience is available for larger instances. Recently, we have studied larger instances and observed that the LLL-reduced basis of the kernel lattice has a specific sparse structure. In particular, this translates into a map in which some of the original variables get a “rich”' translation into a new variable space, whereas some variables are only substituted in the new space. If an original variable is important in the sense of branching or cutting planes, this variable should be translated in a nontrivial way. In this paper we partially explain, through a probabilistic analysis, the obtained structure of the LLL-reduced basis in the case that the input matrix consists of one row. The key ingredient is a bound on the probability that the LLL-algorithm will interchange two subsequent basis vectors.
A staircase in this paper is the set of points in Z 2 below a given rational line in the plane that have Manhattan Distance less than 1 to the line. Staircases are closely related to Beatty and Sturmian sequences of rational numbers. Connecting the geometry and the number theoretic concepts, we obtain three equivalent characterizations of Sturmian sequences of rational numbers, as well as a new proof of Barvinok's theorem in dimension two, a recursion formula for Dedekind-Carlitz polynomials and a partially new proof of White's characterization of empty lattice tetrahedra. Our main tool is a recursive description of staircases in the spirit of the Euclidean Algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.