Pages that link to "Item:Q1758902"
From MaRDI portal
The following pages link to An improved construction of progression-free sets (Q1758902):
Displaying 50 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- On certain other sets of integers (Q351354) (← links)
- Unique sequences containing no \(k\)-term arithmetic progressions (Q396958) (← links)
- Nearly equal distances in metric spaces (Q400532) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Enumerating solution-free sets in the integers (Q509275) (← links)
- Extremal Betti numbers of Vietoris-Rips complexes (Q542387) (← links)
- On Roth's theorem on progressions (Q640798) (← links)
- Injective colorings with arithmetic constraints (Q897262) (← links)
- Novel structures in Stanley sequences (Q898128) (← links)
- Arithmetic progressions in multiplicative groups of finite fields (Q1686398) (← links)
- Threshold functions and Poisson convergence for systems of equations in random sets (Q1706093) (← links)
- On the complexity of finding and counting solution-free sets of integers (Q1752464) (← links)
- An improved construction of progression-free sets (Q1758902) (← links)
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- A note on multiparty communication complexity and the Hales-Jewett theorem (Q1799572) (← links)
- Coloring the cube with rainbow cycles (Q1953479) (← links)
- Caps and progression-free sets in \(\mathbb{Z}_m^n\) (Q2004972) (← links)
- Roth's theorem in many variables (Q2017118) (← links)
- Improved bound in Roth's theorem on arithmetic progressions (Q2039550) (← links)
- The equidistant dimension of graphs (Q2147613) (← links)
- The number of \(k\)-dimensional corner-free subsets of grids (Q2152792) (← links)
- An improved lower bound related to the Furstenberg-Sárközy theorem (Q2256129) (← links)
- On solution-free sets of integers (Q2403693) (← links)
- Sunflowers and testing triangle-freeness of functions (Q2410684) (← links)
- Finite field models in arithmetic combinatorics -- ten years on (Q2512891) (← links)
- ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS (Q2794648) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Some Properties of Lower Level-Sets of Convolutions (Q2908126) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← 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)
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers (Q4610452) (← links)
- Star Chromatic Index (Q4916092) (← links)
- Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols (Q5028500) (← links)
- A new upper bound for sets with no square differences (Q5041007) (← links)
- (Q5090432) (← links)
- New lower bounds for van der Waerden numbers (Q5093808) (← links)
- The Erdős–Moser Sum-free Set Problem (Q5146202) (← links)
- (Q5417675) (redirect page) (← links)
- Behrend-type constructions for sets of linear equations (Q5478114) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- New Results on Linear Size Distance Preservers (Q5858650) (← links)
- A blurred view of Van der Waerden type theorems (Q5886338) (← links)
- Tower-type bounds for Roth's theorem with popular differences (Q6056476) (← links)
- Four‐term progression free sets with three‐term progressions in all large subsets (Q6074701) (← links)
- On classification of sequences containing arbitrarily long arithmetic progressions (Q6133827) (← links)
- Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
- The Kelley-Meka bounds for sets free of three-term arithmetic progressions (Q6179071) (← links)
- Small subsets with large sumset: beyond the Cauchy-Davenport bound (Q6632812) (← links)
