Péter Pál Pach

Discrete Mathematics and Combinatorics · 2016–2017

A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 6 citations into it

Whom Péter Pál Pach trusts

Their strongest outbound trust, strongest first, inferred from their citations.

1. Tom Sanders (in Discrete Mathematics and Combinatorics)

Papers from Péter Pál Pach's perspective

Ordered by how strongly the researchers Péter Pál Pach trusts endorse each paper. Same corpus, a different order for every researcher.

1. New Bounds on cap sets
2. On the Bogolyubov–Ruzsa lemma
3. A Probabilistic Technique for Finding Almost-Periods of Convolutions
4. Sets with Small Sumset and Rectification
5. COMPRESSIONS, CONVEX GEOMETRY AND THE FREIMAN–BILU THEOREM
6. On a Generalization of Szemerédi's Theorem
7. Finite field models in additive combinatorics
8. Additive Combinatorics: Long arithmetic progressions in sum sets
9. An inverse theorem for the Gowers U^3 norm
10. Roth's theorem in the primes

Their papers

• Progression-free sets in $\mathbb Z_4^n$ are exponentially small (2017) — 80 citations
• Progression-free sets in Z_4^n are exponentially small (2016) — 150 citations