Related papers: Multi-tiling and equidecomposability of polytopes …
We introduce Tadao Oda's famous question on lattice polytopes which was originally posed at Oberwolfach in 1997 and, although simple to state, has remained unanswered. The question is motivated by a discussion of the two-dimensional case -…
The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…
We use the measurable Hall's theorem due to Cie\'sla and Sabok to prove that (i) if two measurable sets $A,B \subset \mathbb{R}^d$ of the same measure are bounded remainder sets with respect to a given irrational $d$-dimensional vector…
We prove that, for fixed n there exist only finitely many embeddings of Q-factorial toric varieties X into P^n that are induced by a complete linear system. The proof is based on a combinatorial result that for fixed nonnegative integers d…
Magnetic translation symmetry on a finite periodic square lattice is investigated for an arbitrary uniform magnetic field in arbitrary dimensions. It can be used to classify eigenvectors of the Hamiltonian. The system can be converted to…
We provide a complete set of linearizability conditions for nonlinear partial difference equations de- fined on four points and, using them, we classify all linearizable multilinear partial difference equations defined on four points up to…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…
The classification of lattice equations that are integrable in the sense of higher-dimensional consistency is extended by allowing directed edges. We find two cases that are not transformable via the 'admissible transformations' to the…
We consider a class of large superposed states, obtained from dimer coverings on spin-1/2 isotropic lattices, whose potential usefulness ranges from organic molecules to quantum computation. We show that they are genuinely multiparty…
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…
It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the…
We define Q-normal lattice polytopes. Natural examples of such polytopes are Cayley sums of strictly combinatorially equivalent lattice polytopes, which correspond to particularly nice toric fibrations, namely toric projective bundles. In a…
It is known that a positive, compactly supported function $f \in L^1(\mathbb R)$ can tile by translations only if the translation set is a finite union of periodic sets. We prove that this is not the case if $f$ is allowed to have unbounded…
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.
We prove the existence of lattice isomorphic line arrangements having $\pi_1$-equivalent or homotopy-equivalent complements and non homeomorphic embeddings in the complex projective plane. We also provide two explicit examples, one is…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.
We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…
The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…