activity
20162022
most citedSets avoiding six-term arithmetic progressions in are exponentially small

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

collaborators

10 papers

math.CO2022

Towards characterizing the 2-Ramsey equations of the form

Zsolt Baja, Dániel Dobák, Benedek Kovács +2

In this paper, we study a Ramsey-type problem for equations of the form . We show that if certain technical assumptions hold, then any 2-colouring of the positive integ…

math.CO20211 cited

The Alon-Jaeger-Tarsi conjecture via group ring identities

János Nagy, Péter Pál Pach

In this paper we resolve the Alon-Jaeger-Tarsi conjecture for sufficiently large primes. Namely, we show that for any finite field of size and a…

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 avoiding right angles, that is, distinct vectors such that and are perpendi…

math.CO20201 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ő…

math.CO2019

Caps and progression-free sets in

Christian Elsholtz, Péter Pál Pach

We study progression-free sets in the abelian groups . Let denote the maximal size of a set that does not con…