Sets without <i>k</i>‐term progressions can have many shorter progressions (Q6049996)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sets without k‐term progressions can have many shorter progressions |
scientific article; zbMATH DE number 7748581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sets without <i>k</i>‐term progressions can have many shorter progressions |
scientific article; zbMATH DE number 7748581 |
Statements
Sets without <i>k</i>‐term progressions can have many shorter progressions (English)
0 references
11 October 2023
0 references
additive combinatorics
0 references
arithmetic progressions
0 references
probabilistic methods
0 references
Szemerédi's theorem
0 references
0.88858527
0 references
0.83122754
0 references
0.82479036
0 references
0.82037747
0 references
0.8178138
0 references
0.8144047
0 references
