P'eter P'al Pach

activity

20162022

most citedSets avoiding six-term arithmetic progressions in

Z_{6}^{n}

are exponentially small

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

collaborators

Showing 2018Show all

3 papers · 1 filter

math.NT2018

Polynomial Schur's theorem

Hong Liu, Péter Pál Pach, Csaba Sándor

We resolve the Ramsey problem for ${x, y, z : x + y = p (z)}$ for all polynomials $p$ over $Z$ . In particular, we characterise all polynomials that are $2$ -Ramsey, that is, those…

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…

math.NT2018

An improved upper bound for the size of the multiplicative 3-Sidon sets

Péter Pál Pach

We say that a set is a multiplicative 3-Sidon set if the equation $s_{1} s_{2} s_{3} = t_{1} t_{2} t_{3}$ does not have a solution consisting of distinct elements taken from this set. In this paper…