Related papers: A polynomial time algorithm for solving the closes…
The Voronoi diagram is a certain geometric data structure which has numerous applications in various scientific and technological fields. The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and…
We introduce a new class of spatial-temporal point processes based on Voronoi tessellations. At each step of such a process, a point is chosen at random according to a distribution determined by the associated Voronoi cells. The point is…
A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order $O(n\psi\log(n\psi))$…
Many algorithms in scientific computing and data science take advantage of low-rank approximation of matrices and kernels, and understanding why nearly-low-rank structure occurs is essential for their analysis and further development. This…
Matrix integrals used in random matrix theory for the study of eigenvalues of matrix ensembles have been shown to provide $ \tau $-functions for several hierarchies of integrable equations. In this paper, we construct the matrix integral…
Let $X$ be a totally unimodular list of vectors in some lattice. Let $B_X$ be the box spline defined by $X$. Its support is the zonotope $Z(X)$. We show that any real-valued function defined on the set of lattice points in the interior of…
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the additional algebraic structure of ideal lattices usually makes us worry about the security, and it is widely believed that the algebraic structure…
This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…
Late-interaction models such as ColBERT offer competitive performance across various retrieval tasks but require storing a dense embedding for each document token, leading to a substantial index storage overhead. Past works address this by…
Motivated by Kohno's result on the holonomy Lie algebra of a hyperplane arrangement, we define the holonomy Lie algebra of a finite geometric lattice in a combinatorial way. For a solvable pair of lattices, we show that the holonomy Lie…
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.
In this paper we consider the problem of finding a vector that can be written as a nonnegative integer linear combination of given 0-1 vectors, the generators, such that the l_1-distance between this vector and a given target vector is…
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$…
Minimization diagrams encompass a large class of diagrams of interest in the literature, such as generalized Voronoi diagrams. We develop an abstract perturbation theory and perform a sensitivity analysis for functions depending on sets…
Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system $Vc=b$ where the rows of a square matrix $V$ are constructed by progression of the power polynomials. It has many applications in…
Vector perturbation is an encoding method for broadcast channels in which the transmitter solves a shortest vector problem in a lattice to create a perturbation vector, which is then added to the data before transmission. In this work, we…
We present an algorithm to compute the geodesic $L_1$ farthest-point Voronoi diagram of $m$ point sites in the presence of $n$ rectangular obstacles in the plane. It takes $O(nm+n \log n + m\log m)$ construction time using $O(nm)$ space.…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a number ring) is of particular interest for cryptography and…
In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The…