Related papers: Almost Alternating Sums

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

We prove that to store n bits x so that each prefix-sum query Sum(i) := sum_{k < i} x_k can be answered by non-adaptively probing q cells of log n bits, one needs memory > n + n/log^{O(q)} n. Our bound matches a recent upper bound of n +…

In this paper we study universal quadratic polynomials which arise as sums of polygonal numbers. Specifically, we determine an asymptotic upper bound (as a function of $m$) on the size of the set $S_m\subset\mathbb{N}$ such that if a sum of…

We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a collection of OAs which belong to an inclusion-minimal set of OAs. We derive a formula for computing the (Generalized) Word Length Pattern of a…

Let $b \ge 2$ be an integer and $\xi$ an irrational real number. We prove that, if the irrationality exponent of $\xi$ is equal to $2$ or slightly greater than $2$, then the $b$-ary expansion of $\xi$ cannot be `too simple', in a suitable…

We show that for any prime prime $p\not=2$ $$\sum_{k=1}^{p-1} {(-1)^k\over k}{-{1\over 2} \choose k} \equiv -\sum_{k=1}^{(p-1)/2}{1\over k} \pmod{p^3}$$ by expressing the l.h.s. as a combination of alternating multiple harmonic sums.

In this paper, we prove $\text{ex}(n, C_{2k})\le (16\sqrt{5}\sqrt{k\log k} + o(1))\cdot n^{1+1/k}$. We improved on Bukh--Jiang's method used in their 2017 publication, thereby reducing the best known upper bound by a factor of $\sqrt{5\log…

Let $X=\{X_n: n\in\mathbb{N}\}$ be a linear process in which the coefficients are of the form $a_i=i^{-1}\ell(i)$ with $\ell$ being a slowly varying function at the infinity and the innovations are independent and identically distributed…

Let $S$ be a subset of $\{1,\ldots,N\}$ avoiding the nontrivial progressions $x, x+y^2-1, x+ 2(y^2-1)$. We prove that $|S|\ll N/\log_m{N}$, where $\log_m $ is the $m$-fold iterated logarithm and $m\in\mathbf{N}$ is an absolute constant.…

For an even integer $k$, let $r_{2k}(n)$ be the number of representations of $n$ as a sum of $2k$ squares. The quantity $r_{2k}(n)$ is appoximated by the classical singular series $\rho_{2k}(n) \asymp n^{k-1}$. Deligne's bound on the…

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

For each positive integer $n$, let $g_{\mathbb Z}(n)$ be the smallest integer such that if an integral quadratic form in $n$ variables can be written as a sum of squares of integral linear forms, then it can be written as a sum of…

We discuss some aspects of approximating functions on high-dimensional data sets with additive functions or ANOVA decompositions, that is, sums of functions depending on fewer variables each. It is seen that under appropriate smoothness…

We focus on the optimal value for various information-theoretical tasks. There are several studies for the asymptotic expansion for these optimal values up to the order $\sqrt{n}$ or $\log n$. However, these expansions have errors of the…

The objective of this paper is to obtain asymptotic results for shifted sums of multiplicative functions of the form $g \ast 1$, where the function $g$ satisfies the Ramanujan conjecture and has conjectured upper bounds on square moments of…

Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log…

We revisit the standard ``telescoping sum'' argument ubiquitous in the final steps of analyzing evaluation complexity of algorithms for smooth nonconvex optimization, and obtain a refined formulation of the resulting bound as a function of…

We improve on all the results of [13] by incorporating the finite range computations performed since then by several authors. Thus we have \begin{align*} \Bigg|\sum_{n\le X}\mu(n)\Bigg| &\le \frac{0.006688\,X}{\log X},&&\text{for } X\ge…

For various compactly supported perturbations of the Laplacian in odd dimensions $n$, we prove a sharp upper bound of the resonance counting function $N(r)$ of the type $N(r) \le A_n r^n(1+o(1))$ with an explicit constant $A_n$. In a few…