Related papers: Normal forms of convex lattice polytopes
A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
To classify the lattice polytopes with a given $\delta$-polynomial is an important open problem in Ehrhart theory. A complete classification of the Gorenstein simplices whose normalized volumes are prime integers is known. In particular,…
Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…
Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…
We give two new constructions of the harmonic algebra of a lattice polytope $P$, a bigraded algebra whose character is the $q$-Ehrhart series of $P$ defined by Reiner and Rhoades. First, we show that the harmonic algebra is the associated…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number…
We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D…
This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…
The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
We study families of superelliptic curves with fixed automorphism groups. Such families are parametrized with invariants expressed in terms of the coefficients of the curves. Algebraic relations among such invariants determine the lattice…
In the frame of a classification of general square systems of polynomial equations solvable by radicals, Esterov and Gusev succeeded in classifying all spanning lattice polytopes whose normalized volumes are at most $4$. In the present…
In this memoir, we study the even unimodular lattices of rank at most 24, as well as a related collection of automorphic forms of the orthogonal, symplectic and linear groups of small rank. Our guide is the question of determining the…
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the additional algebraic structure of ideal lattices usually makes us worry about the security, and it is widely believed that the algebraic structure…
We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.
In spin based quantum dot arrays, material or fabrication imprecisions affect the behaviour of the device, which must be taken into account when controlling it. This requires measuring the shape of specific convex polytopes. In this work,…