Growth polynomials for additive quadruples and (h,k)-tuples

DOI10.1007/S10474-014-0402-8MaRDI QIDQ396993zbMATHOpenAlexFDO

Authors Melvyn B. Nathanson

Publication date 14 August 2014

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

additive number theorypolynomial growthadditive \((h,k)\)-tupleadditive quadruple

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Arithmetic combinatorics; higher degree uniformity (11B30) Representation functions (11B34) Inverse problems of additive number theory, including sumsets (11P70)

Abstract: Consider the interval of integers $I_{m,n}=m,m+1,m+2,ldots,m+n-1$. For fixed integers $h,k,m$, and $c$, let $Ph{i}_{h,k,m}^{(c)}(n)$ denote the number of solutions of the equation $(a_1+cdots+a_h)-(a_{h+1}+cdots+a_{h+k})=c$ with $a_{i}in{I}_{m,n}$ for all $i=1,ldots,h+k$. This is a polynomial in $n$ for all sufficiently large $n$, and the growth polynomial is constructed explicitly.

Recommendations

• Sums of Finite Sets of Integers, II
• EQUAL SUMS OF LIKE POLYNOMIALS
• The polynomial method and restricted sums of congruence classes
• On the additive completion of polynomial sets
• Additive problem with \(k\) numbers of a special form

Cites work

• scientific article; zbMATH DE number 933467 (Why is no real title available?)
• Additive combinatorics
• Finite field models in additive combinatorics
• Freiman's theorem in finite fields via extremal set theory
• New bounds on cap sets
• Orthogonal Designs and a Cubic Binary Function

Cited in

(1)

• Maximising the number of solutions to a linear equation in a set of integers

This page was built for publication: Growth polynomials for additive quadruples and \((h,k)\)-tuples

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