Related papers: Module Lattice Security (Part III): Structured CVP…
B\o gvad and H\"agg proved that for a rational function with simple poles, the zeros of successive derivatives accumulate on the Voronoi diagram of the pole set, and the normalized zero-counting measures converge to a canonical probability…
In this article, we investigate vacuum leakage detection problems in composite manufacturing. Our approach uses Voronoi diagrams, a well-known structure in discrete geometry. The Voronoi diagram of the vacuum connection positions partitions…
We show improved fine-grained hardness of two key lattice problems in the $\ell_p$ norm: Bounded Distance Decoding to within an $\alpha$ factor of the minimum distance ($\mathrm{BDD}_{p, \alpha}$) and the (decisional) $\gamma$-approximate…
The paper is concerned with interacting particle systems on the simple cubic lattice obeying the nearest neighbour exclusion (NNE). This constraint forbids any two neighbouring sites of the lattice to be simultaneously occupied, thus…
We prove a highly uniform stability or "almost-near" theorem for dual lattices of lattices $L \subseteq \Bbb R^n$. More precisely, we show that, for a vector $x$ from the linear span of a lattice $L \subseteq \Bbb R^n$, subject to…
Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix $M$, the goal is to compute a matrix $M'$ of given rank $r$ in a linear or affine…
We present a quenched lattice study of the form factors $f_+(q^2)$ and $f_0(q^2)$ of the matrix elements $<\pi | \bar{s} \gamma_\mu u | K >$. We focus on the second-order SU(3)-breaking quantity $[1 - f_+(0)]$, which is necessary to extract…
We show that a constant factor approximation of the shortest and closest lattice vector problem w.r.t. any $\ell_p$-norm can be computed in time $2^{(0.802 +{\epsilon})\, n}$. This matches the currently fastest constant factor approximation…
The Capacitated Vehicle Routing Problem (CVRP) is one of the most extensively studied problems in combinatorial optimization. Based on customer demand, we distinguish three variants of CVRP: unit-demand, splittable, and unsplittable. In…
The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $\omega(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be…
We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…
Non-perturbatively computing the hadronic vacuum polarization at large photon virtualities and making contact with perturbation theory enables a precision determination of the electromagnetic coupling at the $Z$ pole, which enters global…
We focus on BPS solutions of the gauged O(3) Sigma model, due to Schroers, and use these ideas to study the geometry of the moduli space. The model has an asymmetry parameter $\tau$ breaking the symmetry of vortices and antivortices on the…
We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an…
We present a comprehensive study of vortex structures in $d$-wave superconductors from large-scale renormalized mean-field theory of the square-lattice $t$-$t'$-$J$ model, which has been shown to provide a quantitative modeling for…
In this paper we study local error bound moduli for a locally Lipschitz and regular function via its outer limiting subdifferential set. We show that the distance of 0 from the outer limiting subdifferential of the support function of the…
Effective transport properties of heterogeneous structures are predicted by geometric microstructural parameters, but these can be difficult to calculate. Here, a boundary element code with a recurrent series method accurately and…
Given a set C in R^d, let p(C) be the probability that a random d-dimensional unimodular lattice, chosen according to Haar measure on SL(d,Z)\SL(d,R), is disjoint from C\{0}. For special convex sets C we prove bounds on p(C) which are sharp…
The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…
We present the first nearly optimal differentially private PAC learner for any concept class with VC dimension 1 and Littlestone dimension $d$. Our algorithm achieves the sample complexity of…