中文
相关论文

相关论文: Almost Alternating Sums

200 篇论文

It is shown, subject to the abc-conjecture, that \[\sum_{n\le N}\exp(2\pi i\alpha n^3)\ll_{\epsilon,\alpha}N^{5/7+\epsilon}\] for any $\epsilon>0$ and any quadratic irrational $\alpha$.

数论 · 数学 2009-05-13 D. R. Heath-Brown

Let $\mathfrak{B}$ denote the collection of odd primitive Gaussian integers and $n\mapsto b(n)$ denote the characteristic function of elements of $\mathfrak{B}$. We prove that the exponential sum $ S(\alpha; N)=\sum_{n\le…

数论 · 数学 2026-04-13 E. Malavika , Olivier Ramaré

Let $a>1$. Denote by $l_a(p)$ the multiplicative order of $a$ modulo $p$. We look for an estimate of sum of $\frac{l_a(p)}{p-1}$ over primes $p\leq x$ on average. When we average over $a\leq N$, we observe a statistic of $C\mathrm{Li}(x)$.…

数论 · 数学 2021-02-10 Sungjin Kim

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg…

组合数学 · 数学 2016-11-17 Antal Balog , Oliver Roche-Newton , Dmitry Zhelezov

We combine the fixed-order evaluation of the $b\bar{b}$ sum rules with a non-relativistic effective-theory approach. The combined result for the $n$-th moment includes all terms suppressed with respect to the leading-order result by ${\cal…

高能物理 - 唯象学 · 物理学 2008-11-26 Adrian Signer

Following a recent improvement of Cardinal et al. on the complexity of a linear decision tree for $k$-SUM, resulting in $O(n^3 \log^3{n})$ linear queries, we present a further improvement to $O(n^2 \log^2{n})$ such queries.

计算几何 · 计算机科学 2016-07-18 Esther Ezra , Micha Sharir

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

数论 · 数学 2010-11-16 Eduardo Duenez , Steven J. Miller , Howard Straubing , Amitabha Roy

Recent advances in randomized incremental methods for minimizing $L$-smooth $\mu$-strongly convex finite sums have culminated in tight complexity of $\tilde{O}((n+\sqrt{n L/\mu})\log(1/\epsilon))$ and $O(n+\sqrt{nL/\epsilon})$, where…

机器学习 · 计算机科学 2020-02-11 Yossi Arjevani , Amit Daniely , Stefanie Jegelka , Hongzhou Lin

A sum where each of the $N$ summands can be independently chosen from two choices yields $2^N$ possible summation outcomes. There is an $\mathcal{O}(K^2)$-algorithm that finds the $K$ smallest/largest of these sums by evading the…

数据结构与算法 · 计算机科学 2017-04-20 Torsten Gross , Nils Blüthgen

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

数论 · 数学 2016-05-20 Sungjin Kim

The main objective of this paper is to look from the unique point of view at some phenomena arising in different areas of probability theory and mathematical statistics. We will try to understand what is common between classical…

概率论 · 数学 2012-03-01 Oleg Lepski

We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables…

数论 · 数学 2015-03-12 Igor E. Shparlinski

We provide new upper bounds for sums of certain arithmetic functions in many variables at polynomial arguments and, exploiting recent progress on the mean-value of the Erd\H os-Hooley $\Delta$-function, we derive lower bounds for the…

数论 · 数学 2026-01-14 Régis de la Bretèche , Gérald Tenenbaum

We consider sum-type strongly convex optimization problem (first term) with smooth convex not proximal friendly composite (second term). We show that the complexity of this problem can be split into optimal number of incremental oracle…

最优化与控制 · 数学 2020-03-12 Darina Dvinskikh , Sergey Omelchenko , Alexander Tyurin , Alexander Gasnikov

Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…

组合数学 · 数学 2016-03-22 Kevin Topley

We improve a previous sum--products estimates in R, namely, we obtain that max{|A+A|,|AA|} \gg |A|^{4/3+c}, where c any number less than 5/9813. New lower bounds for sums of sets with small the product set are found. Also we prove some pure…

组合数学 · 数学 2016-02-11 Sergei Konyagin , Ilya D. Shkredov

We provide general adaptive upper bounds for estimating nonparametric functionals based on second order U-statistics arising from finite dimensional approximation of the infinite dimensional models. We then provide examples of functionals…

统计理论 · 数学 2021-06-07 Lin Liu , Rajarshi Mukherjee , James Robins , Eric Tchetgen Tchetgen

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

数论 · 数学 2023-02-09 Aliaksei Semchankau

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…

动力系统 · 数学 2021-09-15 J. J. P. Veerman , L. S. Fox , P. J. Oberly

We study the rate of growth of ergodic sums along a sequence (a_n) of times: S_N f(x)=f(T^{a_1}x) + ... + f(T^{a_N}x). We characterize the maximal rate of growth of these ergodic sums and identify a number of sequences such as (2^n) that…

动力系统 · 数学 2016-09-07 Anthony Quas , Mate Wierdl