Related papers: Almost Alternating Sums

The sequence of 1/2-discrepancy sums of $\{x + i \theta \bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic…

We improve on recent estimates for the probability of generating the alternating and symmetric groups $\mathrm{Alt}(n)$ and $\mathrm{Sym}(n)$. In particular we find the sharp lower bound, if the probability is given by a quadratic in…

Sums of the form $\sum_{n\le x}E^k(n) (k\in{\bf N}$ fixed) are investigated, where $$ E(T) = \int_0^T|\zeta(1/2+it)|^2 dt - T\Bigl(\log {T\over2\pi} + 2\gamma -1\Bigr)$$ is the error term in the mean square formula for $|\zeta(1/2+it)|$.…

We develop new tools leading, for each integer $n\ge 4$, to a significantly improved upper bound for the uniform exponent of rational approximation $\widehat{\lambda}_n(\xi)$ to successive powers $1,\xi,\dots,\xi^n$ of a given real…

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…

We analyze union-find using potential functions motivated by continuous algorithms, and give alternate proofs of the $O(\log\log{n})$, $O(\log^{*}n)$, $O(\log^{**}n)$, and $O(\alpha(n))$ amortized cost upper bounds. The proof of the…

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

We consider the problem of directly optimizing a non-linear function of an outcome, where this outcome itself is the sum of many small contributions. The non-linearity of the function means that the problem is not equivalent to the…

An asymptotic expansion for the generalised quadratic Gauss sum $$S_N(x,\theta)=\sum_{j=1}^{N} \exp (\pi ixj^2+2\pi ij\theta),$$ where $x$, $\theta$ are real and $N$ is a positive integer, is obtained as $x\rightarrow 0$ and…

A positive integer $n$ is called an abundant number if $\sigma (n)\ge 2n$, where $\sigma (n)$ is the sum of all positive divisors of $n$. Let $E(x)$ be the largest number of consecutive abundant numbers not exceeding $x$. In 1935, P. Erd\H…

We obtain almost optimal convergence rate in the central limit theorem for "nonconevntional" sums of the form $S_N=N^{-\frac12}\sum_{n=1}^N (F(\xi_n,\xi_{2n},...,\xi_{\ell n})-\bar F)$.

Four natural boundary statistics and two natural bulk statistics are considered for alternating sign matrices (ASMs). Specifically, these statistics are the positions of the 1's in the first and last rows and columns of an ASM, and the…

The average value of log s(n)/n taken over the first N even integers is shown to converge to a constant lambda when N tends to infinity; moreover, the value of this constant is approximated and proven to be less than 0. Here s(n) sums the…

We consider the complexity for computing the approximate sum $a_1+a_2+...+a_n$ of a sorted list of numbers $a_1\le a_2\le ...\le a_n$. We show an algorithm that computes an $(1+\epsilon)$-approximation for the sum of a sorted list of…

Denote by $N(n)$ the number of integer solutions $(x_1,\,x_2,\ldots ,x_n)$ of the equation $x_1+x_2+\ldots+x_n=x_1x_2\cdot\ldots\cdot x_n$ such that $x_1\ge x_2\ge\ldots\ge x_n\ge 1$, $n \in \mathbb{Z}^+$. The aim of this paper are is…

For the partial sums $(S_n)$ of independent random variables we define a stochastic process $s_n(t):=(1/d_n)\sum_{k \le [nt]} ({S_k}/{k}-\mu)$ and prove that $$(1/{\log N})\sum_{n\le N}(1/n)\mathbf {I}\left\{s_n(t)\le x\right\} \to…

Several asymptotic expansions and formulas for cubic exponential sums are derived. The expansions are most useful when the cubic coefficient is in a restricted range. This generalizes previous results in the quadratic case and helps to…

For $f$ a Rademacher or Steinhaus random multiplicative function, we prove that $$ \max_{\theta \in [0,1]} \frac{1}{\sqrt{N}} \Bigl| \sum_{n \leq N} f(n) \mathrm{e} (n \theta) \Bigr| \gg \sqrt{\log N} ,$$ asymptotically almost surely as $N…