Related papers: An infinitary Zero sum theorem

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

We obtain rge Erd\" os-R\' enyi type law of large numbers for "nonconventional" sums of the form $S_n=\sum^n_{m=1}F(X_m,X_{2m},...,X_{\ell m})$ where $X_1,X_2,...$ is a sequence of i.i.d. random variables and $F$ is a bounded Borel…

Hardy's theorem for the Riemann zeta-function $\zeta(s)$ says that it admits infinitely many complex zeros on the line $\Re({s}) = \frac{1}{2}$. In this note, we give a simple proof of this statement which, to the best of our knowledge, is…

We give systematic method to evaluate a large class of one-dimensional integral relating to multiple zeta values (MZV) and colored MZV. We also apply the technique of iterated integrals and regularization to elucidate the nature of some…

Ellenberg and Gijswijt gave recently a new exponential upper bound for the size of three-term arithmetic progression free sets in $({\mathbb Z_p})^n$, where $p$ is a prime. Petrov summarized their method and generalized their result to…

We introduce Euler summability method for sequences of fuzzy numbers and state a Tauberian theorem concerning Euler summability method, of which proof provides an alternative to that of K. Knopp[\"Uber das Eulersche Summierungsverfahren II,…

Let $\sigma(n)$ be the sum of the positive divisors of $n$. A number $n$ is said to be 2-near perfect if $\sigma(n) = 2n +d_1 +d_2 $, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We give a complete description of those $n$…

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…

In this article we show that the Erd\H{o}s-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory.

In this paper certain classes of infinite sums involving special functions are evaluated analytically by application of basic quantum mechanical principles to simple models of half harmonic oscillator and a particle trapped inside an…

We prove a generalization of Gowers' theorem for $\mathrm{FIN}_{k}$ where, instead of the single tetris operation $T:\mathrm{FIN}_{k}\rightarrow \mathrm{FIN}_{k-1}$, one considers all maps from $\mathrm{FIN}_{k}$ to $\mathrm{FIN}_{j}$ for…

A number $n$ is practical if every integer in $[1,n]$ can be expressed as a subset sum of the positive divisors of $n$. We consider the distribution of practical numbers that are also shifted primes, improving a theorem of Guo and…

In this paper we study sum-free subsets of the set $\{1,...,n\}$, that is, subsets of the first $n$ positive integers which contain no solution to the equation $x + y = z$. Cameron and Erd\H{o}s conjectured in 1990 that the number of such…

In this survey, we present five different proofs for the transcendence of Kempner's number, defined by the infinite series $\sum_{n=0}^{\infty} \frac{1}{2^{2^n}}$. We take the opportunity to mention some interesting ideas and methods that…

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

Let $G$ be an arbitrary group such that $G/\Z(G)$ is finite, where $\Z(G)$ denotes the center of the group $G$. Then $\gamma_2(G)$, the commutator subgroup of $G$, is finite. This result is known as Shur's theorem (the Schur's theorem). In…

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

Let $k$ be a real abelian number field and $p$ an odd prime not dividing $[k:\mathbb{Q}]$. For a natural number $d$, let $E_d$ denote the group of units of $k$ congruent to $1$ modulo $d$, $C_d$ the subgroup of $d$-circular units of $E_d$,…

Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated…

Let f:A-->B be a covering map. We say A has e filtered ends with respect to f (or B) if for some filtration {K_n} of B by compact subsets, A - f^{-1}(K_n) "eventually" has e components. The main theorem states that if Y is a (suitable) free…