Related papers: Effective module lattices and their shortest vecto…
We show that the sequential closure of a family of probability measures on the canonical space of c{\`a}dl{\`a}g paths satisfying Stricker's uniform tightness condition is a weak${}^*$ compact set of semimartingale measures in the pairing…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…
In this papar, we point out some mistakes in a proof of an important combinatorial property of $S(\mathbb{A}_n)$, the set of all minimal vectors of lattice $\mathbb{A}_n$, and correct them in the last section. This property plays an…
Submodularity is a key property in discrete optimization. Submodularity has been widely used for analyzing the greedy algorithm to give performance bounds and providing insight into the construction of valid inequalities for mixed-integer…
We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis-Laarhoven-De Weger [PQCrypto, 2019] of determining…
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 show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph.
In this paper, we study the restricted isometry property of partial random circulant matrices. For a bounded subgaussian generator with independent entries, we prove that the partial random circulant matrices satisfy $s$-order RIP with high…
Potts models, which can be used to analyze dependent observations on a lattice, have seen widespread application in a variety of areas, including statistical mechanics, neuroscience, and quantum computing. To address the intractability of…
A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…
We introduce here a rewrite system in the group of unimodular matrices, \emph{i.e.}, matrices with integer entries and with determinant equal to $\pm 1$. We use this rewrite system to precisely characterize the mechanism of the Gaussian…
In this paper we describe an algorithm for classifying orbits of vectors in Lorentzian lattices. The main point of this is that isomorphism classes of positive definite lattices in some genus often correspond to orbits of vectors in some…
We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…
This paper studies the problem of selecting a submatrix of a positive definite matrix in order to achieve a desired bound on the smallest eigenvalue of the submatrix. Maximizing this smallest eigenvalue has applications to selecting input…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
We describe the absolute retracts for the following classes of finite lattices: (1) slim semimodular lattices, (2) finite distributive lattices, and for each positive integer $n$, (3) at most $n$-dimensional finite distributive lattices.…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
It is proved that localizations of injective $R$-modules of finite Goldie dimension are injective if $R$ is an arithmetical ring satisfying the following condition: for every maximal ideal $P$, $R_P$ is either coherent or not semicoherent.…
It is proved that localizations of injective $R$-modules of finite Goldie dimension are injective if $R$ is an arithmetical ring satisfying the following condition: for every maximal ideal $P$, $R_P$ is either coherent or not semicoherent.…
In the present paper we study a non-modular variant of the Short Integer Solution problem over the integers. Given a random matrix $A \in \mathbb{Z}^{n\times m}$ with entries $a_{ij}$ such that $0\le a_{ij}< Q,$ for some $Q>0,$ the goal is…