Related papers: Bounded lattice tiles that pack with another latti…
A local description of the non-flat infinitesimally bendable Euclidean hypersurfaces was recently given by Dajczer and Vlachos \cite{DaVl}. From their classification, it follows that there is an abundance of infinitesimally bendable…
We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…
We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…
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$…
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$.
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
The Dehn function and its higher-dimensional generalizations measure the difficulty of filling a sphere in a space by a ball. In nonpositively curved spaces, one can construct fillings using geodesics, but fillings become more complicated…
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…
We call a periodic ball packing in d-dimensional Euclidean space periodically (strictly) jammed with respect to a period lattice if there are no nontrivial motions of the balls that preserve the period (that maintain some period with…
We consider polygons with the following ``pairing property'': for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon $K$ tiles the plane multiply when translated at the…
It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
Tiling models are classical statistical models in which different geometric shapes, the tiles, are packed together such that they cover space completely. In this paper we discuss a class of two-dimensional tiling models in which the tiles…
In this article we show that there exist measurable sets W in the plane with finite measure that tile the plane in a measurable way under the action of a expansive matrix A, an affine Weyl group W, and a full rank lattice G. This note is…
The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
A topological space is iso-dense if it has a dense set of isolated points. A topological space is scattered if each of its non-empty subspaces has an isolated point. In $\mathbf{ZF}$, in the absence of the axiom of choice, basic properties…