Inverse problems for linear forms over finite sets of integers
From MaRDI portal
Publication:3597602
zbMATH Open1163.11067arXiv0708.2304MaRDI QIDQ3597602FDOQ3597602
Authors: Melvyn B. Nathanson
Publication date: 9 February 2009
Abstract: Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A finite sequence (u_1, u_2,...,u_m) of positive integers is called complete if {sum_{jin J} u_j : J subseteq {1,2,..,m}} = {0,1,2,..., U}, where It is proved that if f is an m-ary linear form whose coefficient sequence (u_1,...,u_m) is complete, then N_f(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.
Full work available at URL: https://arxiv.org/abs/0708.2304
Recommendations
Other combinatorial number theory (11B75) Arithmetic progressions (11B25) Recurrences (11B37) Inverse problems of additive number theory, including sumsets (11P70)
Cited In (13)
- On some direct and inverse results concerning sums of dilates
- Direct and inverse problems in additive number theory and in non-abelian group theory
- Sums of Linear Transformations in Higher Dimensions
- On a sumset problem for integers
- Binary linear forms over finite sets of integers
- On a sumset problem for dilated integer sets
- On sumset problems and their various types
- Title not available (Why is that?)
- On a sumset problem of dilates
- Remark on linear forms
- Minimal sizes of binary linear forms
- Sidon sets for linear forms
- A question of Bukh on sums of dilates
This page was built for publication: Inverse problems for linear forms over finite sets of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597602)