English
Related papers

Related papers: On sparse geometry of numbers

200 papers

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…

Number Theory · Mathematics 2007-05-23 Noam D. Elkies

To every $n$-dimensional lens space $L$, we associate a congruence lattice $\mathcal L$ in $\mathbb Z^m$, with $n=2m-1$ and we prove a formula relating the multiplicities of Hodge-Laplace eigenvalues on $L$ with the number of lattice…

Differential Geometry · Mathematics 2016-07-20 Emilio A. Lauret , Roberto J. Miatello , Juan Pablo Rossetti

We consider the problem of sparsity testing in the high-dimensional linear regression model. The problem is to test whether the number of non-zero components (aka the sparsity) of the regression parameter $\theta^*$ is less than or equal to…

Statistics Theory · Mathematics 2020-04-24 Alexandra Carpentier , Nicolas Verzelen

As a popular tool for producing meaningful and interpretable models, large-scale sparse learning works efficiently when the underlying structures are indeed or close to sparse. However, naively applying the existing regularization methods…

Methodology · Statistics 2017-10-10 Zemin Zheng , Jinchi Lv , Wei Lin

Motivated by problems in optimization we study the sparsity of the solutions to systems of linear Diophantine equations and linear integer programs, i.e., the number of non-zero entries of a solution, which is often referred to as the…

Optimization and Control · Mathematics 2020-08-06 Iskander Aliev , Gennadiy Averkov , Jesús A. De Loera , Timm Oertel

For multiple index models, it has recently been shown that the sliced inverse regression (SIR) is consistent for estimating the sufficient dimension reduction (SDR) space if and only if $\rho=\lim\frac{p}{n}=0$, where $p$ is the dimension…

Statistics Theory · Mathematics 2018-06-19 Qian Lin , Zhigen Zhao , Jun S. Liu

The similar sublattices of a planar lattice can be classified via its multiplier ring. The latter is the ring of rational integers in the generic case, and an order in an imaginary quadratic field otherwise. Several classes of examples are…

Metric Geometry · Mathematics 2019-08-15 Michael Baake , Rudolf Scharlau , Peter Zeiner

We give a short argument that yields a new lower bound on the number of subsampled rows from a bounded, orthonormal matrix necessary to form a matrix with the restricted isometry property. We show that a matrix formed by uniformly…

Information Theory · Computer Science 2023-05-10 Jarosław Błasiok , Patrick Lopatto , Kyle Luh , Jake Marcinek , Shravas Rao

Orders in number fields provide natural examples of lattices. We ask: what can the successive minima of lattices arising from orders in number fields be? Given an order $\mathcal{O}$ of absolute discriminant $\Delta$ in a degree $n$ number…

Number Theory · Mathematics 2025-07-08 Sameera Vemulapalli

The aim of this paper is to study lattice properties of the sharp partial order for complex matrices having index at most 1. We investigate the down-set of a fixed matrix $B$ under this partial order via isomorphisms with two different…

Rings and Algebras · Mathematics 2024-12-30 Cecilia R. Cimadamore , Laura A. Rueda , Néstor Thome , Melina V. Verdecchia

Let $\Lambda$ be a lattice in $\R^n$, and let $Z\subseteq \R^{m+n}$ be a definable family in an o-minimal structure over $\R$. We give sharp estimates for the number of lattice points in the fibers $Z_T={x\in \R^n: (T,x)\in Z}$. Along the…

Number Theory · Mathematics 2013-04-30 Fabrizio Barroero , Martin Widmer

A vector space S of linear operators between finite-dimensional vector spaces U and V is called locally linearly dependent (in abbreviate form: LLD) when every vector x in U is annihilated by a non-zero operator in S. By a duality argument,…

Rings and Algebras · Mathematics 2015-09-01 Clément de Seguins Pazzis

Let $\Phi\in\mathbb{R}^{m\times n}$ be a sparse Johnson-Lindenstrauss transform [KN14] with $s$ non-zeroes per column. For a subset $T$ of the unit sphere, $\varepsilon\in(0,1/2)$ given, we study settings for $m,s$ required to ensure $$…

Data Structures and Algorithms · Computer Science 2015-08-27 Jean Bourgain , Sjoerd Dirksen , Jelani Nelson

We conjecture an integrability and linearizability test for dispersive Z^2-lattice equations by using a discrete multiscale analysis. The lowest order secularity conditions from the multiscale expansion give a partial differential equation…

Mathematical Physics · Physics 2008-01-24 Rafael Hernandez Heredero , Decio Levi , Matteo Petrera , Christian Scimiterna

The Johnson-Lindenstrauss (JL) theorem states that a set of points in high-dimensional space can be embedded into a lower-dimensional space while approximately preserving pairwise distances with high probability Johnson and Lindenstrauss…

Data Structures and Algorithms · Computer Science 2026-01-01 Pierre Mackenzie

We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…

Number Theory · Mathematics 2025-11-05 Lenny Fukshansky , Evelyne Knight

This paper deals with the following question: Suppose that there exist an integer or a non-negative integer solution $x$ to a system $Ax = b$, where the number of non-zero components of $x$ is $n$. The target is, for a given natural number…

Optimization and Control · Mathematics 2026-02-12 Stefan Kuhlmann , Timm Oertel , Robert Weismantel

We consider some distinguished classes of elements of a multiplicative lattice endowed with coarse lower topologies, and call them lower spaces. The primary objective of this paper is to study the topological properties of these lower…

Rings and Algebras · Mathematics 2024-07-08 Amartya Goswami

This paper considers a large class of problems where we seek to recover a low rank matrix and/or sparse vector from some set of measurements. While methods based on convex relaxations suffer from a (possibly large) estimator bias, and other…

Machine Learning · Statistics 2021-09-28 April Sagan , John E. Mitchell

We study sparse group Lasso for high-dimensional double sparse linear regression, where the parameter of interest is simultaneously element-wise and group-wise sparse. This problem is an important instance of the simultaneously structured…

Statistics Theory · Mathematics 2022-05-10 T. Tony Cai , Anru R. Zhang , Yuchen Zhou