相关论文: Multi-tiling and equidecomposability of polytopes …

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

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

Let S be a bounded, Riemann measurable set in R^d, and L be a lattice. By a theorem of Fuglede, if S tiles R^d with translation set L, then S has an orthogonal basis of exponentials. We show that, under the more general condition that S…

We prove a polynomially effective equidistribution result for expanding translates in the space of $d$-dimensional affine lattices for any $d\ge 2$.

We are concerned with the well-posedness of linear elliptic systems posed on $\mathbb{R}^d$. The concrete problem of interest, for which we require this theory, arises from the linearization of the equations of anisotropic finite…

We provide sufficient conditions for a lattice polynomial function to be self-commuting. We explicitly describe self-commuting polynomial functions over chains.

This paper proves the following statement: If a convex body can form a three or fourfold translative tiling in the three-dimensional space, it must be a parallelohedron. In other words, it must be a parallelotope, a hexagonal prism, a…

Let $A$ be a polytope in $\mathbb{R}^d$ (not necessarily convex or connected). We say that $A$ is spectral if the space $L^2(A)$ has an orthogonal basis consisting of exponential functions. A result due to Kolountzakis and Papadimitrakis…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…

The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z^d}$ which tiles that lattice by translations, in fact tiles periodically. We announce here a disproof of this conjecture for sufficiently large $d$, which…

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

Brandolini et al. conjectured that all concrete lattice polytopes can multitile the space. We disprove this conjecture in a strong form, by constructing an infinite family of counterexamples in $\mathbb{R}^3$.

The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…

We show by a direct construction that there are at least $\exp\{cV^{(d-1)/(d+1)}\}$ convex lattice polytopes in $\mathbb{R}^d$ of volume $V$ that are different in the sense that none of them can be carried to an other one by a lattice…

In 3-dimensional Euclidean space there exist two exceptional polyhedra, the rhombic dodecahedron and the rhombic triacontahedron, the only known polytopes (besides polygons) that are edge-transitive without being vertex-transitive. We show…

We prove that for any two lattices $L, M \subseteq \mathbb{R}^d$ of the same volume there exists a measurable, bounded, common fundamental domain of them. In other words, there exists a bounded measurable set $E \subseteq \mathbb{R}^d$ such…

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

This paper focuses on the undecidability of translational tiling of $n$-dimensional space $\mathbb{Z}^n$ with a set of $k$ tiles. It is known that tiling $\mathbb{Z}^2$ with translated copies with a set of $8$ tiles is undecidable.…