Binary linear forms over finite sets of integers
Melvyn B. Nathanson, Kevin O'Bryant, Brooke Orosz, Imre Ruzsa, Manuel Silva
Abstract
Let A be a finite set of integers. For a polynomial f(x1,...,xn) with integer coefficients, let f(A) = f(a1,...,an) : a1,...,an ∈ A. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u1x+v1y and g(x,y)=u2x+v2y 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)|.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan