Rich'ard Palincza

most citedSets avoiding six-term arithmetic progressions in

Z_{6}^{n}

are exponentially small

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2020★ 1 cited

Sets avoiding six-term arithmetic progressions in $Z_{6}^{n}$ are exponentially small

Péter Pál Pach, Richárd Palincza

We show that sets avoiding 6-term arithmetic progressions in $Z_{6}^{n}$ have size at most $5.70 9^{n}$ . 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 $A$ of natural numbers possesses property $P_{h}$ , if there are no distinct elements $a_{0}, a_{1}, \dots, a_{h} \in A$ with $a_{0}$ dividing the product $a_{1} a_{2} \dots a_{h}$ . Erdő…

math.CO2018

The number of maximum primitive sets of integers

Hong Liu, Péter Pál Pach, Richárd Palincza

A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f (n)$ the number of maximum-size primitive subsets of ${1, \dots, 2 n}$ . We pr…

Sets avoiding six-term arithmetic progressions in Z6n​ are exponentially small

The counting version of a problem of Erdős

The number of maximum primitive sets of integers

Sets avoiding six-term arithmetic progressions in $Z_{6}^{n}$ are exponentially small