Related papers: 3-Dimensional Lattice Polytopes Without Interior L…
We study cosmological polytopes induced by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These graph-based lattice polytopes form a natural model of random lattice polytopes in which geometric features are determined by the…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
In this paper, we study homogeneous convex foliations on the complex projective plane $\mathbb{P}^2$. A foliation is called convex if all of its leaves, except straight lines, have no inflection points, and such foliations form a Zariski…
Given a finite quiver (directed graph) without loops and multiedges, the convex hull of the column vector of the incidence matrix is called the directed edge polytope and is an interesting example of lattice polytopes. In this paper, we…
Let $\lambda$ be a dominant weight of a finite dimensional simple Lie algebra and $W$ the Weyl group. The convex hull of $W\lambda$ is defined as the weight polytope of $\lambda$. We provide a new proof that there is a natural bijection…
We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n^2, where n is the…
A simple binary matroid is called claw-free if none of its rank-3 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $\mathrm{PG}(n-1,2)$ for which $|E \cap P|$ is not a basis of $P$ for any…
Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…
The reflexive dimension refldim(P) of a lattice polytope P is the minimal d so that P is the face of some d-dimensional reflexive polytope. We show that refldim(P) is finite for every P, and give bounds for refldim(kP) in terms of…
We single out a class of states possessing only threetangle but distributed all over four qubits. This is a three-site analogue of states from the $W$-class, which only possess globally distributed pairwise entanglement as measured by the…
This paper extends the recently obtained complete and continuous map of the Lattice Isometry Space (LISP) to the practical case of dimension 3. A periodic 3-dimensional lattice is an infinite set of all integer linear combinations of basis…
It is well-known that the unit cotangent bundle of any Riemannian manifold has a canonical contact structure. A surface in a Riemannian 3-manifold is called a (wave) front if it is the projection of a Legendrian immersion into the unit…
The existence of a nontrivial polynomially convex hull with every point a one-point Gleason part and with no nonzero bounded point derivations is established. This strengthens the \hbox{celebrated} result of Stolzenberg that there exists a…
In a locally finite tiling of n-dim Euclidean space by convex polytopes, each point of the space is either a vertex of at least two tiles, or no vertex at all.
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…
A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number…
We propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.