English
Related papers

Related papers: The six-dimensional Delaunay polytopes

200 papers

Let $E$ be a finite-dimensional real vector space and $M\subseteq E$ be a convex polytope with non-empty interior. We turn the group of all $C^\infty$-diffeomorphisms of $M$ into a regular Lie group.

Differential Geometry · Mathematics 2022-03-23 Helge Glockner

A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…

Algebraic Geometry · Mathematics 2022-12-21 Jaeho Shin

Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…

Algebraic Geometry · Mathematics 2012-03-14 János Kollár

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

Combinatorics · Mathematics 2025-06-02 Marie-Charlotte Brandenburg , Jesús A. De Loera , Chiara Meroni

We show that if a complex has free finitely generated reduced homology groups for two consecutive dimensions and trivial homology for all other dimensions, then it must have the homotopy type of a wedge of spheres of two consecutive…

Algebraic Topology · Mathematics 2025-03-14 Omar Antolín Camarena , Andrés Carnero Bravo

Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…

Combinatorics · Mathematics 2017-10-17 Laura Escobar , Alexander Yong

We characterise simply-connected biquotients which potentially admit metrics of holonomy G_2. We prove that there are at most three real homotopy types of rationally elliptic such manifolds---all of them being formal. In the course of this…

Differential Geometry · Mathematics 2014-03-07 Manuel Amann

We introduce a notion of essential hyperbolic Coxeter polytope as a polytope which fits some minimality conditions. The problem of classification of hyperbolic reflection groups can be easily reduced to classification of essential Coxeter…

Combinatorics · Mathematics 2019-10-25 Anna Felikson , Pavel Tumarkin

A $d$-dimensional lattice polytope $P$ is Gorenstein if it has a multiple $r P$ that is a reflexive polytope up to translation by a lattice vector. The difference $d+1-r$ is called the degree of $P$. We show that a Gorenstein polytope is a…

Combinatorics · Mathematics 2022-03-10 Benjamin Nill

In 1997 Oda conjectured that every smooth lattice polytope has the integer decomposition property. We prove Oda's conjecture for centrally symmetric $3$-dimensional polytopes, by showing they are covered by lattice parallelepipeds and…

In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.

Metric Geometry · Mathematics 2011-05-27 Heling Liu , Chuanming Zong

A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…

Combinatorics · Mathematics 2013-07-02 Jesús A. De Loera , Edward D. Kim

A polytrope is a tropical polytope which at the same time is convex in the ordinary sense. A $d$-dimensional polytrope turns out to be a tropical simplex, that is, it is the tropical convex hull of $d+1$ points. This statement is equivalent…

Combinatorics · Mathematics 2010-03-24 Michael Joswig , Katja Kulas

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

Computational Complexity · Computer Science 2017-03-21 Thomas Rothvoss

Let P be a convex polytope containing the origin, whose dual is a lattice polytope. Hibi's Palindromic Theorem tells us that if P is also a lattice polytope then the Ehrhart $\delta$-vector of P is palindromic. Perhaps less well-known is…

Combinatorics · Mathematics 2022-10-28 Matthew H. J. Fiset , Alexander M. Kasprzyk

We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…

Combinatorics · Mathematics 2019-10-17 Niklas Kochdumper , Matthias Althoff

A two-step model for generating random polytopes is considered. For parameters $d$, $m$, and $p$, the first step is to generate a simple polytope $P$ whose facets are given by $m$ uniform random hyperplanes tangent to the unit sphere in…

Combinatorics · Mathematics 2021-08-16 Andrew Newman

A classification of discrete polymatroids whose independence polytopes are reflexive will be presented.

Combinatorics · Mathematics 2023-02-27 Jürgen Herzog , Takayuki Hibi

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

Metric Geometry · Mathematics 2019-08-16 J. Richard Gott

Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…

Combinatorics · Mathematics 2018-08-17 Benjamin Braun , Andrés R. Vindas-Meléndez
‹ Prev 1 3 4 5 6 7 10 Next ›