A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.

From MaRDI portal
Publication:3188349

DOI10.1112/jlms/jdw010zbMath1364.11024arXiv1405.5800OpenAlexW3105325455WikidataQ56341564 ScholiaQ56341564MaRDI QIDQ3188349

Thomas F. Bloom

Publication date: 19 August 2016

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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




Related Items (49)

Logarithmic bounds for Roth's theorem via almost-periodicityAdditive combinatorics and graph theoryGeneralizations of Fourier analysis, and how to apply themThe equidistant dimension of graphsShort proofs of some extremal results. II.On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphsNew applications of the polynomial method: The cap set conjecture and beyondImproved bounds on the dimensions of sets that avoid approximate arithmetic progressionsOn solution-free sets of integersAn application of the sum-product phenomenon to sets avoiding several linear equationsImproved bounds for progression-free sets in \(C_8^n\)Monochromatic Hilbert cubes and arithmetic progressionsCovering the Large Spectrum and Generalized Riesz ProductsA new lower bound for van der Waerden numbersTower-type bounds for Roth's theorem with popular differencesFour‐term progression free sets with three‐term progressions in all large subsetsRoth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primesExtremal problems in hypergraph colouringsQuantitative structure of stable sets in finite abelian groupsRoth-type theorem for quadratic system in Piatetski-Shapiro primesNEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FORThreshold functions and Poisson convergence for systems of equations in random setsIndependent Sets in Hypergraphs and Ramsey Properties of Graphs and the IntegersRamsey-type numbers involving graphs and hypergraphs with large girthArithmetic Progressions in the Graphs of Slightly Curved SequencesEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsSzemerédi's Theorem in the PrimesThe Erdős–Moser Sum-free Set ProblemThe Green-Tao theorem: an expositionBounds for sets with no polynomial progressionsOn the structure of the spectrum of small setsQuantitative bounds in the polynomial Szemerédi theorem: the homogeneous caseProgression-free sets in \(\mathbb{Z}_4^n\) are exponentially smallOn the complexity of finding and counting solution-free sets of integersAn improved lower bound related to the Furstenberg-Sárközy theoremA subexponential upper bound for van der Waerden numbers \(W(3,k)\)On the missing log in upper tail estimatesFinite field models in arithmetic combinatorics -- ten years onImproved bound in Roth's theorem on arithmetic progressionsLocal Properties via Color Energy Graphs and Forbidden ConfigurationsOn the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier supportA short remark on the multiplicative energy of the spectrumOn sets with small sumset and m-sum-free sets in Z/pZShape of the asymptotic maximum sum-free sets in integer lattice gridsA Roth-type theorem with mixed powersOn sets of integers which contain no three terms in geometric progressionFurther bounds in the polynomial SzemerImproved Bounds on Sizes of Generalized Caps in $AG(n,q)$Large sets avoiding linear patterns



Cites Work


This page was built for publication: A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.