Quantitative theorems for regular systems of equations (Q1108271): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Peter Frankl / rank
 
Normal rank
Property / author
 
Property / author: Ronald L. Graham / rank
 
Normal rank

Revision as of 04:11, 10 February 2024

scientific article
Language Label Description Also known as
English
Quantitative theorems for regular systems of equations
scientific article

    Statements

    Quantitative theorems for regular systems of equations (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    Rado defined a matrix \(L\) with integral coefficients to be partition regular if for every partition of the set of all natural numbers into finitely many classes there exist elements \(x_1,\ldots,x_n\) contained in one class such that \(L(x_1,\ldots,x_n)=0\). [For background cf. \textit{W. A. Deuber}, Developments based on Rado's Dissertation ``Studien zur Kombinatorik'', in: Surveys in combinatorics, Inv. Pap. 12th Br. Comb. Conf., Norwich/UK 1989, Lond. Math. Soc. Lect. Note Ser. 141, 52--74 (1989; Zbl 0768.05001).] It is shown that for \(N\to \infty\) and colorings of \(\{1,\ldots,N\}\) with \(r\) colors a positive fraction of the solutions of the partition regular system \(Lx=0\) in \(\{1,\ldots,N\}\) are monochromatic. The case of partition regular systems for which a density version holds (like arithmetic progressions) is discussed as well as the case of partitions with an arbitrary number of classes.
    0 references
    0 references
    0 references
    0 references
    0 references
    number of solutions
    0 references
    Ramsey theory
    0 references
    systems of equations
    0 references
    partition regular system
    0 references
    0 references