Related papers: Logarithmic Voronoi cells
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…
Let $p(z)$ be a monic cubic complex polynomial with distinct roots and distinct critical points. We say a critical point has the {\it Voronoi property} if it lies in the Voronoi cell of a root $\theta$, $V(\theta)$, i.e. the set of points…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
Given a simple finite-dimensional Lie algebra and an automorphism of finite order, one defines the notion of a twisted toroidal Lie algebra. In this paper, we construct representations of twisted toroidal Lie algebras from twisted modules…
Main purpose of this work is to introduce a general technique of projection of the Voronoi tessellation of the weight lattice $A_n^\ast$ and apply it for the lattice $A_4^\ast$. The projection of the Voronoi tessellation of the weight…
We give criteria for finite dimensionality or infinite dimensionality of the polynomial centralizer of the Lie algebra of a linear Lie group, in terms of invariants and relative invariants of the group. In the finite dimensional scenario…
The codegree of a lattice polytope is the smallest integer dilate that contains a lattice point in the relative interior. The weak maximum likelihood threshold of a statistical model is the smallest number of data points for which there is…
Twisted modules over vertex algebras formalize the relations among twisted vertex operators and have applications to conformal field theory and representation theory. A recent generalization, called twisted logarithmic module, involves the…
Topologically stable cellular partitions of D dimensional spaces are studied. A complete statistical description of the average structural properties of such partition is given in term of a sequence of D/2-1 (or (D-1)/2) variables for D…
The Voronoi tessellation is the partition of space for a given seeds pattern and the result of the partition depends completely on the type of given pattern "random", Poisson-Voronoi tessellations (PVT), or "non-random", Non Poisson-Voronoi…
The forward and reverse Funk weak metrics are fundamental distance functions on convex bodies that serve as the building blocks for the Hilbert and Thompson metrics. In this paper we study Voronoi diagrams under the forward and reverse Funk…
Irregular arrangements of vesicles filled with excitable and precipitating chemical systems are imitated by Voronoi automata --- finite-state machines defined on a planar Voronoi diagram. Every Voronoi cell takes four states: resting,…
For a finite dimensional Frobenius cellular algebra, a sufficient and necessary condition for a simple cell module to be projective is given. A special case that dual bases of the cellular basis satisfying a certain condition is also…
We prove a Voronoi formula for coefficients of a large class of $L$-functions including Maass cusp forms, Rankin-Selberg convolutions, and certain isobaric sums. Our proof is based on the functional equations of $L$-functions twisted by…
Voronoi Tessellations form an attractive and versatile geometrical asymptotic model for the foamlike cosmic distribution of matter and galaxies. In the Voronoi model the vertices are identified with clusters of galaxies. For a substantial…
Consider a finite connected graph possibly with multiple edges and loops. In discrete geometric analysis, Kotani and Sunada constructed the crystal associated to the graph as a standard realization of the maximal abelian covering of the…
Given a set of sites in a simple polygon, a geodesic Voronoi diagram of the sites partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point,…
We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…
Mimicking natural tessellation patterns is a fascinating multi-disciplinary problem. Geometric methods aiming at reproducing such partitions on surface meshes are commonly based on the Voronoi model and its variants, and are often faced…
In this thesis we study sets of points in the plane and their Voronoi diagrams, in particular when the points coincide. We bring together two ways of studying point sets that have received a lot of attention in recent years: Voronoi…