English
Related papers

Related papers: Effective module lattices and their shortest vecto…

200 papers

Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…

Number Theory · Mathematics 2022-01-14 Michael Björklund , Alexander Gorodnik

We extend the CDPR lattice reduction algorithm from ideal to module lattices, leveraging the trace orthogonality of the power basis to decompose the module into rank-1 submodules and applying CDPR independently to each. This base module…

Cryptography and Security · Computer Science 2026-04-28 Ming-Xing Luo

The existence of unimodular forms with small norms on sequence spaces is crucial in a variety of problems in modern analysis. We prove that the infimum of $\left\Vert A\right\Vert $ over all unimodular $d$-linear (complex or real) forms $A$…

Functional Analysis · Mathematics 2019-12-16 Nacib Gurgel Albuquerque , Lisiane Rezende

We consider connections between similar sublattices and coincidence site lattices (CSLs), and more generally between similar submodules and coincidence site modules of general (free) $\mathbb{Z}$-modules in $\mathbb{R}^d$. In particular, we…

Number Theory · Mathematics 2023-07-19 Peter Zeiner

We prove that the very simple lattices which consist of a largest, a smallest and $2n$ pairwise incomparable elements where $n$ is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite…

Operator Algebras · Mathematics 2009-05-09 Feng Xu

Learned index structures aim to accelerate queries by training machine learning models to approximate the rank function associated with a database attribute. While effective in practice, their theoretical limitations are not fully…

Data Structures and Algorithms · Computer Science 2026-01-13 Luis Alberto Croquevielle , Roman Sokolovskii , Thomas Heinis

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Numerical Analysis · Mathematics 2014-05-16 John T. Holodnak , Ilse C. F. Ipsen

We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…

Combinatorics · Mathematics 2017-02-20 Michael von Thaden , Winfried Bruns

The Betke-Henk-Wills conjecture proposes a sharp upper bound for the lattice point enumerator $G(K, \Lambda)$ of a convex body in terms of its successive minima. While the conjecture remains open for general convex bodies in dimensions $d…

General Mathematics · Mathematics 2026-02-12 Chao Wang

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…

Number Theory · Mathematics 2018-08-16 Martin Vodička , Pavol Zlatoš

In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…

Machine Learning · Computer Science 2020-06-25 Luis A. Lastras

We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…

Numerical Analysis · Mathematics 2019-08-15 Josef Dick , Friedrich Pillichshammer , Kosuke Suzuki , Mario Ullrich , Takehito Yoshiki

In this paper, we relate the framework of mod-$\phi$ convergence to the construction of approximation schemes for lattice-distributed random variables. The point of view taken here is that of Fourier analysis in the Wiener algebra, allowing…

Probability · Mathematics 2020-07-06 Reda Chhaibi , Freddy Delbaen , Pierre-Loïc Méliot , Ashkan Nikeghbali

In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that…

Discrete Mathematics · Computer Science 2008-05-15 Genta Ito

In this paper, we give several asymptotic formulas for the number of multiplicatively dependent vectors of algebraic numbers of fixed degree, or within a fixed number field, and bounded height.

Number Theory · Mathematics 2016-06-10 Francesco Pappalardi , Min Sha , Igor E. Shparlinski , Cameron L. Stewart

We obtain effective bounds on the heights of algebraic integers whose orbits contain multiplicatively dependent values modulo S-integers. Our method is based on a new upper bound on the so-called S-height of polynomial values over the ring…

Number Theory · Mathematics 2020-01-28 Ray Li , Igor E. Shparlinski

The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices…

Data Structures and Algorithms · Computer Science 2020-06-22 Sebastian Berndt , Klaus Jansen , Kim-Manuel Klein

We give degree lower bounds for quotient line bundles of the lowest piece of a Hodge module induced by a complex variation of Hodge structures outside a simple normal crossing divisor, beyond the unipotent variation case. This note aims to…

Algebraic Geometry · Mathematics 2026-05-14 Ze Yun

A discrete set in the $p$-dimensional Euclidian space is {\it almost periodic}, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We propose to construct positive almost periodic discrete sets…

Metric Geometry · Mathematics 2010-02-02 S. Favorov , Ye. Kolbasina

We consider a notion of probabilistic rank and probabilistic sign-rank of a matrix, which measures the extent to which a matrix can be probabilistically represented by low-rank matrices. We demonstrate several connections with matrix…

Computational Complexity · Computer Science 2018-02-01 Josh Alman , Ryan Williams