Related papers: Classification of lattice-regular lattice convex p…
In this paper we report on the full classification of Dirichlet-Voronoi polyhedra and Delaunay subdivisions of five-dimensional translational lattices. We obtain a complete list of $110244$ affine types (L-types) of Delaunay subdivisions…
We consider lattice equations on ${\mathds{Z}}^2$ which are autonomous, affine linear and possess the symmetries of the square. Some basic properties of equations of this type are derived, as well as a sufficient linearization condition and…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…
For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…
In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible.
We determine the group of linear transformations on a vector space $V$ that preserve a polynomial function $f$ on $V$ for several interesting pairs $(V,f)$, using the theory of semisimple algebraic groups.
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…
We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
Finite distributive lattices whose join-meet ideals are of K\"onig type will be classified. Furthermore, a class of polyominoes whose polyomino ideals are of K\"onig type will be studied.
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…
This paper is about the study of F-transforms based on overlap and grouping maps, residual and co-residual implicator over complete lattice from both constructive and axiomatic approaches. Further, the duality, basic properties, and the…
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…
This paper is a continuation of an earlier one, and completes a classification of the configurations of points in a plane lattice that determine angles that are rational multiples of ${\pi}$. We give a complete and explicit description of…
We give a characterization of flat affine connections on manifolds by means of a natural affine representation of the universal covering of the Lie group of diffeomorphisms preserving the connection. From the infinitesimal point of view,…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
We extend White's classification of empty tetrahedra to the complete classification of lattice $3$-polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them…
A rotational lattice is a structure (L;\vee,\wedge, g) where L=(L;\vee,\wedge) is a lattice and g is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using J\'onsson's lemma,…