English
Related papers

Related papers: A sparse quadratic $T1$ theorem

200 papers

We show that if an operator T is bounded on weighted Lebesgue space L^2(w) and obeys a linear bound with respect to the A_2 constant of the weight, then its commutator [b,T] with a function b in BMO will obey a quadratic bound with respect…

Classical Analysis and ODEs · Mathematics 2011-03-10 Daewon Chung , Cristina Pereyra , Carlos Perez

The article proves an assertion analogous to the Littlewood-Paley theorem for the orthoprojectors onto wavelet subspaces corresponding to the multidimensional multiresolution analysis generated as tensor product of smooth finite scaling…

Classical Analysis and ODEs · Mathematics 2012-04-10 S. N. Kudryavtsev

This is an earlier, but more general, version of "An L^1 Ergodic Theorem for Sparse Random Subsequences". We prove an L^1 ergodic theorem for averages defined by independent random selector variables, in a setting of general…

Dynamical Systems · Mathematics 2008-12-17 Patrick LaVictoire

We introduce a new type of test for complete spatial randomness that applies to mapped point patterns in a rectangle or a cube of any dimension. This is the first test of its kind to be based on characteristic functions and utilizes a…

Methodology · Statistics 2025-09-23 Yiran Zeng , Dale L. Zimmerman

We extend Lerner's recent approach to sparse domination of Calder\'on--Zygmund operators to upper doubling (but not necessarily doubling), geometrically doubling metric measure spaces. Our domination theorem is different from the one…

Classical Analysis and ODEs · Mathematics 2019-04-05 Alexander Volberg , Pavel Zorin-Kranich

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li

We give an affirmative answer to a question due to M. Megrelishvili, and show that for every locally compact group $G$ we have $\operatorname{Tame}(L^{1}(G)) = \operatorname{Tame}(G)$, which means that a functional is tame over $L^{1}(G)$…

Functional Analysis · Mathematics 2025-02-28 Matan Komisarchik

This paper investigates the theoretical guarantees of L1-analysis regularization when solving linear inverse problems. Most of previous works in the literature have mainly focused on the sparse synthesis prior where the sparsity is measured…

Information Theory · Computer Science 2012-10-03 Samuel Vaiter , Gabriel Peyré , Charles Dossal , Jalal Fadili

Let $p(\cdot):\ \mathbb R^n\to(0,\infty)$ be a measurable function satisfying some decay condition and some locally log-H\"older continuity. In this article, via first establishing characterizations of the variable exponent Hardy space…

Classical Analysis and ODEs · Mathematics 2014-11-21 Ciqiang Zhuo , Dachun Yang , Yiyu Liang

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such…

Combinatorics · Mathematics 2017-06-07 Brian Cook , Ákos Magyar , Malabika Pramanik

If $S$ is a smooth compact surface in $\mathbb{R}^3$ with strictly positive second fundamental form, and $E_S$ is the corresponding extension operator, then we prove that for all $p > 3.25$, $\| E_S f\|_{L^p(\mathbb{R}^3)} \le C(p,S) \| f…

Classical Analysis and ODEs · Mathematics 2015-02-04 Larry Guth

We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function $f : G \to \{-1,+1\}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. We introduce a general notion of granularity of…

Computational Complexity · Computer Science 2026-02-03 Sourav Chakraborty , Swarnalipa Datta , Pranjal Dutta , Arijit Ghosh , Swagato Sanyal

The weak boundedness property associated with a standard alpha-fractional Calderon-Zygmund operator and a weight pair is good-lambda controlled by the testing conditions and the Muckenhoupt and energy side conditions. As a consequence,…

Classical Analysis and ODEs · Mathematics 2016-09-27 Eric T. Sawyer , Chun-Yen Shen , Ignacio Uriarte-Tuero

The aim of this paper is to prove upper and lower $L^p$ estimates, $1<p<\infty$, for Littlewood-Paley square functions in the rational Dunkl setting.

Functional Analysis · Mathematics 2020-08-24 Jacek Dziubański , Agnieszka Hejna

In this paper, we will obtain the strong type and weak type estimates of intrinsic square functions including the Lusin area integral, Littlewood-Paley $g$-function and $g^*_\lambda$-function on the weighted Herz spaces $\dot…

Classical Analysis and ODEs · Mathematics 2012-10-23 Hua Wang

We establish an uncertainty principle for functions $f: \mathbb{Z}/p \rightarrow \mathbb{F}_q$ with constant support (where $p \mid q-1$). In particular, we show that for any constant $S > 0$, functions $f: \mathbb{Z}/p \rightarrow…

Combinatorics · Mathematics 2019-06-27 Saad Quader , Alexander Russell , Ravi Sundaram

The $p$-adic Littlewood Conjecture due to De Mathan and Teuli\'e asserts that for any prime number $p$ and any real number $\alpha$, the equation $$\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle m\alpha \rangle|\, =\, 0 $$ holds. Here, $|m|$…

Number Theory · Mathematics 2020-10-13 Faustin Adiceam , Erez Nesharim , Fred Lunnon

We obtain the existence, uniqueness, and regularity estimates of the following Cauchy problem \begin{equation}\label{ab eqn} \begin{cases} \partial_t u(t,x)=\psi(t,-i\nabla)u(t,x)+f(t,x),\quad &(t,x)\in(0,T)\times\mathbb{R}^d,\\…

Analysis of PDEs · Mathematics 2023-06-19 Jae-Hwan Choi , Ildoo Kim

Sparse deep neural networks have shown their advantages over dense models with fewer parameters and higher computational efficiency. Here we demonstrate constraining the synaptic weights on unit Lp-sphere enables the flexibly control of the…

Machine Learning · Computer Science 2021-03-31 Weipeng Li , Xiaogang Yang , Chuanxiang Li , Ruitao Lu , Xueli Xie

A function $f : \mathbb{F}_2^n \to \mathbb{R}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. Motivated by applications to fast sparse Fourier transforms over $\mathbb{F}_2^n$, we study efficient algorithms for the…

Data Structures and Algorithms · Computer Science 2019-10-15 Grigory Yaroslavtsev , Samson Zhou