Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new user(k+1)-sums versus k-sums
202
0
0.0
(
0
)
Authors
Simon Griffiths
Ask ChatGPT about the research
No Arabic abstract
A $k$-sum of a set $Asubseteq mathbb{Z}$ is an integer that may be expressed as a sum of $k$ distinct elements of $A$. How large can the ratio of the number of $(k+1)$-sums to the number of $k$-sums be? Writing $kwedge A$ for the set of $k$-sums of $A$ we prove that [ frac{|(k+1)wedge A|}{|kwedge A|}, le , frac{|A|-k}{k+1} ] whenever $|A|ge (k^{2}+7k)/2$. The inequality is tight -- the above ratio being attained when $A$ is a geometric progression. This answers a question of Ruzsa.
rate research
Read More
We study M(n,k,r), the number of orbits of {(a_1,...,a_k)in Z_n^k | a_1+...+a_k = r (mod n)} under the action of S_k. Equivalently, M(n,k,r) sums the partition numbers of an arithmetic sequence: M(n,k,r) = sum_{t geq 0} p(n-1,k,r+nt), where p(a,b,t) denotes the number of partitions of t into at most b parts, each of which is at most a. We derive closed formulas and various identities for such arithmetic partition sums. These results have already appeared in Elashvili/Jibladze/Pataraia, Combinatorics of necklaces and Hermite reciprocity, J. Alg. Combin. 10 (1999) 173-188, and the main result was also published by Von Sterneck in Sitzber. Akad. Wiss. Wien. Math. Naturw. Class. 111 (1902), 1567-1601 (see Lemma 2 and references in math.NT/9909121). Thanks to Don Zagier and Robin Chapman for bringing these references to our attention.
For a subset A of a finite abelian group G we define Sigma(A)={sum_{ain B}a:Bsubset A}. In the case that Sigma(A) has trivial stabiliser, one may deduce that the size of Sigma(A) is at least quadratic in |A|; the bound |Sigma(A)|>= |A|^{2}/64 has recently been obtained by De Vos, Goddyn, Mohar and Samal. We improve this bound to the asymptotically best possible result |Sigma(A)|>= (1/4-o(1))|A|^{2}. We also study a related problem in which A is any subset of Z_{n} with all elements of A coprime to n; it has recently been shown, by Vu, that if such a set A has the property Sigma(A) is not Z_{n} then |A|=O(sqrt{n}). This bound was improved to |A|<= 8sqrt{n} by De Vos, Goddyn, Mohar and Samal, we further improve the bound to the asymptotically best possible result |A|<= (2+o(1))sqrt{n}.
In the past two decades, many researchers have studied {it index $2$} Gauss sums, where the group generated by the characteristic $p$ of the underling finite field is of index $2$ in the unit group of ${mathbb Z}/m{mathbb Z}$ for the order $m$ of the multiplicative character involved. A complete solution to the problem of evaluating index $2$ Gauss sums was given by Yang and Xia~(2010). In particular, it is known that some nonzero integral powers of the Gauss sums in this case are in quadratic fields. On the other hand, Chowla~(1962), McEliece~(1974), Evans~(1977, 1981) and Aoki~(1997, 2004, 2012) studied {it pure} Gauss sums, some nonzero integral powers of which are in the field of rational numbers. In this paper, we study Gauss sums, some integral powers of which are in quadratic fields. This class of Gauss sums is a generalization of index $2$ Gauss sums and an extension of pure Gauss sums to quadratic fields.
The explicit formulas expressing harmonic sums via alternating Euler sums (colored multiple zeta values) are given, and some explicit evaluations are given as applications.
We propose higher-order generalizations of Jacobsthals $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $binom{ip}{p}$ ($i=1,2,dots$) that are divisible by arbitrarily large powers of prime $p$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
