On the asymptotic minimum number of monochromatic 3-term arithmetic progressions (Q2469204): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the number of monochromatic Schur triples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Schur properties of random subsets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of monochromatic Schur triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank

Revision as of 15:20, 27 June 2024

scientific article
Language Label Description Also known as
English
On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
scientific article

    Statements

    Identifiers