P'eter P'al Pach

activity

20112022

n

-smooth numbers with

n

colors

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

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Avoiding right angles and certain Hamming distances

Balázs Bursics, Dávid Matolcsi, Péter Pál Pach +1

In this paper we show that the largest possible size of a subset of $F_{q}^{n}$ avoiding right angles, that is, distinct vectors $x, y, z$ such that $x - z$ and $y - z$ are perpendi…

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ő…

Avoiding right angles and certain Hamming distances

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

The counting version of a problem of Erdős

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