English
Related papers

Related papers: The second Voronoi conjecture on parallelohedra fo…

200 papers

We characterize the polytopes in $\mathbb{R}^d$ (not necessarily convex or connected ones) which multi-tile the space by translations along a given lattice. We also give a necessary and sufficient condition for two polytopes in…

Combinatorics · Mathematics 2019-10-30 Nir Lev , Bochen Liu

The holomorphy conjecture states roughly that Igusa's zeta function associated to a hypersurface and a character is holomorphic on $\mathbb{C}$ whenever the order of the character does not divide the order of any eigenvalue of the local…

Number Theory · Mathematics 2015-08-04 Wouter Castryck , Denis Ibadula , Ann Lemahieu

We study a class of semialgebraic convex bodies called discotopes. These are instances of zonoids, objects of interest in real algebraic geometry and random geometry. We focus on the face structure and on the boundary hypersurface of…

Algebraic Geometry · Mathematics 2025-06-02 Fulvio Gesmundo , Chiara Meroni

In this note we prove a theorem concerning the sewing of even dimensional neighbourly polytopes. The theorem provides a fast algorithm for sewing in practice. We also give a description of the universal faces of a sewn $d$-polytope in terms…

Metric Geometry · Mathematics 2011-02-25 Ryan Trelford , Viktor Vigh

The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…

Combinatorics · Mathematics 2022-07-26 Guillermo Pineda-Villavicencio , David Yost

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

Computational Geometry · Computer Science 2008-11-04 Muhammad Abdullah Adnan , Masud Hasan

Problem 4.19 in Ziegler's "Lectures on Polytopes" asserts that every simple $3$-dimensional polytope has the property that its dual can be constructed as the convex hull of a subset of the vertices of the original simple polytope. In this…

Combinatorics · Mathematics 2020-04-27 William Gustafson

This paper is devoted to the 3-dimensional relative differential geometry of surfaces. In the Euclidean space $\R{E} ^3 $ we consider a surface $\varPhi %\colon \vect{x} = \vect{x}(u^1,u^2) $ with position vector field $\vect{x}$, which is…

Differential Geometry · Mathematics 2017-06-29 Stylianos Stamatakis , Ioannis Kaffas , Ioannis Delivos

A once-extended d-dimensional topological field theory Z is a symmetric monoidal functor (taking values in a chosen target symmetric monoidal (infty,2)-category) assigning values to (d-2)-manifolds, (d-1)-manifolds, and d-manifolds. We show…

Algebraic Topology · Mathematics 2018-06-13 Christopher Schommer-Pries

In 1967, Gr\"unbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. We prove this conjecture and also…

Combinatorics · Mathematics 2020-04-21 Lei Xue

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

Combinatorics · Mathematics 2017-12-15 Manuel Aprile , Alfonso Cevallos , Yuri Faenza

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

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Combinatorics · Mathematics 2009-08-13 Sandeep Koranne , Anand Kulkarni

Icosahedron and dodecahedron can be dissected into tetrahedral tiles projected from 3D-facets of the Delone polytopes representing the deep and shallow holes of the root lattice D_6. The six fundamental tiles of tetrahedra of edge lengths 1…

Metric Geometry · Mathematics 2020-08-11 Mehmet Koca , Ramazan Koc , Nazife Ozdes Koca , Abeer Al-Siyabi

Consider a homogeneous Poisson point process of the Euclidean plane and its Voronoi tessellation. The present note discusses the properties of two stationary point processes associated with the latter and depending on a parameter $\theta$.…

Probability · Mathematics 2020-11-02 François Baccelli , Sanket S. Kalamkar

A conjecture of Kalai and Eckhoff that the face vector of an arbitrary flag complex is also the face vector of some particular balanced complex is verified.

Combinatorics · Mathematics 2007-05-23 Andrew Frohmader

Rohatgi and the author recently proved a shuffling theorem for lozenge tilings of `doubly-dented hexagons' (arXiv:1905.08311). The theorem can be considered as a hybrid between two classical theorems in the enumeration of tilings:…

Combinatorics · Mathematics 2019-07-09 Tri Lai

In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…

Combinatorics · Mathematics 2007-05-23 Sascha Kurz

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

Metric Geometry · Mathematics 2025-07-02 Bernhard Klaassen

In this paper, we present a new approach to obtain symmetric tiles with curved edges. Our approach is based on using higher-order Voronoi sites that are closed under wallpaper symmetries. The resulting Voronoi tessellations provide us with…

Computational Geometry · Computer Science 2023-10-25 Haard Panchal , Ergun Akleman , Vinayak Krishnamurthy , Tolga Talha Yildiz , Varda Grover