Related papers: Voronoi conjecture for five-dimensional paralleloh…
In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…
We explore some generalizations of fullerenes F_v (simple polyhedra with v vertices and only 5- and 6-gonal faces) seen as (d-1)-dimensional simple manifolds (preferably, spherical or polytopal) with only 5- and 6-gonal 2-faces. First,…
A conic of the Veronese surface in PG(5,3) is a quadrangle. If one such quadrangle is replaced with its diagonal triangle, then one obtains a point model $K$ for Witt's 5-$(12,6,1)$ design, the blocks being the hyperplane sections…
We give an example of a set $\Omega \subset \R^5$ which is a finite union of unit cubes, such that $L^2(\Omega)$ admits an orthonormal basis of exponentials $\{\frac{1}{|\Omega|^{1/2}} e^{2\pi i \xi_j \cdot x}: \xi_j \in \Lambda \}$ for…
Let $\mathcal{P}$ be the class of combinatorial 3-dimensional simple polytopes $P$, different from a tetrahedron, without 3- and 4-belts of facets. By the results of Pogorelov and Andreev, a polytope $P$ admits a realisation in Lobachevsky…
Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fr\`{e}chet distance. In this…
We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…
Let z be a primitive fifth root of unity and let F be the cyclotomic field F=Q(z). Let O be the ring of integers. We compute the Voronoi polyhedron of binary Hermitian forms over F and classify GL_2(O)-conjugacy classes of perfect forms.…
A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…
The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…
Voronoi tessellation, also known as Voronoi diagram, is an important computational geometry technique that has applications in various scientific disciplines. It involves dividing a given space into regions based on the proximity to a set…
The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…
We study the dissection of a square into congruent convex polygons. Yuan \emph{et al.} [Dissecting the square into five congruent parts, Discrete Math. \textbf{339} (2016) 288-298] asked whether, if the number of tiles is a prime number…
A conjecture of Fuglede states that a bounded measurable set D, of measure 1, can tile space by translations if and only if the Hilbert space L^2(D) has an orthonormal basis consisting of exponentials exp(i 2 pi lambda x). If D has the…
The famous Kepler conjecture has a less spectacular, two-dimensional equivalent: The theorem of Thue states that the densest circle packing in the Euclidean plane has a hexagonal structure. A common proof uses Voronoi cells and analyzes…
It is proved that every pseudo-self-affine tiling in R^d is mutually locally derivable with a self-affine tiling. A characterization of pseudo-self-similar tilings in terms of derived Voronoi tessellations is a corollary. Previously, these…
In relation to Fuglede's conjecture, we establish several Plancherel-type identities and demonstrate the surjectivity of the Fourier transform between certain unbounded tiling sets of $\mathbb{R}$ that are in duality. In the terminology…
We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…
The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on…
A perfect prismatoid is a convex polytope $P$ such that for every its facet $F$ the set $vert(P) \setminus vert(F)$ belongs to a supporting hyperplane $\alpha \parallel F$. We prove that every perfect prismatoid is affinely equivalent to…