Sökning: "Bruhat interval"
Hittade 3 avhandlingar innehållade orden Bruhat interval.
1. Enumerative combinatorics related to partition shapes
Sammanfattning : 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. LÄS MER
2. Boolean complexes of involutions and smooth intervals in Coxeter groups
Sammanfattning : 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 . LÄS MER
3. Combinatorics and topology related to involutions in Coxeter groups
Sammanfattning : 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. LÄS MER