Related papers: Multi-tiling and equidecomposability of polytopes …
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…
In the hierarchy of structural sophistication for lattice polytopes, normal polytopes mark a point of origin; very ample and Koszul polytopes occupy bottom and top spots in this hierarchy, respectively. In this paper we explore a simple…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…
The set of all subracks $\mathcal{R}(X)$ of a finite rack $X$ form a lattice under inclusion. We prove that if a rack $X$ satisfies a certain condition then the homotopy type of the order complex of $\mathcal{R}(X)$ is a $(m-2)$-sphere,…
For a locally compact abelian group $G$ a simple proof is given for the known fact that a bounded domain $\Omega$ tiles $G$ with translations by a lattice $\Lambda$ if and only if the set of characters of $G$ indexed by the dual lattice of…
A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…
Reflexive lattice polytopes play a key role in combinatorics, algebraic geometry, physics, and other areas. One important class of lattice polytopes are lattice simplices defining weighted projective spaces. We investigate the question of…
In a previous article [N. Delice, F.W. Nijhoff and S. Yoo-Kong, J. Phys. A: Math. Theor. 48(3) (2015), 035206] a novel class of elliptic Lax pairs for integrable lattice equations was introduced. The present article proposes a…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…
We study the PBW filtration on irreducible finite--dimensional representations for the Lie algebra of type $\tt B_n$. We prove in several cases, including all multiples of the adjoint representation and all irreducible finite--dimensional…
Let T be a tile in the Cartesian plane made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be…
We discuss problems of simultaneous tiling. This means that we have an object (set, function) which tiles space with two or more different sets of translations. The most famous problem of this type is the Steinhaus problem which asks for a…
We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with respect to geometric, combinatorial, and algebraic properties.…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…