On sets without \(k\)-term arithmetic progression (Q414926): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044413646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large 3-free sets. I. The small \(n\) case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / 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: Q4444404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Sets which meet all the <i>n</i> -Term Arithmetic Progressions in the Interval [1, n<sup>2</sup> ] / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-Free Sequences of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377514 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:16, 5 July 2024

scientific article
Language Label Description Also known as
English
On sets without \(k\)-term arithmetic progression
scientific article

    Statements

    On sets without \(k\)-term arithmetic progression (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    arithmetic progression
    0 references
    Szemerédi's theorem
    0 references
    search algorithm
    0 references
    dynamic programming
    0 references
    0 references