Pages that link to "Item:Q2640635"
From MaRDI portal
The following pages link to Integer sets containing no arithmetic progressions (Q2640635):
Displaying 46 items.
- On certain other sets of integers (Q351354) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small (Q509698) (← links)
- A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. II (Q616382) (← links)
- On Roth's theorem on progressions (Q640798) (← links)
- Arithmetic progressions, different regularity lemmas and removal lemmas (Q746166) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Finding large 3-free sets. I. The small \(n\) case (Q927879) (← links)
- On distinct distances and \(\lambda \)-free point sets (Q998391) (← links)
- Polynomial configurations in difference sets (Q999722) (← links)
- A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression (Q1009170) (← links)
- Arithmetical progressions and the number of sums (Q1203463) (← links)
- Greedy algorithm, arithmetic progressions, subset sums and divisibility (Q1301639) (← links)
- Progression-free sets in finite abelian groups. (Q1421306) (← links)
- Additive combinatorics and graph theory (Q1620873) (← links)
- On subsets of finite Abelian groups with no 3-term arithmetic progressions (Q1894019) (← links)
- A generalization of Roth's theorem in function fields (Q1931928) (← links)
- Erdős and the integers (Q1961096) (← links)
- Roth's theorem in many variables (Q2017118) (← links)
- Improved bound in Roth's theorem on arithmetic progressions (Q2039550) (← links)
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS (Q2794648) (← links)
- A Prime Analogue of Roth’s Theorem in Function Fields (Q2808220) (← links)
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets (Q2845628) (← links)
- Solving<i>xz</i>=<i>y</i><sup>2</sup>in Certain Subsets of Finite Groups (Q2987023) (← links)
- Testability and repair of hereditary hypergraph properties (Q3057063) (← links)
- Generalizations of Fourier analysis, and how to apply them (Q3178746) (← links)
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1. (Q3188349) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A new proof of Roth’s theorem on arithmetic progressions (Q3617566) (← links)
- A GENERALIZATION OF ROTH'S THEOREM IN FUNCTION FIELDS (Q3652592) (← links)
- New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
- NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR (Q4604480) (← links)
- A Polylogarithmic Bound in the Nonlinear Roth Theorem (Q5075173) (← links)
- MATRIX PROGRESSIONS IN MULTIDIMENSIONAL SETS OF INTEGERS (Q5179250) (← links)
- ON IMPROVING ROTH'S THEOREM IN THE PRIMES (Q5179251) (← links)
- Logarithmic bounds for Roth's theorem via almost-periodicity (Q5211003) (← links)
- Perfect Hash Families: Constructions and Existence (Q5295346) (← links)
- On a problem of Gowers (Q5395524) (← links)
- (Q5431583) (← links)
- On sets of integers which contain no three terms in geometric progression (Q5501150) (← links)
- From harmonic analysis to arithmetic combinatorics (Q5503659) (← links)
- Tower-type bounds for Roth's theorem with popular differences (Q6056476) (← links)
- Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes (Q6146587) (← links)
- Roth-type theorem for quadratic system in Piatetski-Shapiro primes (Q6187113) (← links)
- Quantitative bounds in the nonlinear Roth theorem (Q6647736) (← links)
- Improved bounds for five-term arithmetic progressions (Q6659641) (← links)