Maximal subsets free of arithmetic progressions in arbitrary sets (Q679856): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new proof of Szemerédi's theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Szemerédi's theorem and problems on arithmetic progressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Translation invariant equations and the method of Sanders / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear problems in combinatorial number theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Thick subsets that do not contain arithmetic progressions / rank | |||
Normal rank | |||
Latest revision as of 23:34, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximal subsets free of arithmetic progressions in arbitrary sets |
scientific article |
Statements
Maximal subsets free of arithmetic progressions in arbitrary sets (English)
0 references
22 January 2018
0 references
additive combinatorics
0 references
combinatorial number theory
0 references
