Related papers: Generalized flatness constants, spanning lattice p…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
Consider a convex polygon P in the plane, and denote by U a homothetical copy of the vector sum of P and (-P). Then the polygon U, as unit ball, induces a norm such that, with respect to this norm, P has constant Minkowskian width. We…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
In this paper, we investigate two properties concerning the unimodality of the $\delta$-vectors of lattice polytopes, which are log-concavity and alternatingly increasingness. For lattice polytopes $\mathcal{P}$ of dimension $d$, we prove…
We study the inflated phase of two dimensional lattice polygons, both convex and column-convex, with fixed area A and variable perimeter, when a weight \mu^t \exp[- Jb] is associated to a polygon with perimeter t and b bends. The mean…
This paper contains a new concept to measure the width and thickness of a convex body in the hyperbolic plane. We compare the known concepts with the new one and prove some results on bodies of constant width, constant diameter and given…
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which the edges of the graph are not allowed to cross. Given an arbitrary convex shape $C$, a constrained Delaunay graph is constructed by adding…
Random simplices and more general random convex bodies of dimension $p$ in $\mathbb{R}^n$ with $p\leq n$ are considered, which are generated by random vectors having an elliptical distribution. In the high-dimensional regime, that is, if…
The mean width is a measure on n-dimensional convex bodies. An integral formula for the mean width of a regular n-simplex appeared in the electrical engineering literature in 1997. As a consequence, expressions for the expected range of a…
This survey is an introduction to the geometry of co-Minkowksi space, the space of unoriented spacelike hyperplanes of the Minkowski space. Affine deformations of cocompact lattices of hyperbolic isometries act on it, in a way similar to…
A generalized complex structure is called stable if its defining anticanonical section vanishes transversally, on a codimension-two submanifold. Alternatively, it is a zero elliptic residue symplectic structure in the elliptic tangent…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of $d/2$ in dimension $d$, achieved by the "standard terminal simplices" and direct sums of them. We prove…
We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…
We propose a polynomial force-motion model for planar sliding. The set of generalized friction loads is the 1-sublevel set of a polynomial whose gradient directions correspond to generalized velocities. Additionally, the polynomial is…
Following on from a general observation in an earlier paper, we consider the continuous symmetries of a certain class of conformal field theories constructed from lattices and their reflection-twisted orbifolds. It is shown that the naive…
We construct, for each convex polytope, possibly nonrational and nonsimple, a family of compact spaces that are stratified by quasifolds, i.e. each of these spaces is a collection of quasifolds glued together in an suitable way. A quasifold…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
Symmetries are known to dictate important physical properties and can be used as a design principle in particular in wave physics, including wave structures and the resulting propagation dynamics. Local symmetries, in the sense of a…
This paper studies the configuration spaces of linkages whose underlying graph is a single cycle. Assume that the edge lengths are such that there are no configurations in which all the edges lie along a line. The main results are that,…