Related papers: On Lattice-Free Orbit Polytopes
There is a natural action of the braid group on the symmetric matrices with units on the diagonal, appearing in various fields as Singularity Theory, Frobenius Manifolds or Isomonodromic deformations of certain classes of linear…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…
We prove that every countable acylindrically hyperbolic group admits a highly transitive action with finite kernel. This theorem uniformly generalizes many previously known results and allows us to answer a question of Garion and Glassner…
After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…
The COntractor REnormalization group (CORE) method, a new approach to solving Hamiltonian lattice systems, is introduced. The method combines contraction and variational techniques with the real-space renormalization group approach. It…
A Teichmuller lattice is the orbit of a point in Teichmuller space under the action of the mapping class group. We show that the proportion of lattice points in a ball of radius r which are not pseudo-Anosov tends to zero as r tends to…
We study lattice points on hyperbolic circles centred at Heegner points of class number one. Our main result is that, on a density one subset of radii tending to infinity, the angles of such points equidistribute on the unit circle. To…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
The COntractor REnormalization group (CORE) approximation, a new method for solving Hamiltonian lattice systems, is introduced. The approach combines variational and contraction techniques with the real-space renormalization group approach…
We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
We give new classes of examples of orbits of the diagonal group in the space of unit volume lattices in R^d for d > 2 with nice (homogeneous) orbit closures, as well as examples of orbits with explicitly computable but irregular orbit…
We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…
We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…
We prove the existence of infinitely many periodic points of symplectomorphisms isotopic to the identity if they admit at least one (non-contractible) hyperbolic periodic orbit and satisfy some condition on its flux. The obtained periodic…
A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…
A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…
We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.
A tiling (edge-to-edge) of the plane is a family of tiles that cover the plane without gaps or overlaps. Vertex figure of a vertex in a tiling to be the union of all edges incident to that vertex. A tiling is $k$-vertex-homogeneous if any…