Related papers: Sparse bounds for discrete singular Radon transfor…

We fix an excellent regular noetherian scheme $S$ over ${\mathbf Z}_{(p)}$ satisfying a certain finiteness condition. For a constructible \'etale sheaf ${\cal F}$ on a regular scheme $X$ of finite type over $S$, we introduce a variant of…

A $d$-dimensional zero-one matrix $A$ avoids another $d$-dimensional zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeroes. Let $f(n,P,d)$ denote the maximum number of ones in a $d$-dimensional…

We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…

We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…

This paper develops a Statics Preserving Sparse Radon transform (SPSR) algorithm.The de-coloration power of Radon basis functions depends on different factors. The most important one is statics. Statics decrease the sparsity of Radon…

We consider a locally finite (Radon) measure on $ SO^+(d,1)/ \Gamma $ invariant under a horospherical subgroup of $ SO^+(d,1) $ where $ \Gamma $ is a discrete, but not necessarily geometrically finite, subgroup. We show that whenever the…

Deep learning has been wildly successful in practice and most state-of-the-art machine learning methods are based on neural networks. Lacking, however, is a rigorous mathematical theory that adequately explains the amazing performance of…

This paper studies sparse elliptic random matrix models which generalize both the classical elliptic ensembles and sparse i.i.d. matrix models by incorporating correlated entries and a tunable sparsity parameter $p_n$. Each $n\times n$…

We algorithmically determine the monodromy of the local system on the smooth part of the Radon transformation of a generic simple perverse sheaf on the projective plane.

We prove sparse bounds for pseudodifferential operators associated to H\"ormander symbol classes. Our sparse bounds are sharp up to the endpoint and rely on a single scale analysis. As a consequence, we deduce a range of weighted estimates…

In image reconstruction there are techniques that use analytical formulae for the Radon transform to recover an image from a continuum of data. In practice, however, one has only discrete data available. Thus one often resorts to sampling…

Let $P$ be a $\delta$-separated $(\delta, s, C_P)$-set of points in $B(0, 1)\subset \mathbb{R}^d$ and $\Pi$ be a $\delta$-separated $(\delta, t, C_\Pi)$-set of hyperplanes intersecting $B(0, 1)$ in $\mathbb{R}^d$. Define \[I_{C\delta}(P,…

We obtain sharp sparse bounds for Hilbert transforms along curves in $\mathbb{R}^n$, and derive as corollaries weighted norm inequalities for such operators. The curves that we consider include monomial curves and arbitrary $C^n$ curves…

We prove $\ell^p\big(\mathbb Z^d\big)$ bounds, for $p\in(1, \infty)$, of discrete maximal functions corresponding to averaging operators and truncated singular integrals of Radon type, and their applications to pointwise ergodic theory. Our…

We initiate a classification of complex polynomials f of degree d having the top Betti number of the general fibre close to the maximum. We find a range in which the polynomial must have isolated singularities and another range where it may…

We give a construction of a Poisson transform mapping density valued differential forms on generalized flag manifolds to differential forms on the corresponding Riemannian symmetric spaces, which can be described entirely in terms of finite…

We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…

The real solutions to a system of sparse polynomial equations may be realized as a fiber of a projection map from a toric variety. When the toric variety is orientable, the degree of this map is a lower bound for the number of real…

In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove…

Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…