Related papers: Logarithmic Voronoi polytopes for discrete linear …
We describe the development of a new software tool, called "Pomelo", for the calculation of Set Voronoi diagrams. Voronoi diagrams are a spatial partition of the space around the particles into separate Voronoi cells, e.g. applicable to…
We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of…
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…
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…
Given two sets of training samples, general method is to estimate the density function and classify the test sample according to higher values of estimated densities. Natural way to estimate the density should be histogram tending to…
We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type $B_d$. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension $d$ whose…
A preconditioning strategy is proposed for the iterative solve of large numbers of linear systems with parameter-dependent matrix and right-hand side which arise during the computation of solution statistics of stochastic elliptic partial…
Many physical systems can be studied as collections of particles embedded in space, evolving through deterministic evolution equations. Natural questions arise concerning how to characterize these arrangements - are they ordered or…
We study the differential structure of the set of real logarithms of a non-singular real matrix, under the assumption that the matrix is either semi-simple or orthogonal.
We establish a local model for the moduli space of holomorphic symplectic structures with logarithmic poles, near the locus of structures whose polar divisor is normal crossings. In contrast to the case without poles, the moduli space is…
There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…
When the standard representation of a crystallographic Coxeter group G (with string diagram) is reduced modulo the integer d>1, one obtains a finite group G^d which is often the automorphism group of an abstract regular polytope. Building…
We study planar "vertex" models, which are probability measures on edge subsets of a planar graph, satisfying certain constraints at each vertex, examples including dimer model, and 1-2 model, which we will define. We express the local…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…
A Gorenstein polytope of index r is a lattice polytope whose r-th dilate is a reflexive polytope. These objects are of interest in combinatorial commutative algebra and enumerative combinatorics, and play a crucial role in Batyrev's and…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing to encode such structures into labeled maps with a…
We derive formulae for the calculation of Taylor coefficients of solutions to systems of Volterra integral equations, both linear and nonlinear, either without singularities or with singularities of Abel type and logarithmic type. We also…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…