Péter Pál Pach

According to our database, Péter Pál Pach authored at least 24 papers between 2011 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

A Sumset Version of a Conjecture of Pilz.

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

SIAM J. Discret. Math., 2026

Product representation of perfect cubes.

Zsigmond György Fleiner, Márk Hunor Juhász, Blanka Kövér, Péter Pál Pach, Csaba Sándor

Eur. J. Comb., 2026

2025

Maximal line-free sets in $\mathbb {F}_p^n$.

Christian Elsholtz, Jakob Führer, Erik Füredi, Benedek Kovács, Péter Pál Pach, Dániel Gábor Simon, Nóra Velich

Period. Math. Hung., March, 2025

2024

On sumsets of nonbases of maximum size.

Béla Bajnok, Péter Pál Pach

Eur. J. Comb., 2024

2023

Towards characterizing the 2-Ramsey equations of the form <i>ax</i> + <i>by</i> = <i>p</i>(<i>z</i>).

Zsolt Baja, Dániel Dobák, Benedek Kovács, Péter Pál Pach, Donát Pigler

Discret. Math., May, 2023

Improved Lower Bounds for Multiplicative Square-Free Sequences.

Péter Pál Pach, Máté Vizer

Electron. J. Comb., 2023

2022

Polynomial Schur's Theorem.

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

Comb., December, 2022

Sets Avoiding Six-Term Arithmetic Progressions in $\mathbb{Z}_6^{n}$ are Exponentially Small.

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

SIAM J. Discret. Math., 2022

A counterexample to the lights out problem.

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

J. Graph Theory, 2022

2021

The number of maximum primitive sets of integers.

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

Comb. Probab. Comput., 2021

Coloring the $n$-Smooth Numbers with $n$ Colors.

Andrés Eduardo Caicedo, Thomas A. C. Chartier, Péter Pál Pach

Electron. J. Comb., 2021

2020

The counting version of a problem of Erdős.

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

Eur. J. Comb., 2020

Caps and progression-free sets in ${{\mathbb {Z}}}_m^n$.

Christian Elsholtz, Péter Pál Pach

Des. Codes Cryptogr., 2020

2019

The number of multiplicative Sidon sets of integers.

Hong Liu, Péter Pál Pach

J. Comb. Theory A, 2019

The step Sidorenko property and non-norming edge-transitive graphs.

Daniel Král', Taísa L. Martins, Péter Pál Pach, Marcin Wrochna

J. Comb. Theory A, 2019

On infinite multiplicative Sidon sets.

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

Eur. J. Comb., 2019

On the density of sumsets and product sets.

Norbert Hegyvári, François Hennecart, Péter Pál Pach

Australas. J Comb., 2019

2018

Multiplicative Bases and an Erdős Problem.

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

Comb., 2018

2014

Remarks On Commuting Graph of a Finite Group.

Mahsa Mirzargar, Péter Pál Pach, Ali Reza Ashrafi

Electron. Notes Discret. Math., 2014

2013

A new operation on partially ordered sets.

Péter Pál Pach, Michael Pinsker, András Pongrácz, Csaba A. Szabó

J. Comb. Theory A, 2013

Ramsey Type Results on the Solvability of Certain Equation in Zm.

Péter Pál Pach

Integers, 2013

The Number of Rooted Trees of Given Depth.

Péter Pál Pach, Gabriella Pluhár, András Pongrácz, Csaba A. Szabó

Electron. J. Comb., 2013

2012

On Free Algebras in Varieties Generated by Iterated Semidirect Products of Semilattices.

Gábor Horváth, Kamilla Kátai-Urbán, Péter Pál Pach, Gabriella Pluhár, András Pongrácz, Csaba A. Szabó

Int. J. Algebra Comput., 2012

2011

On the minimal distance of a polynomial code.

Péter Pál Pach, Csaba A. Szabó

Discret. Math. Theor. Comput. Sci., 2011