Advanced search
Showing result 1 - 5 of 11 swedish dissertations matching the above criteria.
-
1. A Markov Process on Cyclic Words
Abstract : 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. READ MORE
-
2. On some graph coloring problems
Abstract : .... READ MORE
-
3. Topological Combinatorics
Abstract : 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. READ MORE
-
4. The k-assignment Polytope and the Space of Evolutionary Trees
Abstract : 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. READ MORE
-
5. Algebraic and geometric combinatorics of graphs
Abstract : .... READ MORE