1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2020★ 1 cited
Sets avoiding six-term arithmetic progressions in are exponentially small
Péter Pál Pach, Richárd Palincza
We show that sets avoiding 6-term arithmetic progressions in have size at most . It is also pointed out that the "product construction" does not work in t…
math.CO2020
The counting version of a problem of Erdős
Péter Pál Pach, Richárd Palincza
A set of natural numbers possesses property , if there are no distinct elements with dividing the product . Erdő…