Related papers: Module Lattice Security (Part III): Structured CVP…
This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connected dominating set (MCDS) problem. The presented algorithm finds an $O(\log n)$ approximation in $\tilde{O}(D+\sqrt{n})$ rounds, where $D$…
The moduli space dynamics of vortices in the Jackiw-Pi model where a non-relativistic Schrodinger field couples minimally to Chern-Simons gauge field, is considered. It is shown that the difficulties in direct application of Manton's method…
The geodesic Voronoi diagram of m point sites inside a simple polygon of n vertices is a subdivision of the polygon into m cells, one to each site, such that all points in a cell share the same nearest site under the geodesic distance. The…
Constrained devices, such as smart sensors, wearable devices, and Internet of Things nodes, are increasingly prevalent in society and rely on secure communications to function properly. These devices often operate autonomously, exchanging…
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…
A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…
We extend the theory of logarithmic Voronoi cells to Gaussian statistical models. In general, a logarithmic Voronoi cell at a point on a Gaussian model is a convex set contained in its log-normal spectrahedron. We show that for models of ML…
We show that the shadow vertex algorithm can be used to compute a short path between a given pair of vertices of a polytope P = {x : Ax \leq b} along the edges of P, where A \in R^{m \times n} is a real-valued matrix. Both, the length of…
The mean field vortex phase diagram of a quasi two dimensional superconductor with a nodal d-wave pairing and with strong Pauli spin depairing is examined in the parallel field case in order to examine an effect of gap nodes (or minima) on…
An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Also, the…
We study the vortex distribution of the wave functions minimizing the Gross Pitaevskii energy for a fast rotating condensate in the Lowest Landau Level (LLL): we prove that the minimizer cannot have a finite number of zeroes thus the…
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…
In an earlier paper (math.NT/9906019) we showed that any integral unimodular lattice L of rank n which is not isometric with Z^n has a characteristic vector of norm at most n-8. [A "characteristic vector" of L is a vector w in L such that…
We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the…
We investigate the problem of computing the shortest secure path in a Voronoi diagram. Here, a path is secure if it is a sequence of touching Voronoi cells, where each Voronoi cell in the path has a uniform cost of being secured.…
Unified theories such as string theory and loop quantum gravity allow the Lorentz Invariance Violation (LIV) at the Planck Scale ($M_P \sim 10^{19}$ GeV). Using an effective field theory, this effect can be observed at low energies in terms…
In [8], the affine vertex algebra $L_k(\mathfrak{sl}_2)$ is realized as a subalgebra of the vertex algebra $Vir_c \otimes \Pi(0)$, where $Vir_c$ is a simple Virasoro vertex algebra and $\Pi(0)$ is a half-lattice vertex algebra. Moreover,…
Lattice-based cryptography has emerged as one of the most prominent candidates for post-quantum cryptography, projected to be secure against the imminent threat of large-scale fault-tolerant quantum computers. The Shortest Vector Problem…
In recent studies \cite{ZZ24, FY24}, the Interior Penalty Virtual Element Method (IPVEM) has been developed for solving a fourth-order singular perturbation problem, with uniform convergence established in the lowest-order case concerning…
In this article, we study the approximate solutions set $\Lambda_b$ of an inconsistent system of $\max-\min$ fuzzy relational equations $(S): A \Box_{\min}^{\max}x =b$. Using the $L_\infty$ norm, we compute by an explicit analytical formula…