Sökning: "Simplicial complex"

Visar resultat 1 - 5 av 14 avhandlingar innehållade orden Simplicial complex.

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

  3. 2. Enumeration on words, complexes and polytopes

    Författare :Ragnar Freij; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Simplicial complex; discrete Morse theory; Hansen polytope; $3^d$-conjecture; split graph; derangement; pattern containment; pattern packing; composition.; composition.;

    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. 3. Ekedahl Invariants, Veronese Modules and Linear Recurrence Varieties

    Författare :Ivan Martino; Anders Björner; Volkmar Welker; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Ekedahl Invariants; Noether Problem; Bogomolov Multiplier; Cyclic quotient singularities; Veronese Modules; Pile simplicial complex; Semigroup Rings; Betti Numbers; Mathematics; matematik;

    Sammanfattning : The title of this thesis refers to the three parts of which it is composed.The first part concerns the Ekedahl Invariants, new geometric invariants for finite groups introduced in 2009 by Torsten Ekedahl. LÄS MER

  5. 4. Topics in algorithmic, enumerative and geometric combinatorics

    Författare :Ragnar Freij; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Discrete Morse theory; simplicial G-complex; centrally symmetric polytope; split graph; derangement; pattern packing; composition; finite poset; optimal stopping; secretary problem.; finite poset;

    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

  7. 5. Some computations of compact support cohomology of configuration spaces

    Författare :Louis Hainaut; Dan Petersen; Ben Knudsen; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; matematik; Mathematics;

    Sammanfattning : This licentiate thesis consists of two papers related to configuration spaces of points.In paper I a general formula for the Euler characteristic of configuration spaces on any topologically stratified space X is obtained in terms of geometric and combinatorial data about the strata. LÄS MER