English
Related papers

Related papers: Restriction and Kakeya maximal estimates in $\math…

200 papers

We prove a maximal restriction inequality for the Fourier transform, providing an answer to a question left open by M\"uller, Ricci and Wright. Our methods are similar to the ones in their article, with the addition of a suitable trick to…

Classical Analysis and ODEs · Mathematics 2018-10-17 João P. G. Ramos

We prove L2 x L2 to weak L1 estimates for some novel bilinear maximal operators of Kakeya and lacunary type thus extending to this setting, the works of Cordoba and of Nagel, Stein and Wainger.

Classical Analysis and ODEs · Mathematics 2016-02-12 Jose A. Barrionuevo , Jarod Hart , Lucas Oliveira

Bennett, Carbery and Tao established nearly optimal $L^1$ trilinear restriction estimates in $\mathbb{R}^{n+1}$ under transversality assumptions only. In this paper we show that the curvature improves the range of exponents, by establishing…

Classical Analysis and ODEs · Mathematics 2016-03-10 Ioan Bejenaru

We reprove Wolff's $L^{\frac{5}2}-$ bound for the $\R^3-$Kakeya maximal function without appealing to the argument of induction on scales. The main ingredient in our proof is an adaptation of Sogge's strategy used in the work on…

Analysis of PDEs · Mathematics 2015-09-22 Changxing Miao , Jianwei Yang , Jiqiang Zheng

This article deals with the numerical analysis of the Cauchy problem for the Korteweg-de Vries equation with a finite difference scheme. We consider the Rusanov scheme for the hyperbolic flux term and a 4-points $\theta$-scheme for the…

Numerical Analysis · Mathematics 2018-10-30 Clémentine Courtès , Frédéric Lagoutière , Frédéric Rousset

Recently there has been renewed interests in derivative free approaches to stochastic optimization. In this paper, we examine the rates of convergence for the Kiefer-Wolfowitz algorithm and the mirror descent algorithm, under various…

Optimization and Control · Mathematics 2016-10-31 Liyi Dai

We prove a high-dimensional version of the Strichartz estimates for the unitary group associated to the free Zakharov--Kuznetsov equation. As a by--product, we deduce maximal estimates which allow us to prove local well-posedness for the…

Analysis of PDEs · Mathematics 2020-05-27 Felipe Linares , João P. G. Ramos

We consider Bochner-Riesz means on weighted $L^p$ spaces, at the critical index $\lambda(p)=d(\frac 1p-\frac 12)-\frac 12$. For every $A_1$-weight we obtain an extension of Vargas' weak type $(1,1)$ inequality in some range of $p>1$. To…

Classical Analysis and ODEs · Mathematics 2025-01-24 David Beltran , Joris Roos , Andreas Seeger

For martingales with a wide range of integrability, we will quantify the rate of convergence of the central limit theorem via Wasserstein distances of order $r$, $1\le r\le 3$. Our bounds are in terms of Lyapunov's coefficients and the…

Probability · Mathematics 2024-07-25 Xiaoqin Guo

In this paper we study the frequentist convergence rate for the Latent Dirichlet Allocation (Blei et al., 2003) topic models. We show that the maximum likelihood estimator converges to one of the finitely many equivalent parameters in…

Machine Learning · Statistics 2019-01-21 Yining Wang

In this paper we generalize the H\'ajek-R\'enyi-Chow maximal inequality for submartingales to $L^p$ type Riesz spaces with conditional expectation operators. As applications we obtain a submartingale convergence theorem and a strong law of…

Functional Analysis · Mathematics 2019-08-27 Wen-Chi Kuo , David F. Rodda , Bruce A. Watson

We study a.e. convergence on $L^p$, and Lorentz spaces $L^{p,q}$, $p>\tfrac{2d}{d-1}$, for variants of Riesz means at the critical index $d(\tfrac 12-\tfrac 1p)-\tfrac12$. We derive more general results for (quasi-)radial Fourier…

Classical Analysis and ODEs · Mathematics 2016-04-20 Sanghyuk Lee , Andreas Seeger

In Dolera, Gabetta and Regazzini [Ann. Appl. Probab. 19 (2009) 186-201] it is proved that the total variation distance between the solution $f(\cdot,t)$ of Kac's equation and the Gaussian density $(0,\sigma^2)$ has an upper bound which goes…

Probability · Mathematics 2016-09-09 Emanuele Dolera , Eugenio Regazzini

We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erd\H{o}s. Most notably, we improve the upper bounds on the Ramsey multiplicity of $K_4$ and $K_5$ and settle…

Combinatorics · Mathematics 2024-09-16 Olaf Parczyk , Sebastian Pokutta , Christoph Spiegel , Tibor Szabó

In this article, we fill a gap in the literature regarding quantitative functional central limit theorems (qfCLT) for Hawkes processes by providing an upper bound for the convergence of a nearly unstable Hawkes process toward a…

Probability · Mathematics 2025-06-16 Laure Coutin , Benjamin Massat , Anthony Réveillac

Motivated by a theorem of Barbour, we revisit some of the classical limit theorems in probability from the viewpoint of the Stein method. We setup the framework to bound Wasserstein distances between some distributions on infinite…

Probability · Mathematics 2018-07-30 Laure Coutin , Laurent Decreusefond

For integers $1 < k < d-1$ and $r \ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of…

Combinatorics · Mathematics 2025-09-09 Anubhab Ghosal , Ritesh Goenka , Peter Keevash

We prove a normalized version of the restricted invertibility principle obtained by Spielman-Srivastava. Applying this result, we get a new proof of the proportional Dvoretzky-Rogers factorization theorem recovering the best current…

Functional Analysis · Mathematics 2019-02-20 Pierre Youssef

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k,…

Combinatorics · Mathematics 2026-04-24 Veronica Bitonti , Emma Hogan , Tommy Walker Mackay

We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a…

Combinatorics · Mathematics 2018-05-15 Iskander Aliev , Martin Henk , Timm Oertel
‹ Prev 1 8 9 10 Next ›