Search for dissertations about: "Diskret matematik"

Showing result 21 - 25 of 71 swedish dissertations containing the words Diskret matematik.

  2. 21. Around power ideals : From Fröberg's conjecture to zonotopal algebra

    Author : Gleb Nenashev; Boris Shapiro; Volkmar Welker; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Mathematics; matematik;

    Abstract : In this thesis we study power algebras, which are quotient of polynomial rings by power ideals. We will study Hilbert series of such ideals and their other properties. We consider two important special cases, namely, zonotopal ideals and generic ideals. Such ideals have a lot combinatorial properties. READ MORE

  4. 22. Symmetries in Random Trees

    Author : Christoffer Olsson; Stephan Wagner; Michael Drmota; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Matematik;

    Abstract : .... READ MORE

  5. 23. Symmetry in Randomness : Additive Functionals and Symmetries of Random Trees and Tree-Like Graphs

    Author : Christoffer Olsson; Stephan Wagner; Ralph Neininger; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Random trees; Random graphs; Additive functionals; Automorphisms; Mathematics; Matematik;

    Abstract : Properties of symmetries in random trees and tree-like graphs are explored. The primary structures studied are Galton-Watson trees, unlabeled unordered trees as well as labeled subcritical graphs. READ MORE

  6. 24. Local Conditions for Cycles in Graphs

    Author : Jonas Granholm; Armen Asratian; Carl Johan Casselgren; Victor Falgas Ravry; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian has been studied extensively, and there are many known sufficient conditions for Hamiltonicity. READ MORE

  7. 25. A tale of trees and leaves : subtrees and local convergence

    Author : Wang Ruoyu; Stephan Wagner; Haslegrave John; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; tree; subtree; mean subtree order; Benjamini Schramm convergence; local convergence; Mathematics; Matematik;

    Abstract : Given a tree T, a subtree in T is a subgraph that is a tree itself. The set of subtrees in a tree is related to many important graph parameters, one of which is the mean subtree order. READ MORE