Related papers: Empty simplices of large width

A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…

We present a new model which represents data as a mixture of simplices. Simplices are geometric structures that generalize triangles. We give a simple geometric understanding that allows us to learn a simplicial structure efficiently. Our…

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

We establish sharp asymptotic estimates for the diameter of primitive zonotopes when their dimension is fixed. We also prove that, for infinitely many integers $k$, the largest possible diameter of a lattice zonotope contained in the…

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…

We construct non-constructible simplicial $d$-spheres with $d+10$ vertices and non-constructible, non-realizable simplicial $d$-balls with $d+9$ vertices for $d\geq 3$.

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…

In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…

For each dimension $d$, $d$-dimensional integral simplices with exactly one interior integral point have bounded volume. This was first shown by Hensley. Explicit volume bounds were determined by Hensley, Lagarias and Ziegler, Pikhurko, and…

We give a construction for the d-dimensional simplices with all distances in {1,2} from the set of partitions of d+1.

There exist as many index-$k$ sublattices of the hexagonal lattice up to isometry as there exist lattice triangles with normalized volume $k$ up to unimodular equivalence, which can be explained using orbifolds. In dimension 3, it was noted…

In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…

We establish new results concerning endomorphisms of a finite chain if the cardinality of the image of such endomorphism is no more than some fixed number. The semiring of all such endomorphisms can be seen as a simplex whose vertices are…

Makeev conjectured that every constant-width body is inscribed in the dual difference body of a regular simplex. We prove that homologically, there are an odd number of such circumscribing bodies in dimension 3, and therefore geometrically…

These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an \emph{introduction} and \emph{invitation}. Rather than heading for an extensive survey on 0/1-polytopes I present some interesting aspects of these objects;…

We investigate the role of a specifically warped extra dimension in constructing examples of higher dimensional spacetimes representing Lorentzian wormholes. The warping chosen is largely inspired by the well-known non-static Witten bubble…

In this short note, we show by elementary computations that the notion of non-Archimedean fuzzy normed (and 2-normed) spaces is void. Namely, there are no strictly convex spaces at all --not even the zero-dimensional linear space. Before…

My main results are simple formulas for the surface area of d-dimensional lattice polytopes using Ehrhart theory.

We present an extremely elementary construction of the simple Lie algebras over the complex numbers in all of their minuscule representations, using the vertices of various polytopes. The construction itself requires no complicated…