English
Related papers

Related papers: Voronoi conjecture for five-dimensional paralleloh…

200 papers

Santos' construction of counter-examples to the Hirsch Conjecture (2012) is based on the existence of prismatoids of dimension d of width greater than d. Santos, Stephen and Thomas (2012) have shown that this cannot occur in $d \le 4$.…

Combinatorics · Mathematics 2015-09-22 Benjamin Matschke , Francisco Santos , Christophe Weibel

We continue the study of intersection bodies of polytopes, focusing on the behavior of $IP$ under translations of $P$. We introduce an affine hyperplane arrangement and show that the polynomials describing the boundary of $I(P+t)$ can be…

Metric Geometry · Mathematics 2025-06-02 Marie-Charlotte Brandenburg , Chiara Meroni

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

Computational Geometry · Computer Science 2024-12-20 Erik D. Demaine , Martin L. Demaine , Markus Hecher , Rebecca Lin , Victor H. Luo , Chie Nara

It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the…

Combinatorics · Mathematics 2024-06-14 Joseph Doolittle , Alex McDonough

We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. The framework is sufficiently general to support diagrams embedded on a family of two-dimensional…

Computational Geometry · Computer Science 2015-05-13 Ophir Setter

In this paper, we prove that it is undecidable whether a set of two polycubes can tile $\mathbb{Z}^3$ by translation. The proof involves a new technique that allows us to simulate two disconnected polycubes with two connected polycubes. By…

Combinatorics · Mathematics 2025-08-19 Yoonhu Kim

High energy experimental data can be viewed as a sampling of the relevant phase space. We point out that one can apply Voronoi tessellations in order to understand the underlying probability distributions in this phase space. Interesting…

High Energy Physics - Phenomenology · Physics 2015-11-10 Dipsikha Debnath , James S. Gainer , Doojin Kim , Konstantin T. Matchev

Let $M$ be a $2$-space form. Let $P$ be a convex polygon in $M$. For these polygons, we define (and justify) a curvature $\kappa_i$ at each vertex $A_i$ of the polygon and and prove the following Blaschke's type theorem: If $P$ is a convex…

Differential Geometry · Mathematics 2023-05-15 Alexander Borisenko , Vicente Miquel

We use Fourier methods to prove that if $n > 1$ translates of sublattices of $Z^d$ tile $Z^d$, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. This is a…

Combinatorics · Mathematics 2010-06-04 David Feldman , James Propp , Sinai Robins

A classical Theorem of Alexandrov states that the map associating its boundary to a convex polyhdedron of the 3-dimensional Euclidean space is a bijection from the set of convex polyhdedron up to congruence to the set of isometry classes of…

Geometric Topology · Mathematics 2025-07-02 Léo Brunswic

Parallelogram polyominoes are a subclass of convex polyominoes in the square lattice that has been studied extensively in the literature. Recently congruence classes of convex polyominoes with respect to rotations and reflections have been…

Combinatorics · Mathematics 2007-05-23 Pierre Leroux , Etienne Rassart

We introduce a fast Fourier transform on regular d-dimensional lattices. We investigate properties of congruence class representants, i.e. their ordering, to classify directions and derive a Cooley-Tukey-Algorithm. Despite the fast Fourier…

Numerical Analysis · Mathematics 2013-06-18 Ronny Bergmann

A construction of convex flag triangulations of five and higher dimensional spheres, whose h-polynomials fail to have only real roots, is given. We show that there is no such example in dimensions lower than five. A condition weaker than…

Combinatorics · Mathematics 2010-05-13 Swiatoslaw R. Gal

A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…

Combinatorics · Mathematics 2023-11-21 Satoshi Murai , Isabella Novik , Hailun Zheng

In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm…

Metric Geometry · Mathematics 2009-05-04 Mathieu Dutour Sikiric , Achill Schuermann , Frank Vallentin

The forward and reverse Funk weak metrics are fundamental distance functions on convex bodies that serve as the building blocks for the Hilbert and Thompson metrics. In this paper we study Voronoi diagrams under the forward and reverse Funk…

Computational Geometry · Computer Science 2026-02-24 Aditya Acharya , Auguste Henry Gezalyan , David M. Mount , Danesh Sivakumar

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Metric Geometry · Mathematics 2021-12-16 Csaba Vincze , Márk Oláh , Letícia Lengyel

We formulate several conjectures which shed light on the structure of Veronese syzygies of projective spaces. Our conjectures are based on experimental data that we derived by developing a numerical linear algebra and distributed…

Commutative Algebra · Mathematics 2017-11-10 Juliette Bruce , Daniel Erman , Steve Goldstein , Jay Yang

The Wythoff construction takes a $d$-dimensional polytope $P$, a subset $S$ of $\{0,..., d\}$ and returns another $d$-dimensional polytope $P(S)$. If $P$ is a regular polytope, then $P(S)$ is vertex-transitive. This construction builds a…

Combinatorics · Mathematics 2008-08-11 Michel Deza , Mathieu Dutour , Sergey Shpectorov

A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of…

Number Theory · Mathematics 2007-05-23 Robert Erdahl , Andrei Ordine , Konstantin Rybnikov
‹ Prev 1 8 9 10 Next ›