(k+1)-sums versus k-sums

MaRDI QIDQ2855554zbMATHFDO

Authors Simon Griffiths

Publication date 25 October 2013

Published in Integers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1011.4495

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

subset sumssum representationcomplete subsets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Abstract: A $k$-sum of a set $AsubseteqmathbbZ$ 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 $kwedgeA$ 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.

Recommendations

• On the sum of \(k\)-th powers in terms of earlier sums
• Sums of \(k\)-bonacci numbers
• The (integral) sum number of \(K_n-E(K_r)\)
• Sums of Kloosterman Sums Over Arithmetic Progressions
• Sums of Kloosterman sums revisited
• On sums of hyper-Kloosterman sums

Cited in

(5)

• Cofinite subsets of asymptotic bases for the positive integers
• Additive properties for sets of polynomial values
• The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite
• scientific article; zbMATH DE number 5219611 (Why is no real title available?)
• A mean value density theorem of additive number theory

This page was built for publication: \((k+1)\)-sums versus \(k\)-sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2855554)