Pages that link to "Item:Q540042"
From MaRDI portal
The following pages link to Sets of integers that do not contain long arithmetic progressions (Q540042):
Displayed 13 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- A generalization of sets without long arithmetic progressions based on Szekeres algorithm (Q740905) (← links)
- A new lower bound for van der Waerden numbers (Q1686261) (← links)
- Threshold functions and Poisson convergence for systems of equations in random sets (Q1706093) (← links)
- A note on multiparty communication complexity and the Hales-Jewett theorem (Q1799572) (← links)
- The number of \(k\)-dimensional corner-free subsets of grids (Q2152792) (← links)
- Improved bounds on the dimensions of sets that avoid approximate arithmetic progressions (Q2657387) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Szemerédi's Theorem in the Primes (Q4631377) (← links)
- Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
- Dimensions of Sets Which Uniformly Avoid Arithmetic Progressions (Q5855165) (← links)
- A blurred view of Van der Waerden type theorems (Q5886338) (← links)