Inverse problems for linear forms over finite sets of integers

Abstract

Let f(x1,x2,...,xm) = u1x1+u2 x2+... + umxm be a linear form with positive integer coefficients, and let Nf(k) = min|f(A)| : A ⊂eq Z and |A|=k. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = Nf(k). A finite sequence (u1, u2,...,um) of positive integers is called complete if Σj∈ J uj : J ⊂eq 1,2,..,m = 0,1,2,..., U, where U = Σj=1m uj. It is proved that if f is an m-ary linear form whose coefficient sequence (u1,...,um) is complete, then Nf(k) = Uk-U+1 and the minimizing k-sets are precisely the arithmetic progressions of length k. Other extremal results on linear forms over finite sets of integers are obtained.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…