Related papers: Polyboxes, cube tilings and rigidity
A cube tiling of R^d is a family of pairwise disjoint cubes $[0,1)^d+T=\{[0,1)^d+t:t\in T\}$ such that $\bigcup_{t\in T}([0,1)^d+t)=R^d$. Two cubes $[0,1)^d+t$, $[0,1)^d+s$ are called a twin pair if their closures have a complete facet in…
Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…
We classify pairs $(X,G)$ consisting of a (possibly singular) cubic threefold $X\subset\mathbb{P}^4$ and a finite subgroup $G\subset\mathrm{Aut}(X)$ such that $X$ is $G$-birationally rigid, i.e., $X$ is a $G$-Mori fiber space (over a…
A topological commutative ring is said to be rigid when for every set $X$, the topological dual of the $X$-fold topological product of the ring is isomorphic to the free module over $X$. Examples are fields with a ring topology, discrete…
A self-affine tiling of a compact set G of positive Lebesgue measure is its partition to parallel shifts of a compact set which is affinely similar to G. We find all polyhedral sets (unions of finitely many convex polyhedra) that admit…
Each packing of R^d by translates of the unit cube [0,1)^d admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
We present a criterion, based on three commutator relations, that allows to decide whether two self-adjoint matrices with non-overlapping support are simultaneously unitarily similar to quasidiagonal matrices, i.e., whether they can be…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
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…
Let $S$ be a set of arbitrary objects, and let $S^d=\{v_1...v_d\colon v_i\in S\}$. A polybox code is a set $V\subset S^d$ with the property that for every two words $v,w\in V$ there is $i\in [d]$ with $v_i'=w_i$, where a permutation…
Let $S$ be a set of arbitrary objects, and let $s\mapsto s'$ be a permutation of $S$ such that $s"=(s')'=s$ and $s'\neq s$. Let $S^d=\{v_1...v_d\colon v_i\in S\}$. Two words $v,w\in S^d$ are dichotomous if $v_i=w'_i$ for some $i\in [d]$,…
The problem of determining when entanglement is present in a quantum system is one of the most active areas of research in quantum physics. Depending on the setting at hand, different notions of entanglement (or lack thereof) become…
We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…
Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…
It is proved that a three-dimensional double cone is a birationally rigid variety. We also compute the group of birational automorphisms of such a variety. This work is based on the method of "untwisting" maximal singularities of linear…
We say that a topological group $G$ is partially box $\kappa$-resolvable if there exist a dense subset $B$ of $G$ and a subset $A $ of $G$, $|A|=\kappa$ such that the subsets $\{ aB: a\in A\}$ are pairwise disjoint. If $G=AB$ then $G$ is…
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…
The classical Cauchy rigidity theorem for convex polytopes reads that if two convex polytopes have isometric developments then they are congruent. In other words, we can decide whether two polyhedra are isometric or not by using their…
We give a new proof of the following interesting fact recently proved by Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way.…