English
Related papers

Related papers: Estimates for smooth Weyl sums on major arcs

200 papers

We use decoupling theory to prove a sharp (up to $N^\epsilon$ losses) estimate for Vinogradov's mean value theorem in two dimensions

Classical Analysis and ODEs · Mathematics 2015-08-06 Jean Bourgain , Ciprian Demeter

We prove local and global upper estimates for the infimum of the mean curvature, the scalar curvature and the norm of the shape operator of graphs in a warped product space. Using these estimates, we obtain some results on pseudo-hyperbolic…

Differential Geometry · Mathematics 2020-11-05 Alexandre Paiva Barreto , Fabiani A. Coswosck , Luiz Hartmann

The maximum norm error estimations for virtual element methods are studied. To establish the error estimations, we prove higher local regularity based on delicate analysis of Green's functions and high-order local error estimations for the…

Numerical Analysis · Mathematics 2022-08-12 Wen-Ming He , Hailong Guo

Given an isometry invariant valuation on a complex space form we compute its value on the tubes of sufficiently small radii around a set of positive reach. This generalizes classical formulas of Weyl, Gray and others about the volume of…

Differential Geometry · Mathematics 2023-04-14 Gil Solanes , Juan Andrés Trillo

We prove the higher-dimensional analogue of Wolff's local smoothing estimate (Geom. Funct. Anal. 2001) for large p. As in the 2+1-dimensional case, the estimate is sharp for any given value of p, but it is likely that the range of p can be…

Classical Analysis and ODEs · Mathematics 2007-05-23 I. Laba , T. Wolff

We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…

Optimization and Control · Mathematics 2024-11-20 Alan Luner , Benjamin Grimmer

We establish new upper bounds for the height of the S-integral points of an elliptic curve. This bound is explicitly given in terms of the set S of places of the number field K involved, but also in terms of the degree of K, as well as the…

Number Theory · Mathematics 2012-08-15 Vincent Bosser , Andrea Surroca

We propose novel smooth approximations to the classical rounding function, suitable for differentiable optimization and machine learning applications. Our constructions are based on two approaches: (1) localized sigmoid window functions…

Machine Learning · Computer Science 2025-04-29 Stanislav Semenov

A method for successive synthesis of the Weyl matrix on the square lattice is proposed. It allows one to compute the Weyl matrix of a large graph by adding new edges and solving elementary systems of linear algebraic equations at each step.…

Mathematical Physics · Physics 2024-08-29 Dongjie Wu , ChuanFu Yang , Natalia Pavlovna Bondarenko

We consider large values of long linear exponential sums involving Fourier coefficients of holomorphic cusp forms. The sums we consider involve rational linear twists $e(nh/k)$ with sufficiently small denominators. We prove both pointwise…

Number Theory · Mathematics 2016-08-10 Esa V. Vesalainen

Often in the analysis of first-order methods for both smooth and nonsmooth optimization, assuming the existence of a growth/error bound or KL condition facilitates much stronger convergence analysis. Hence separate analysis is typically…

Optimization and Control · Mathematics 2023-01-10 Benjamin Grimmer

Dimension-free bounds will be provided in maximal and $r$-variational inequalities on $\ell^p(\mathbb Z^d)$ corresponding to the discrete Hardy-Littlewood averaging operators defined over the cubes in $\mathbb Z^d$. We will also construct…

Classical Analysis and ODEs · Mathematics 2019-04-18 Jean Bourgain , Mariusz Mirek , Elias M. Stein , Błażej Wróbel

In this paper, we focus on the strong subconvexity bounds for triple product L-functions in the cubic level aspect. Our proof on the Weyl-type bound synthesizes techniques from classical analytic number theory with methods in automorphic…

Number Theory · Mathematics 2025-08-20 Xinchen Miao , Huimin Zhang

In his paper, W. M. Schmidt obtained an exponential sum estimate for systems of polynomials not including linear polynomials, which was then used to apply the Hardy-Littlewood circle method. We prove an analogous estimate for systems…

Number Theory · Mathematics 2016-07-29 Shuntaro Yamagishi

This paper deals with the estimation of a probability measure on the real line from data observed with an additive noise. We are interested in rates of convergence for the Wasserstein metric of order $p\geq 1$. The distribution of the…

Statistics Theory · Mathematics 2015-03-05 Jérôme Dedecker , Aurélie Fischer , Bertrand Michel

We initiate the theory of $\ell^p$-improving inequalities for arithmetic averages over hypersurfaces and their maximal functions. In particular, we prove $\ell^p$-improving estimates for the discrete spherical averages and some of their…

Classical Analysis and ODEs · Mathematics 2019-11-28 Kevin Hughes

The Weyl law of the Laplacian on the flat torus $\mathbb{T}^n$ is concerning the number of eigenvalues $\le\lambda^2$, which is equivalent to counting the lattice points inside the ball of radius $\lambda$ in $\mathbb{R}^n$. The leading…

Analysis of PDEs · Mathematics 2023-07-26 Xiaoqi Huang , Cheng Zhang

We prove multiple vector-valued and mixed-norm estimates for multilinear operators in $\rr R^d$, more precisely for multilinear operators $T_k$ associated to a symbol singular along a $k$-dimensional space and for multilinear variants of…

Classical Analysis and ODEs · Mathematics 2021-04-20 Cristina Benea , Camil Muscalu

We give optimal constants of smoothing estimates for the $d$-dimensional free Dirac equation for any $d \geq 2$. Our main abstract theorem shows that the optimal constant $C$ of smoothing estimate associated with a spatial weight $w$ and…

Analysis of PDEs · Mathematics 2025-01-08 Soichiro Suzuki

We develop new sub-optimality bounds for gradient descent (GD) that depend on the conditioning of the objective along the path of optimization rather than on global, worst-case constants. Key to our proofs is directional smoothness, a…

Machine Learning · Computer Science 2025-01-15 Aaron Mishkin , Ahmed Khaled , Yuanhao Wang , Aaron Defazio , Robert M. Gower
‹ Prev 1 4 5 6 7 8 10 Next ›