Related papers: Bounded lattice tiles that pack with another latti…
We give a short proof of the fact that there are no measurable subsets of Euclidean space (in dimension d > 2), which, no matter how translated and rotated, always contain exactly one integer lattice point. In dimension d=2 (the original…
We prove that fairly general spaces of tilings of R^d are fiber bundles over the torus T^d, with totally disconnected fiber. This was conjectured (in a weaker form) in [W3], and proved in certain cases. In fact, we show that each such space…
Lattice and special nonlattice multilevel constellations constructed from binary codes, such as Constructions A, C, and D, have relevant applications in Mathematics (sphere packing) and in Communication (multi-stage decoding and efficient…
Let $\mathcal{P} \subset \mathbb{R}^d$ be a lattice polytope of dimension $d$. Let $b(\mathcal{P})$ denote the number of lattice points belonging to the boundary of $\mathcal{P}$ and $c(\mathcal{P})$ that to the interior of $\mathcal{P}$.…
Will the cosmological multiverse, when described mathematically, have easily stated properties that are impossible to prove or disprove using mathematical physics? We explore this question by constructing lattice multiverses which exhibit…
We give several different geometric characterizations of the situation in which the parallel set $F_\epsilon$ of a self-similar set $F$ can be described by the inner $\epsilon$-parallel set $T_{-\epsilon}$ of the associated canonical tiling…
Simultaneous tiling for several different translational sets has been studied rather extensively, particularly in connection with the Steinhaus problem. The study of orthonormal wavelets in recent years, particularly for arbitrary dilation…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
Let $(\lambda^+(M),\lambda^-(M))$ denote the pair of measured foliations at the boundary at infinity $\partial_\infty$ of a quasi-Fuchsian manifold $M$. We prove that $(\lambda^+(M),\lambda^-(M))$ is filling if $M$ is close to being…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
We prove that the set of quadratic growths achievable by integer superharmonic functions on the $F$-lattice, a periodic subgraph of the square lattice with oriented edges, has the structure of an overlapping circle packing. The proof…
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
We describe the canonical correspondence between set of all finite metric spaces and set of special symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those…
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…
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…
We consider substitution tilings in R^d that give rise to point sets that are not bounded displacement (BD) equivalent to a lattice and study the cardinality of BD(X), the set of distinct BD class representatives in the corresponding tiling…
Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible,…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, --The class of all finite…
Suppose $G$ is a locally solid lattice group. It is known that there are non-equivalent classes of bounded homomorphisms on $G$ which have topological structures. In this paper, our attempt is to assign lattice structures on them. More…