Sökning: "Discrete Mathematics"

Visar resultat 1 - 5 av 215 avhandlingar innehållade orden Discrete Mathematics.

  1. 1. Admissible transformations and the group classification of Schrödinger equations

    Författare :Celestin Kurujyibwami; Peter Basarab-Horwath; Roman Popovych; Pontelis Damianou; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : We study admissible transformations and solve group classification problems for various classes of linear and nonlinear Schrödinger equations with an arbitrary number n of space variables.The aim of the thesis is twofold. LÄS MER

  2. 2. Digital lines, Sturmian words, and continued fractions

    Författare :Hanna Uscka-Wehlou; Christer Oscar Kiselman; Maciej Klimek; Gunilla Borgefors; Mikael Passare; Damien Jamet; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; digital geometry; digital line; hierarchy of runs; combinatorics on words; Sturmian word; upper mechanical word; characteristic word; irrational slope; continued fraction; Gauss map; fixed point; Discrete mathematics; Diskret matematik; matematik; Mathematics;

    Sammanfattning : In this thesis we present and solve selected problems arising from digital geometry and combinatorics on words. We consider digital straight lines and, equivalently, upper mechanical words with positive irrational slopes a... LÄS MER

  3. 3. On Latin squares and avoidable arrays

    Författare :Lina J. Andrén; Roland Häggkvist; Kimmo Eriksson; Umeå universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Latin square; avoidability; avoidable array; Discrete mathematics; Diskret matematik; Mathematics; matematik;

    Sammanfattning : This thesis consists of the four papers listed below and a survey of the research area. I Lina J. Andrén: Avoiding (m, m, m)-arrays of order n = 2k II Lina J. Andrén: Avoidability of random arrays III Lina J. LÄS MER

  4. 4. On some graph coloring problems

    Författare :Carl Johan Casselgren; Roland Häggkvist; Svante Linusson; Umeå universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; List coloring; interval edge coloring; coloring graphs from random lists; biregular graph; avoiding arrays; Latin square; scheduling; Discrete mathematics; Diskret matematik; Mathematics; matematik;

    Sammanfattning : .... LÄS MER

  5. 5. Random Records and Cuttings in Binary Search Trees

    Författare :Cecilia Holmgren; Svante Janson; Anders Martin-Löf; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Discrete mathematics; Diskret matematik; Mathematics; Matematik;

    Sammanfattning : .... LÄS MER