English
Related papers

Related papers: Sparse bounds for discrete singular Radon transfor…

200 papers

Motivated by applications of large embedding models, we study differentially private (DP) optimization problems under sparsity of individual gradients. We start with new near-optimal bounds for the classic mean estimation problem but with…

Machine Learning · Computer Science 2024-11-01 Badih Ghazi , Cristóbal Guzmán , Pritish Kamath , Ravi Kumar , Pasin Manurangsi

We obtain the complete set of constraints on the moduli of N=4 superstring compactifications that permit "rare" marginal decays of 1/4-BPS dyons to take place. The constraints are analysed in some special cases. The analysis extends in a…

High Energy Physics - Theory · Physics 2009-02-09 Sunil Mukhi , Rahul Nigam

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

Number Theory · Mathematics 2020-02-19 Igor E. Shparlinski , Jose Felipe Voloch

We develop deterministic perturbation bounds for singular values and vectors of orthogonally decomposable tensors, in a spirit similar to classical results for matrices such as those due to Weyl, Davis, Kahan and Wedin. Our bounds…

Numerical Analysis · Mathematics 2022-01-24 Arnab Auddy , Ming Yuan

We study the singularity probability of n*n random matrices with i.i.d. entries from highly biased discrete distributions. We obtain sharp non-asymptotic bounds for this probability and derive estimates on the least singular values. Our…

Probability · Mathematics 2025-12-12 Zeyan Song

Consider the gradient map associated to any non-constant homogeneous polynomial $f\in \C[x_0,...,x_n]$ of degree $d$, defined by \[\phi_f=grad(f): D(f)\to \CP^n, (x_0:...:x_n)\to (f_0(x):...:f_n(x))\] where $D(f)=\{x\in \CP^n; f(x)\neq 0\}$…

Algebraic Geometry · Mathematics 2010-03-10 Imran Ahmed

We prove sharp $L^2$ regularity results for classes of strongly singular Radon transfoms on the Heisenberg group by means of oscillatory integrals. We show that the problem in question can be effectively treated by establishing uniform…

Classical Analysis and ODEs · Mathematics 2007-05-23 Norberto Laghi , Neil Lyall

By means of appropriate sparse bounds, we deduce compactness on weighted $L^p(w)$ spaces, $1<p<\infty$, for all Calder\'on-Zygmund operators having compact extensions on $L^2(\mathbb{R}^n)$. Similar methods lead to new results on…

Classical Analysis and ODEs · Mathematics 2024-07-23 Cody B. Stockdale , Paco Villarroya , Brett D. Wick

We extend Helgason's classical definition of a generalized Radon transform, defined for a pair of homogeneous spaces of an lcsc group $G$, to a broader setting in which one of the spaces is replaced by a possibly non-homogeneous dynamical…

Dynamical Systems · Mathematics 2025-05-12 Michael Björklund , Tobias Hartnick

The approximate discrete Radon transform (ADRT) is a hierarchical multiscale approximation of the Radon transform. In this paper, we factor the ADRT into a product of linear transforms that resemble convolutions and derive an explicit…

Numerical Analysis · Mathematics 2026-01-08 Weilin Li , Karl Otness , Kui Ren , Donsub Rim

We study the Ramsey properties of equations $a_1P(x_1) + \cdots + a_sP(x_s) = b$, where $a_1,\ldots,a_s,b$ are integers, and $P$ is an integer polynomial of degree $d$. Provided there are at least $(1+o(1))d^2$ variables, we show that…

Number Theory · Mathematics 2022-10-11 Jonathan Chapman , Sam Chow

The goal of predictive sparse coding is to learn a representation of examples as sparse linear combinations of elements from a dictionary, such that a learned hypothesis linear in the new representation performs well on a predictive task.…

Machine Learning · Computer Science 2012-10-09 Nishant A. Mehta , Alexander G. Gray

Let $d\geq 3$ be a fixed integer, and a prime number $p$ such that $\gcd(p,d)=1$. Let $A$ be the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. We show that as a random matrix in ${\mathbb F}_p$, \begin{equation}…

Probability · Mathematics 2019-01-01 Jiaoyang Huang

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…

Number Theory · Mathematics 2025-06-17 Daniel Altman , Mehtaab Sawhney

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

Probability · Mathematics 2019-01-01 Jiaoyang Huang

We consider the discrete nonlinear Schr{\"o}dinger equations on a one dimensional lattice of mesh h, with a cubic focusing or defocusing nonlinearity. We prove a polynomial bound on the growth of the discrete Sobolev norms, uniformly with…

Numerical Analysis · Mathematics 2018-11-07 Joackim Bernier

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.

Mathematical Physics · Physics 2007-05-23 Christian Mercat

Superderivations for the eight families of finite or infinite dimensional graded Lie superalgebras of Cartan-type over a field of characteristic $p>3$ are completely determined by a uniform approach: The infinite dimensional case is reduced…

Rings and Algebras · Mathematics 2018-08-13 Wei Bai , Wende Liu

We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…

Computational Complexity · Computer Science 2007-05-23 Peter Buergisser , Martin Lotz

In this paper, we propose two new deterministic interpolation algorithms for a sparse multivariate polynomial given as a standard black-box by introducing new Kronecker type substitutions. Let $f\in \RB[x_1,\dots,x_n]$ be a sparse black-box…

Symbolic Computation · Computer Science 2018-08-09 Qiao-Long Huang , Xiao-Shan Gao