Related papers: Evaluating Binomial Character Sums Modulo Powers o…
We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…
We establish a lower bound for the frequency with which an irreducible monic cubic polynomial with negative discriminant can be expressed as a sum of two squares ($\square_{2}$). This provides a quantitative answer to a question posed by…
The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…
We give an estimate of exponential sums over singular binary quintic forms in a characteristic-free form, based on the Waring decomposition of binary forms. This extends the method on our preceding result on the space of binary quartics to…
For a nonprincipal character $\chi$ modulo $D$, when $x\ge D^{\frac56+\varepsilon}$, $(l,D) = 1$, we prove a nontrivial estimate of the form $\sum_{n\le x}\Lambda (n)\chi (n-l)\ll x\exp\left(-0.6\sqrt{\ln D}\right)$ for the sum of values of…
We prove effective finiteness results concerning polynomial values of the sums $$ b^k +\left(a+b\right)^k + \cdots + \left(a\left(x-1\right) + b\right)^k $$ and $$ b^k - \left(a+b\right)^k + \left(2a+b\right)^k - \ldots + (-1)^{x-1}…
In this paper, we investigate two methods to express the natural powers of $2$ as sums over integer partitions. First we consider a formula by N. J. Fine that allows us to express a binomial coefficient in terms of multinomial coefficients…
We survey combinatorial interpretations of some dozen identities for the double factorial such as, for instance, (2n-2)!! + Sum_{k=2}^{n} (2n-1)!!(2k-4)!!/(2k-1)!! = (2n-1)!!. Our methods are mostly bijective.
Let $q$ be a prime power and $r$ a positive even integer. Let $\mathbb{F}_{q}$ be the finite field with $q$ elements and $\mathbb{F}_{q^r}$ be its extension field of degree $r$. Let $\chi$ be a nontrivial multiplicative character of…
Let K be a p-adic field, R the valuation ring of K, and P the maximal ideal of R. Let $Y subseteq R^{2}$ be a non-singular closed curve, and Y_{m} its image in R/P^{m} times R/P^{m}, i.e. the reduction modulo P^{m} of Y. We denote by Psi an…
In this manuscript we provide a new polynomial pattern. This pattern allows to find a polynomial expansion of the form \[x^{2m+1} = \sum_{k=1}^{x}\sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r,\] where $x,m\in\mathbb{N}$ and $\mathbf{A}_{m,r}$…
With help of $q$-congruence, we prove the divisibility of some binomial sums. For example, for any integers $\rho,n\geq 2$, $$\sum_{k=0}^{n-1}(4k+1) \binom{2k}{k}^\rho \cdot (-4)^{\rho(n-1-k)} \equiv 0\pmod{2^{\rho-2}n\binom{2n}{n}}.$$
In a recent article (arXiv:1507.03499) (joint with Alon Regev) we studied sums of squares of characters Chi(L,M) of the Symmetric Group over shapes L that are two-rowed, and shapes L that are hook shapes, and M is an arbitrary shape that…
In this paper we initiate the study of products and sums divisible by central binomial coefficients. We show that 2(2n+1)binom(2n,n)| binom(6n,3n)binom(3n,n) for every n=1,2,3,... Also, for any nonnegative integers $k$ and $n$ we have…
We show that a short truncation of the Fourier expansion for a character sum gives a good approximation for the average value of that character sum over an interval. We give a few applications of this result. One is that for any $b$ there…
Let $p$ be a large prime number and $g$ be any integer of multiplicative order $T$ modulo $p$. We obtain a new estimate of the double exponential sum $$ S=\sum_{n\in \mathcal{N}}\left|\sum_{m\in \mathcal{M} }e_p(an g^{m})\right|, \quad \gcd…
We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…