4 citations · 11 across the 8 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2015★ 1 cited
Improved bounds for arithmetic progressions in product sets
Dmitry Zhelezov
Let be a set of natural numbers of size . We prove that the length of the longest arithmetic progression contained in the product set cannot…
math.NT2015
On sets with small additive doubling in product sets
Dmitry Zhelezov
Following the sum-product paradigm, we prove that for a set with polynomial growth, the product set cannot contain large subsets with size of order with small dou…
math.NT2013
Product sets cannot contain long arithmetic progressions
Dmitry Zhelezov
Let be a set of natural numbers of size . We prove that the length of the longest arithmetic progression contained in the product set cannot…