Sökning: "Anders Björner"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Anders Björner.

  1. 1. Studies in homological and combinatorial order theory

    Författare :Anders Björner; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : .... LÄS MER

  3. 2. Topological and Shifting Theoretic Methods in Combinatorics and Algebra

    Författare :Afshin Goodarzi; Anders Björner; Volkmar Welker; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Matematik;

    Sammanfattning : This thesis consists of six papers related to combinatorics and commutative algebra.In Paper A, we use tools from topological combinatorics to describe the minimal free resolution of ideals with a so called regular linear quotient. Our result generalises the pervious results by Mermin and by Novik, Postnikov & Sturmfels. LÄS MER

  4. 3. Graphical representations of Ising and Potts models : Stochastic geometry of the quantum Ising model and the space-time Potts model

    Författare :Jakob Erik Björnberg; Anders Björner; Jeffrey Steif; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Quantum Ising model; Ising model; Potts model; random-cluster model; random-current representation; random-parity representation; differential inequality; phase transition; Discrete mathematics; Diskret matematik;

    Sammanfattning : HTML clipboard Statistical physics seeks to explain macroscopic properties of matter in terms of microscopic interactions. Of particular interest is the phenomenon of phase transition: the sudden changes in macroscopic properties as external conditions are varied. LÄS MER

  5. 4. On Face Vectors and Resolutions

    Författare :Afshin Goodarzi; Anders Björner; Volkmar Welker; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis consist of the following three papers.Convex hull of face vectors of colored complexes. In this paper we verify a conjecture by Kozlov (Discrete ComputGeom18(1997) 421–431), which describes the convex hull of theset of face vectors ofr-colorable complexes onnvertices. LÄS MER

  7. 5. Simplicial Complexes of Graphs

    Författare :Jakob Jonsson; Anders Björner; John Shareshian; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; simplicial complex; monotone graph property; discrete Morse theory; simplicial homology; homotopy type; connectivity degree; Cohen-Macaulay complex; Euler characteristic; decision tree; Algebra och geometri; Algebra and geometry; Algebra och geometri;

    Sammanfattning : Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. LÄS MER