English
Related papers

Related papers: The reflexive dimension of a lattice polytope

200 papers

Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…

Combinatorics · Mathematics 2018-12-11 William T. Trotter , Bartosz Walczak , Ruidong Wang

In this paper for any dimension n we give a complete list of lattice convex polytopes in R^n that are regular with respect to the group of affine transformations preserving the lattice.

Combinatorics · Mathematics 2008-12-17 Oleg Karpenkov

The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $\omega(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be…

Commutative Algebra · Mathematics 2024-02-14 Winfried Bruns , Takayuki Hibi

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

Combinatorics · Mathematics 2007-05-23 Nicolas Ressayre , Pierre-Louis Montagard

The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…

Combinatorics · Mathematics 2020-12-22 Ivan Soprunov , Jenya Soprunova

The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann

An $n$-dimensional rep-tile is a compact, connected submanifold of $\mathbb{R}^n$ with non-empty interior which can be decomposed into pairwise isometric rescaled copies of itself whose interiors are disjoint. We show that every smooth…

Geometric Topology · Mathematics 2025-10-01 Ryan Blair , Patricia Cahn , Alexandra Kjuchukova , Hannah Schwartz

A notion of rigidity with respect to an arbitrary semidualizing complex C over a commutative noetherian ring R is introduced and studied. One of the main result characterizes C-rigid complexes. Specialized to the case when C is the relative…

Commutative Algebra · Mathematics 2009-09-15 Luchezar L. Avramov , Srikanth B. Iyengar , Joseph Lipman

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

Metric Geometry · Mathematics 2021-07-15 Mariia Dospolova

The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…

Computational Complexity · Computer Science 2017-04-24 Andrii Riazanov , Mikhail Vyalyiy

If the system S of contracting similitudes on $ R^2$ satisfies open convex set condition, then the set F of extreme points of the convex hull $\tilde{K}$ of it's invariant self-similar set K has Hausdorff dimension 0 . If, additionally, all…

Metric Geometry · Mathematics 2007-05-23 Andrew Tetenov , Ivan Davydkin

One can always decompose Dirichlet-Voronoi polytopes of lattices non-trivially into a Minkowski sum of Dirichlet-Voronoi polytopes of rigid lattices. In this report we show how one can enumerate all rigid positive semidefinite quadratic…

Metric Geometry · Mathematics 2007-05-23 Mathieu Dutour , Frank Vallentin

In this article we study the families of $K3$ surfaces derived from 3 dimensional 5 verticed reflexive polytopes with at most terminal singularity. We determine the lattice structures, the period differential equations and the projective…

Complex Variables · Mathematics 2016-03-30 Atsuhira Nagano

The rank rk(G) of a profinite group G is the supremum of d(H), where H ranges over all closed subgroups of G and d(H) denotes the minimal cardinality of a topological generating set for H. A compact topological group G admits the structure…

Group Theory · Mathematics 2011-01-06 B. Klopsch

Given a $d$-dimensional convex polytope $P$ and nonnegative integer $k$ not exceeding $d-1$, let $G_k (P)$ denote the simple graph on the node set of $k$-dimensional faces of $P$ in which two such faces are adjacent if there exists a…

Combinatorics · Mathematics 2008-01-10 Christos A. Athanasiadis

We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lann\'er, Kaplinskaja,…

Metric Geometry · Mathematics 2022-09-13 Anna Felikson , Pavel Tumarkin

A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…

Combinatorics · Mathematics 2018-06-04 Benjamin Braun , Robert Davis , Liam Solus

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…

Discrete Mathematics · Computer Science 2021-06-09 Matthias Schymura , Ina Seidel , Stefan Weltge

Despite a full characterization of the face vectors of simple and simplicial polytopes, the face numbers of general polytopes are poorly understood. Around 1997, B\'ar\'any asked whether for all convex $d$-polytopes $P$ and all $0 \leq k…

Combinatorics · Mathematics 2022-06-06 Joshua Hinman

We show that h*-vectors of alcoved polytopes P in R^n (of Lie type A) are unimodal if they contain interior lattice points and their facets have lattice distance 1 to the set of interior lattice points. The maximal possible such distance…

Combinatorics · Mathematics 2021-05-03 Rainer Sinn , Hannah Sjöberg