Pages that link to "Item:Q1758902"

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)
• Sets of integers that do not contain long arithmetic progressions (Q540042) (← links)
• Extremal Betti numbers of Vietoris-Rips complexes (Q542387) (← links)
• On Roth's theorem on progressions (Q640798) (← links)
• Character-free approach to progression-free sets (Q765807) (← links)
• Injective colorings with arithmetic constraints (Q897262) (← links)
• Novel structures in Stanley sequences (Q898128) (← links)
• Triangle free sets and arithmetic progressions---two Pisier type problems (Q1597783) (← 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)
• Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs (Q2216926) (← 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)
• A note on maximal progression-free sets (Q2501553) (← links)
• Finite field models in arithmetic combinatorics -- ten years on (Q2512891) (← links)
• The maximal number of 3-term arithmetic progressions in finite sets in different geometries (Q2690128) (← links)
• Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions (Q2697487) (← 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)
• A Note on Elkin’s Improvement of Behrend’s Construction (Q2996309) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• (Q4520818) (← 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)
• Contructions of some new nonextandable P_k sets (Q5453872) (← links)