Upper tails for arithmetic progressions in random subsets

DOI10.1007/s11856-017-1546-3zbMath1407.05238arXiv1612.08559OpenAlexW2309973790MaRDI QIDQ1678647

Lutz Warnke

Publication date: 17 November 2017

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.08559

zbMATH Keywords

arithmetic progressionsSchur triples\(k\)-uniform hypergraphs

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (18)

Normal limiting distributions for systems of linear equations in random sets ⋮ Upper tails via high moments and entropic stability ⋮ Packing nearly optimal Ramsey \(R(3,t)\) graphs ⋮ Replica symmetry in upper tails of mean-field hypergraphs ⋮ Deviation probabilities for arithmetic progressions and other regular discrete structures ⋮ Counting extensions revisited ⋮ Bounds on Ramsey games via alterations ⋮ Unnamed Item ⋮ Deviation probabilities for arithmetic progressions and irregular discrete structures ⋮ Local limit theorems for subgraph counts ⋮ Threshold functions and Poisson convergence for systems of equations in random sets ⋮ The lower tail: Poisson approximation revisited ⋮ On the missing log in upper tail estimates ⋮ Bivariate fluctuations for the number of arithmetic progressions in random sets ⋮ A counterexample to the DeMarco‐Kahn upper tail conjecture ⋮ Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\) ⋮ Upper tail bounds for stars ⋮ An extension of the Erdős‐Tetali theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal results for random discrete structures
• On the upper tail of counts of strictly balanced subgraphs
• Applications of Stein's method for concentration inequalities
• The large deviation principle for the Erdős-Rényi random graph
• On Schur properties of random subsets of integers
• Information inequalities and concentration of measure
• Concentration inequalities using the entropy method
• Upper tails for subgraph counts in random graphs
• Concentration of measure and isoperimetric inequalities in product spaces
• A BK inequality for randomly drawn subsets of fixed size
• Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
• The deletion method for upper tail estimates
• The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\)
• Counting extensions
• The lower tail: Poisson approximation revisited
• The missing log in large deviations for triangle counts
• Upper tails for triangles
• Ramsey properties of random discrete structures
• A concentration result with application to subgraph count
• Tight upper tail bounds for cliques
• On replica symmetry of large deviations in random graphs
• Concentration for self-bounding functions and an inequality of Talagrand
• Inequalities with applications to percolation and reliability
• Poisson approximation for large deviations
• Random graphs with monochromatic triangles in every edge coloring
• Concentration of non‐Lipschitz functions and applications
• The infamous upper tail
• THE CAMERON–ERDOS CONJECTURE
• New versions of Suen's correlation inequality
• Proof of the Van den Berg–Kesten Conjecture
• The Janson inequalities for general up‐sets
• Representations of integers as the sum of k terms
• On the Method of Typical Bounded Differences
• Stability results for random discrete structures
• When does the K₄‐free process stop?
• Concentration and Moment Inequalities for Polynomials of Independent Random Variables
• Concentration of Measure for the Analysis of Randomized Algorithms
• Concentration of multivariate polynomials and its applications

This page was built for publication: Upper tails for arithmetic progressions in random subsets