Polynomial configurations in subsets of random and pseudo-random sets

DOI10.1016/j.jnt.2015.12.011zbMath1401.11014OpenAlexW2310381493MaRDI QIDQ271783

Elad Aigner-Horev, Hiệp Hàn

Publication date: 20 April 2016

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2015.12.011

zbMATH Keywords

Furstenberg-Sárközy theorempolynomial configurationspseudo-random subsetsrandom subsetstransference problems

Mathematics Subject Classification ID

Density, gaps, topology (11B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Hypergraph containers
• The primes contain arbitrarily long polynomial progressions
• Difference sets without squares
• Roth's theorem in the primes
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Difference sets without \(\kappa\)-th powers
• On arithmetic structures in dense sets of integers
• Restriction and Kakeya phenomena for finite fields
• On triples in arithmetic progression
• Extremal results in sparse pseudorandom graphs
• On Certain Sets of Positive Density
• On Two-Point Configurations in a Random Set
• On Sets of Natural Numbers Whose Difference Set Contains No Squares
• On difference sets of sequences of integers. I
• Independent sets in hypergraphs
• Improved Bounds on Sárközy’s Theorem for Quadratic Polynomials
• Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
• A restriction theorem for the Fourier transform

This page was built for publication: Polynomial configurations in subsets of random and pseudo-random sets