Related papers: Logarithmic Voronoi polytopes for discrete linear …
We study the geometry of centrally-symmetric random polytopes, generated by $N$ independent copies of a random vector $X$ taking values in $\mathbb{R}^n$. We show that under minimal assumptions on $X$, for $N \gtrsim n$ and with high…
Voronoi constellations (VCs) are finite sets of vectors of a coding lattice enclosed by the translated Voronoi region of a shaping lattice, which is a sublattice of the coding lattice. In conventional VCs, the shaping lattice is a scaled-up…
We achieve a detailed understanding of the $n$-sided planar Poisson-Voronoi cell in the limit of large $n$. Let ${p}\_n$ be the probability for a cell to have $n$ sides. We construct the asymptotic expansion of $\log {p}\_n$ up to terms…
Existence, stability and dynamics of soliton complexes, centered at the site of a single transverse link connecting two parallel 2D (two-dimensional) lattices, are investigated. The system with the on-site cubic self-focusing nonlinearity…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
We present a dynamical systems approach for geometric matchings in an ensemble of polytopes along rigid-body motions. Each polytope can be characterized by a vertex set and edge or faces determined by vertices, and polygons and simplexes…
This research will be helpful for people to display the 2-dimensiona projective models of 4-variable actual problems in many fields, in order to investigate deeply those actual problems. By using the theory of N-dimensional finite rotation…
We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
This article presents an algorithm to compute digital images of Voronoi, Johnson-Mehl or Laguerre diagrams of a set of punctual sites, in a domain of a Euclidean space of any dimension. The principle of the algorithm is, in a first step, to…
The Poincar\'e polynomial of a Weyl group calculates the Betti numbers of the projective homogeneous space $G/B$, while the $h$-vector of a simple polytope calculates the Betti numbers of the corresponding rationally smooth toric variety.…
Higher-order Voronoi diagrams and Delaunay mosaics in polygonal metrics have only recently been studied, yet no tools exist for visualizing them. We introduce a tool that fills this gap, providing dynamic interactive software for…
We study the structure of higher-order Voronoi cells on a discrete set of sites in $\mathbb{R}^n$, focussing on the relations between cells of different order, and paying special attention to the ill-posed case when a large number of points…
This paper has two purposes. The first is to extend the theory of linearly distributive categories by considering the structures that emerge in a special case: the normal duoidal category $(\mathsf{Poly} ,\mathcal{y}, \otimes, \triangleleft…
Given a set of $n$ sites from $\mathbb{R}^d$, each having some positive weight factor, the Multiplicatively Weighted Voronoi Diagram is a subdivision of space that associates each cell to the site whose weighted Euclidean distance is…
We consider an hierarchy of integrable 1+2-dimensional equations related to Lie algebra of the vector fields on the line. The solutions in quadratures are constructed depending on $n$ arbitrary functions of one argument. The most…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
Cells of Voronoi diagrams in two dimensions are usually considered as having edges of zero width. However, this is not the case in several experimental situations in which the thickness of the edges of the cells is relatively large. In this…
It is shown that the area of Voronoi cells for a generalized Archimedean spiral lattice converges under some scale normalization, if the angle parameter is badly approximable.
Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…