Binary linear forms over finite sets of integers
From MaRDI portal
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)|.
Recommendations
- A lower bound for the size of a sum of dilates
- On the diophantine approximation of linear forms
- Sur une propriété de minimum attachée aux systèmes de numération.
- Inverse problems for linear forms over finite sets of integers
- Values of binary linear forms at prime arguments
- Problems in additive number theory. I
- Small solutions of congruences
- On a problem in diophantine analysis.
- A note on the equation $ax^n - by^n = c$
- Remarks on linear independence of certain \(q\)-series
Cited in
(13)- Linearly dependent powers of binary quadratic forms
- On a sumset problem for integers
- A note on the size of the set \(A^2+A\)
- On the Length of Binary Forms
- A lower bound for the size of a Minkowski sum of dilates
- Sets of Linear Forms Which Are Hard to Compute
- Linear forms in finite sets of integers
- On a sumset problem of dilates
- Minimal sizes of binary linear forms
- Comparison estimates for linear forms in additive number theory
- Sidon sets for linear forms
- When almost all sets are difference dominated
- Inverse problems for linear forms over finite sets of integers
This page was built for publication: Binary 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 Q5423570)
