Related papers: $l^p$ decoupling for restricted $k$-broadness

The aim of the article is to prove $L^{p}-L^{q}$ off-diagonal estimates and $L^{p}-L^{q}$ boundedness for operators in the functional calculus of certain perturbed first order differential operators of Dirac type for with $p\le q$ in a…

We establish L^p bounds on L^2 normalized spectral clusters for self-adjoint elliptic Dirichlet forms with Lipschitz coefficients. In two dimensions we obtain best possible bounds for all p between $2 and infinity, up to logarithmic losses…

We prove the the large deviation principle(LDP) for the law of the one-dimensional semilinear stochastic partial differential equations driven by nonlinear multiplicative noise. Firstly, combining the energy estimate and approximation…

This paper presents a general methodology for deriving information-theoretic generalization bounds for learning algorithms. The main technical tool is a probabilistic decorrelation lemma based on a change of measure and a relaxation of…

The restriction problem is better understood for hypersurfaces and recent progresses have been made by bilinear and multilinear approaches and most recently polynomial partitioning method which is combined with those estimates. However, for…

In this paper we come up with a dual version of the Furstenberg problem and obtain partial results via $L^p$ estimates of orthogonal projections. Examples are also discussed. Moreover, compared with general sets, we find that special…

We study the consistency of the decoupling limit of the generalized SU(2) Proca theory (GSU2P). Namely, we study the healthiness of those terms whose analysis in the scalar limit was not originally established in the reconstruction of the…

Instead of sampling a function at a single point, average sampling takes the weighted sum of function values around the point. Such a sampling strategy is more practical and more stable. In this note, we present an explicit method with an…

In this paper, we study the uniform capacitated $k$-median problem. Obtaining a constant approximation algorithm for this problem is a notorious open problem; most previous works gave constant approximations by either violating the capacity…

Let $T$ be a strongly Kreiss bounded linear operator on $L^p$. We obtain a bound on the rate of growth of the norms of the powers of $T$. The bound is optimal with respect to the polynomial scale. The proof makes use of Fourier multipliers,…

We prove sharp $L^p$ estimates for the Steklov eigenfunctions on compact manifolds with boundary in terms of their $L^2$ norms on the boundary. We prove it by establishing $L^p$ bounds for the harmonic extension operators as well as the…

The article starts with generalizations of some classical results and new truncation error upper bounds in the sampling theorem for bandlimited stochastic processes. Then, it investigates $L_p([0,T])$ and uniform approximations of…

Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for designing…

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

In this work, we study Fourier multipliers on noncommutative spaces. In particluar, we show a simple proof of $L^p$-$L^q$ estimate of Fourier multipliers on general noncommutative spaces associated with semi-finite von Neumann algebras.…

In a recent work, P. Chen and E. M. Ouhabaz proved a $p$-specific $L^p$-spectral multiplier theorem for the Grushin operator acting on $\mathbb{R}^{d_1}\times\mathbb{R}^{d_2}$ which is given by \[ L =-\sum_{j=1}^{d_1} \partial_{x_j}^2 -…

We establish weighted $L^p$-Fourier-extension estimates for $O(N-k) \times O(k)$-invariant functions defined on the unit sphere $\mathbb{S}^{N-1}$, allowing for exponents $p$ below the Stein-Tomas critical exponent $\frac{2(N+1)}{N-1}$.…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

We analyze the second moment of the ripple size during the LT decoding process and prove that the standard deviation of the ripple size for an LT-code with length $k$ is of the order of $\sqrt k.$ Together with a result by Karp et. al…

Estimates of the generalization error are proved for a residual neural network with $L$ random Fourier features layers $\bar z_{\ell+1}=\bar z_\ell + \mathrm{Re}\sum_{k=1}^K\bar b_{\ell k}e^{\mathrm{i}\omega_{\ell k}\bar z_\ell}+…