Péter Pál Pach
Research Subjects
Research Interests
Péter Pál Pach has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Csaba Sándor
Department of Stochastics, Institute of Mathemetics, Budapest University of Technology and Economics, Műegyetem rkp. 3, H-1111 Budapest, Hungary; and HUN-REN Alfréd Rényi Institute of Mathematics, Reáltanoda utca 13–15, H-1053 Budapest, Hungary; and MTA–HUN-REN RI Lendület “Momentum” Arithmetic Combinatorics Research Group, Reáltanoda utca 13–15, H-1053 Budapest, Hungary
1 shared publication - Dániel Varga
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
1 shared publication - János Nagy
MTA–BME Lendület “Momentum” Arithmetic Combinatorics Research Group, Műegyetem rkp. 3., H-1111 Budapest, Hungary; and Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Műegyetem rkp. 3., H-1111 Budapest, Hungary
1 shared publication - Máté Matolcsi
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
1 shared publication - Vsevolod F. Lev
Department of Mathematics, The University of Haifa at Oranim, Tivon, Israel
1 shared publication
Latest Publications
- Open Access
Product representations of perfect powers
Let $ρ_k(N)$ denote the maximum size of a set $A\subseteq \{1,2,\dots,N\}$ such that no product of $k$ distinct elements of $A$ is a perfect $d$-th power. In this short note, we prove that $ρ_d(N)=\sum\limits_{k=1}^{d-1}π\left( \frac{N}{k} \right) +O_d(π(N^{1/2}))$, furthermore, for prime power $d$ and sufficiently large $N$ we have $ρ_d(N)=\sum\limits_{k=1}^{d-1}π\left( \frac{N}{k} \right)$. This answers a question of Verstraëte.Open AccessProduct representations of perfect powers
Let $ρ_k(N)$ denote the maximum size of a set $A\subseteq \{1,2,\dots,N\}$ such that no product of $k$ distinct elements of $A$ is a perfect $d$-th power. In this short note, we prove that $ρ_d(N)=\sum\limits_{k=1}^{d-1}π\left( \frac{N}{k} \right) +O_d(π(N^{1/2}))$, furthermore, for prime power $d$ and sufficiently large $N$ we have $ρ_d(N)=\sum\limits_{k=1}^{d-1}π\left( \frac{N}{k} \right)$. This answers a question of Verstraëte. - Open Access
On the density of Kravitz sets
We show that for a subset $A$ of the cyclic group of prime order $p>3$, if the sumset $A+A-2A$ is not the whole group, then $|A|\le \frac27\,p$. Besides combinatorial arguments, we utilize a general technique involving linear programming.Open AccessOn the density of Kravitz sets
We show that for a subset $A$ of the cyclic group of prime order $p>3$, if the sumset $A+A-2A$ is not the whole group, then $|A|\le \frac27\,p$. Besides combinatorial arguments, we utilize a general technique involving linear programming. - Open Access
Equidistribution of subset sums
We answer a question of Katona and Makar-Limanov, by showing that in an abelian group of order $2h$ the $h$-element subset sums are asymptotically (as $h\to \infty$) equidistributed. In fact we prove a more general result where the order of the group can be arbitrary, also providing a bound for the ``error term''.Open AccessEquidistribution of subset sums
We answer a question of Katona and Makar-Limanov, by showing that in an abelian group of order $2h$ the $h$-element subset sums are asymptotically (as $h\to \infty$) equidistributed. In fact we prove a more general result where the order of the group can be arbitrary, also providing a bound for the ``error term''. - Open Access
A sumset version of a conjecture of Pilz
Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least $n$ values appear an odd number of times. In this short note we consider a variant of this problem. Namely, we show that in the sumset $\{a_1,2a_1,\dots,na_1\}+\dots+\{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least $n$ values appear an odd number of times.Open AccessA sumset version of a conjecture of Pilz
Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least $n$ values appear an odd number of times. In this short note we consider a variant of this problem. Namely, we show that in the sumset $\{a_1,2a_1,\dots,na_1\}+\dots+\{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least $n$ values appear an odd number of times.