Avancerad sökning
Visar resultat 1 - 5 av 20 avhandlingar som matchar ovanstående sökkriterier.
1. The k-assignment Polytope and the Space of Evolutionary Trees
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
2. The k-assignment polytope, phylogenetic trees, and permutation patterns
Sammanfattning : In this thesis three combinatorial problems are studied in four papers.In Paper 1 we study the structure of the k-assignment polytope, whose vertices are the mxn (0,1)-matrices with exactly k 1:s and at most one 1 in each row and each column. LÄS MER
3. Enumeration on words, complexes and polytopes
Sammanfattning : This thesis presents four papers, studying enumerative problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. LÄS MER
4. Topics in algorithmic, enumerative and geometric combinatorics
Sammanfattning : This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. LÄS MER
5. Classifications and volume bounds of lattice polytopes
Sammanfattning : In this licentiate thesis we study relations among invariants of lattice polytopes, with particular focus on bounds for the volume.In the first paper we give an upper bound on the volume vol(P^*) of a polytope P^* dual to a d-dimensional lattice polytope P with exactly one interiorlattice point, in each dimension d. LÄS MER
