English
Related papers

Related papers: Perfect Delaunay Polytopes and Perfect Inhomogeneo…

200 papers

A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties.…

Combinatorics · Mathematics 2020-08-19 Florian Kohl , McCabe Olsen , Raman Sanyal

A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…

Number Theory · Mathematics 2012-06-29 Ruslan Sharipov

We consider ``hyperideal'' circle patterns, i.e. patterns of disks appearing in the definition of the Delaunay decomposition associated to a set of disjoint disks, possibly with cone singularities at the center of those disks. Hyperideal…

Differential Geometry · Mathematics 2009-01-20 Jean-Marc Schlenker

We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…

Combinatorics · Mathematics 2025-11-07 Olha Silina

A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. Such cuboids are not yet discovered and their non-existence is also not proved. Perfect Euler cuboids…

Number Theory · Mathematics 2012-07-18 Ruslan Sharipov

Roughly speaking, the rank of a Delaunay polytope (first introduced in \cite{DGL92}) is its number of degrees of freedom. In \cite{DL}, a method for computing the rank of a Delaunay polytope $P$ using the hypermetrics related to $P$ is…

Combinatorics · Mathematics 2007-05-23 Mathieu Dutour Sikiric , Viatcheslav Grishukhin

The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v is a prescribed…

Combinatorics · Mathematics 2013-01-31 Roger E. Behrend

A perfect cuboid is a rectangular parallelepiped whose edges, whose face diagonals, and whose space diagonal are of integer lengths. The problem of finding such cuboids or proving their non-existence is not solved thus far. The second…

Number Theory · Mathematics 2015-04-28 A. A. Masharov , R. A. Sharipov

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Number Theory · Mathematics 2020-10-12 Andrej Dujella , Vinko Petričević

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…

Rings and Algebras · Mathematics 2007-05-23 Martin Goldstern , Miroslav Ploscica

Let A be a subspace arrangement with a geometric lattice such that codim(x) > 1 for every x in A. Using rational homotopy theory, we prove that the complement M(A) is rationally elliptic if and only if the sum of the orthogonal subspaces is…

Algebraic Topology · Mathematics 2007-05-23 G. Debongnie

We show there is an uncountable number of parallel total perfect codes in the integer lattice graph ${\Lambda}$ of $\R^2$. In contrast, there is just one 1-perfect code in ${\Lambda}$ and one total perfect code in ${\Lambda}$ restricting to…

Combinatorics · Mathematics 2015-03-13 Italo J. Dejter

A Delaunay decomposition is a cell decomposition in R^d for which each cell is inscribed in a Euclidean ball which is empty of all other vertices. This article introduces a generalization of the Delaunay decomposition in which the Euclidean…

Computational Geometry · Computer Science 2019-08-27 Jeffrey Danciger , Sara Maloni , Jean-Marc Schlenker

A Riemannian manifold is called harmonic if its volume density function expressed in polar coordinates centered at any point is radial. Flat and rank-one symmetric spaces are harmonic. The converse (the Lichnerowicz Conjecture) is true for…

Differential Geometry · Mathematics 2007-05-23 Y. Nikolayevsky

We construct a hollow lattice polytope (resp. a hollow lattice simplex) of dimension $14$ (resp.$~404$) and of width $15$ (resp.$~408$). They are the first known hollow lattice polytopes of width larger than dimension. We also construct a…

Combinatorics · Mathematics 2019-12-24 Giulia Codenotti , Francisco Santos

A convex polytope $P$ in the real projective space with reflections in the facets of $P$ is a Coxeter polytope if the reflections generate a subgroup $\Gamma$ of the group of projective transformations so that the $\Gamma$-translates of the…

Geometric Topology · Mathematics 2022-07-14 Suhyoung Choi , Gye-Seon Lee , Ludovic Marquis

The perfect cone compactification is a toroidal compactification which can be defined for locally symmetric varieties. Let $\overline{D_{L}/\widetilde{O}^{+}(L)}^{p}$ be the perfect cone compactification of the quotient of the type IV…

Algebraic Geometry · Mathematics 2021-12-13 Luca Giovenzana

Delaunay protection is a measure of how far a Delaunay triangulation is from being degenerate. In this short paper we study the protection properties and other quality measures of the Delaunay triangulations of a family of lattices that is…

Computational Geometry · Computer Science 2019-03-08 Aruni Choudhary , Arijit Ghosh

Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…

Combinatorics · Mathematics 2012-06-11 Mark Mixer , Egon Schulte , Asia Ivic Weiss

Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ satisfies a mild genericity property. Voronoi diagrams and Delaunay…

Computational Geometry · Computer Science 2016-12-12 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh , Nikolay Martynchuk