Sökning: "Discrete Mathematics"

Visar resultat 6 - 10 av 282 avhandlingar innehållade orden Discrete Mathematics.

  1. 6. Game theory and applications

    Författare :Carl-Joar Karlsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; non-cooperative game theory; prisoner s dilemma; disease; distribution; compartmental model; epidemiological model; game theory; equilibrium strategy;

    Sammanfattning : Individual-level interactions and decisions spread though populations and change the collective-level dynamics in an intricate way. Nevertheless, game theory is well suited for the unification of these viewpoints. LÄS MER

  3. 7. 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 :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

  4. 8. Digital Geometry, Combinatorics, and Discrete Optimization

    Författare :Shiva Samieinia; Christer Kiselman; Rikard Bøgvad; Rémy Malgouyres; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Digital geometry; Khalimsky topology; Khalimsky plane; Khalimsky-continuous function; digital straight line segments; discrete optimization; discrete convexity; integral convexity; lateral convexity; marginal function; MATHEMATICS; MATEMATIK; Mathematics; matematik;

    Sammanfattning : This thesis consists of two parts: digital geometry and discrete optimization. In the first part we study the structure of digital straight line segments. We also study digital curves from a combinatorial point of view. LÄS MER

  5. 9. On Latin squares and avoidable arrays

    Författare :Lina J. Andrén; Roland Häggkvist; Kimmo Eriksson; Umeå universitet; []
    Nyckelord :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

  7. 10. On some graph coloring problems

    Författare :Carl Johan Casselgren; Roland Häggkvist; Svante Linusson; Umeå universitet; []
    Nyckelord :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