Related papers: Logarithmic Voronoi polytopes for discrete linear …
Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We study the homotopy groups of generic leaves of logarithmic foliations on complex projective manifolds. We exhibit a relation between the homotopy groups of a generic leaf and of the complement of the polar divisor of the logarithmic…
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,…
We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry…
We introduce higher rank inner products on real and complex vector spaces and study their corresponding Voronoi tilings. We use the framework to describe metric degenerations of polarized tori and Hausdorff limits of Voronoi tilings of…
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…
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…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
Vertical-arrow fluctuations near the boundaries in the six-vertex model on the two-dimensional $N \times N$ square lattice with the domain wall boundary conditions are considered. The one-point correlation function (`boundary polarization')…
The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…
Pick $d+1$ points uniformly at random on the unit sphere in $\mathbb R^d$. What is the expected value of the angle sum of the simplex spanned by these points? Choose $n$ points uniformly at random in the $d$-dimensional ball. What is the…
We describe dualities and complexes of logarithmic forms and differentials for central affine and corresponding projective arrangements. We generalize the Borel-Serre formula from vector bundles to sheaves on projective d-space with locally…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We consider the monodromy group of the differential systems for multiloop integrals. We describe a simple heuristic method to obtain the monodromy matrices as functions of space-time dimension $d$. We observe that in a special basis the…
Voronoi tessellations are used to partition the Euclidean space into polyhedral regions, which are called Voronoi cells. Labeling the Voronoi cells with the class information, we can map any classification problem into a Voronoi…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
We prove the second Voronoi conjecture on parallelohedra for zonotope. We show that for a given face-to-face tiling of d-dimensional Euclidean space into parallel copies of zonotope Z there are d vectors, connecting centers of zonotopes…
We study algorithms and combinatorial complexity bounds for \emph{stable-matching Voronoi diagrams}, where a set, $S$, of $n$ point sites in the plane determines a stable matching between the points in $\mathbb{R}^2$ and the sites in $S$…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…