Search for dissertations about: "Bruhat interval"

Found 3 swedish dissertations containing the words Bruhat interval.

  2. 1. Enumerative combinatorics related to partition shapes

    Author : Jonas Sjöstrand; Anders Björner; Christian Krattenthaler; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; partition shape; sign-imbalance; Robinson-Schensted correspondence; chess tableau; restricted word; cylindrical lattice walk; Poincaré polynomial; Bruhat interval; rook polynomial; pattern avoidance; partitionsform; teckenobalans; Robinson-Schensted-korrespondens; schacktablå; begränsade ord; cylindriska latticestigar; poincarépolynom; bruhatintervall; tornpolynom; mönsterundvikande permutation; MATHEMATICS; MATEMATIK;

    Abstract : This thesis deals with enumerative combinatorics applied to three different objects related to partition shapes, namely tableaux, restricted words, and Bruhat intervals. The main scientific contributions are the following. READ MORE

  4. 2. Boolean complexes of involutions and smooth intervals in Coxeter groups

    Author : Vincent Umutabazi; Axel Hultman; Jan Snellman; Christian Stump; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : This dissertation is composed of four papers in algebraic combinatorics related to Coxeter groups. By a Coxeter group, we mean a group W generated by a subset S ⊂ W such that for all s ∈ S , we have s2 = e, and (s, s′)m(s,s′) = (s′ s)m(s,s′) = e, where m(s, s′) = m(s′ s) ≥ 2 for all s ≠ s′ ≥ ∈ S . READ MORE

  5. 3. Combinatorics and topology related to involutions in Coxeter groups

    Author : Mikael Hansson; Axel Hultman; Jan Snellman; Nathan Reading; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : This dissertation consists of three papers in combinatorial Coxeter group theory.A Coxeter group is a group W generated by a set S, where all relations can be derived from the relations s2 = e for all s ? S, and (ss′)m(s,s′) = e for some pairs of generators s ≠ s′ in S, where e ? W is the identity element and m(s, s′) is an integer satisfying that m(s, s′) = m(s′, s) ≥ 2. READ MORE