中文
相关论文

相关论文: On the Balog-Ruzsa Theorem in short intervals

200 篇论文

Kolmogorov's exponential inequalities are basic tools for studying the strong limit theorems such as the classical laws of the iterated logarithm for both independent and dependent random variables. This paper establishes the Kolmogorov…

概率论 · 数学 2020-05-08 Li-Xin Zhang

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

数论 · 数学 2018-05-09 Christian Elsholtz , Stefan Planitzer

We study Edgeworth expansions in limit theorems for self-normalized sums. Non-uniform bounds for expansions in the central limit theorem are established while only imposing minimal moment conditions. Within this result, we address the case…

概率论 · 数学 2022-08-11 Pascal Beckedorf , Angelika Rohde

We derive a central limit theorem for sums of a function of independent sums of independent and identically distributed random variables. In particular we show that previously known result from Rempa\la and Weso\lowski (Statist. Probab.…

概率论 · 数学 2015-05-21 Kamil Marcin Kosiński

Let $\lambda$ the Barban--Vehov weights, defined in $(1)$. Let $X\ge z_1\ge100$ and $z_2=z_1^\tau$ for some $\tau>1$. We prove that \begin{equation*} \sum_{n\le X}\frac{1}{n}\Bigl(\sum_{\substack{d|n}}\lambda_d\Bigr)^2 \le f(\tau)\frac{\log…

数论 · 数学 2025-12-15 Olivier Ramaré , Sebastian Zuniga Alterman

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

机器学习 · 统计学 2015-10-06 Alekh Agarwal , Leon Bottou

We will show in this paper that if $\lambda$ is very close to 1, then $$I(M,\lambda,m)= \sup_{u\in H^{1,n}_0(M) ,\int_M|\nabla u|^ndV=1}\int_\Omega (e^{\alpha_n |u|^\frac{n}{n-1}}-\lambda\sum\limits_{k=1}^m\frac{|\alpha_nu^\frac{n}{n-1}|^k}…

偏微分方程分析 · 数学 2007-05-23 Yuxiang Li

Let $(\mathbb{R}_{\alpha ,\beta ,\gamma }(z))_{m}(z)=z+\sum_{n=1}^{m}A_{n}z^{n+1}$ be the sequence of partial sums of the normalized Rabotnov functions $\mathbb{R}_{\alpha ,\beta ,\gamma }(z)=z+\sum_{n=1}^{\infty }A_{n}z^{n+1}$ where…

复变函数 · 数学 2023-09-06 Basem Aref Frasin

The purpose of this article is to establish new lower bounds for the sums of powers of eigenvalues of the Dirichlet fractional Laplacian operator $(-\Delta)^{\alpha/2}|_{\Omega}$ restricted to a bounded domain $\Omega\subset{\mathbb R}^d$…

偏微分方程分析 · 数学 2015-01-08 Turkay Yolcu , Selma Yildirim Yolcu

There has been recent interest in a hybrid form of the celebrated conjectures of Hardy-Littlewood and of Chowla. We prove that for any $k,\ell\ge1$ and distinct integers $h_2,\ldots,h_k,a_1,\ldots,a_\ell$, we have $$\sum_{n\leq…

数论 · 数学 2022-10-27 Jared Duker Lichtman , Joni Teräväinen

We bound an exponential sum that appears in the study of irregularities of distribution (the low-frequency Fourier energy of the sum of several Dirac measures) by geometric quantities: a special case is that for all $\left\{ x_1, \dots,…

数论 · 数学 2017-09-05 Stefan Steinerberger

This note was prepared for a lecture given at Kyoto University (RIMS Workshop: "The State of the Art in Numerical Analysis: Theory, Methods, and Applications", November 8-10, 2017). That lecture described the variational analysis of the…

数值分析 · 数学 2018-07-17 Norikazu Saito

Let $H = N^{\theta}, \theta > 2/3$ and $k \geq 1$. We obtain estimates for the following exponential sum over primes in short intervals: \[ \sum_{N < n \leq N+H} \Lambda(n) e(g(n)), \] where $g$ is a polynomial of degree $k$. As a…

数论 · 数学 2019-06-27 Kaisa Matomäki , Xuancheng Shao

In a recent paper, M. Raghupathi has extended the famous theorem of Beurling to the context of subspaces that are invariant under the class of subalgebras of $H^\infty$ of the form $IH^\infty$, where $I$ is an inner function. In this paper,…

泛函分析 · 数学 2016-02-19 Ajay Kumar , Niteesh Sahni , Dinesh Singh

Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…

数论 · 数学 2024-06-17 Yu-Chen Sun

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

数论 · 数学 2019-01-08 Daniele Mastrostefano

We prove a new bound to the exponential sum of the form $$ \sum_{h \sim H}\delta_h \mathop{\sum_{m\sim M}\sum_{n\sim N}}_{mn\sim x}a_{m}b_{n}\e\big(\alpha mn + h(mn + u)^{\gamma}\big), $$ by a new approach to the Type I sum. The sum can be…

数论 · 数学 2025-12-10 Li Lu , Lingyu Guo , Victor Z. Guo

Let $M(x)=\sum_{1\le n\le x}\mu(n)$ where $\mu$ is the M\"obius function. It is well-known that the Riemann Hypothesis is equivalent to the assertion that $M(x)=O(x^{1/2+\epsilon})$ for all $\epsilon>0$. There has been much interest and…

数论 · 数学 2014-07-01 Lynnelle Ye

We establish a connection between analytic number theory and computational learning theory by showing that the M\"obius function belongs to a class of functions that is statistically hard to learn from random samples. Let $\mu_R$ denote the…

数论 · 数学 2026-04-17 W. Burstein , A. Iosevich , A. Sant

Li and Hu recently established variance-type O(1/n) bounds for the sample mean of independent random vectors under sublinear expectations. We extend their results to the exponential concentration regime. For bounded, independent R^d-valued…

统计理论 · 数学 2026-02-26 Nahom Seyoum