Sökning: "Svante Linusson"

Visar resultat 1 - 5 av 11 avhandlingar innehållade orden Svante Linusson.

  1. 1. A Markov Process on Cyclic Words

    Författare :Erik Aas; Svante Linusson; Sylvie Corteel; KTH; []

    Sammanfattning : The TASEP (totally asymmetric simple exclusion process) studied here is a Markov chain on cyclic words over the alphabet{1,2,...,n} given by at each time step sorting an adjacent pair of letters chosen uniformly at random. LÄS MER

  2. 2. 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

  3. 3. Topological Combinatorics

    Författare :Alexander Engström; Svante Linusson; Günter M. Ziegler; KTH; []

    Sammanfattning : This thesis on Topological Combinatorics contains 7 papers. All of them but paper Bare published before.In paper A we prove that!i dim ˜Hi(Ind(G);Q) ! |Ind(G[D])| for any graph G andits independence complex Ind(G), under the condition that G\D is a forest. LÄS MER

  4. 4. The k-assignment Polytope and the Space of Evolutionary Trees

    Författare :Jonna Gill; Svante Linusson; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; k-assignment; polytope; Birkhoff polytope; bipartite graphs; MATHEMATICS; MATEMATIK;

    Sammanfattning : This thesis consists of two papers.The first paper is a study of the structure of the k-assignment polytope, whose vertices are the m x n (0; 1)-matrices with exactly k 1:s and at most one 1 in each row and each column. LÄS MER

  5. 5. Algebraic and geometric combinatorics of graphs

    Författare :Patrik Norén; Svante Linusson; Carsten Schulz; KTH; []

    Sammanfattning : .... LÄS MER