arXiv · math/0701001
Binary linear forms over finite sets of integers
Abstract
Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y and g(x,y)=u_2x+v_2y with integral coefficients, there exist arbitrarily large finite sets of integers A and B such that |f(A)| > |g(A)| and |f(B)| < |g(B)|.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Melvyn B. Nathanson, Kevin O'Bryant, Brooke Orosz, Imre Ruzsa, Manuel Silva. 2007-01-02. Binary linear forms over finite sets of integers. https://doi.org/10.4064/aa129-4-5
Cite the original work for its findings. Save a collection to share your selection of sources.