[feed] pefprints@pef.uni-lj.si | [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0 |
  Logo Login | Create Account

Schur Numbers

Urška Lamovec (2018) Schur Numbers. Diploma thesis.

Download (967Kb)


    In the thesis, Schur's theorem on sum-free partitions is proven and Schur number S(n) is defined as the largest positive integer with the property that the set {1,...,S(n)} can be partitioned into n sum-free subsets. Values of known Schur numbers S(1) to S(5) are given as well as some upper and lower bounds for general S(n). Weak Schur numbers are also defined. Moreover, Schur's theorem is formulated as a graph coloring problem and presented as a corollary of Ramsey theorem. In conclusion, Schur's theorem is linked to Fermat's last theorem. Schur's simplification of Dickson's proof that equation x^n+y^n=z^n for fixed n > 2 has nontrivial solutions in Z_p for all sufficiently large prime p is given.

    Item Type: Thesis (Diploma thesis)
    Keywords: sum-free set, sum-free partition, Schur's theorem, Schur number, weak Schur number, graph coloring, Fermat's last theorem
    Number of Pages: 42
    Language of Content: Slovenian
    Mentor / Comentors:
    Mentor / ComentorsIDFunction
    doc. dr. Boštjan KuzmanMentor
    Link to COBISS: https://plus.si.cobiss.net/opac7/bib/peflj/12151113
    Institution: University of Ljubljana
    Department: Faculty of Education
    Item ID: 5386
    Date Deposited: 25 Sep 2018 16:16
    Last Modified: 25 Sep 2018 16:16
    URI: http://pefprints.pef.uni-lj.si/id/eprint/5386

    Actions (login required)

    View Item