검색 상세

순열 타블로를 이용한 콕세터 군의 조합론과 단순다면체의 코호몰로지 리지디티

Combinatorics of Coxeter groups with permutation tableaux and cohomological rigidity of simple polytopes

초록/요약

In this thesis, we use permutation tableaux of type B to enumerate known statistics of signed permutations and to give two combinatorial proofs. We realize many important statistics of signed permutations in the corresponding permutation tableaux or bare tableaux of type B: such as alignments, crossings, inversions, and cycles. This enables us to describe how to relate the number of alignments and crossings with other statistics of signed permutations and also to illustrate the covering relation in weak (Bruhat) order on Coxeter system of type B in terms of permutation tableaux of type B. We give two combinatorial proofs in the form of algorithms. One is a proof of a symmetry of (t,q)-Eulerian numbers of type B. We dene an involution preserving many important statistics on the set of permutation tableaux of type B. This also proves a symmetry of the generating polynomial of the numbers of crossings and alignments, and hence q-Eulerian numbers of type A defined by Williams. By considering a restriction of our bijection, we were led to dene a new statistic on the permutations of type D and (t,q)-Eulerian numbers of type D, which is proved to have a particular symmetry as well. We conjecture that our new statistic is in the family of Eulerian statistics for the permutations of type D. The other is a proof of equidistribution of alternating signed permutations with the maximal number of fixed points and derangements. A conjecture of Stanley on a class of alternating permutations, which is proved by Chapman and Williams, states that alternating permutations with the maximal number of fixed points is equidistributed with derangements. We extend this (type A) result to type B we prove that various classes of alternating signed permutations with the maximal number of fixed points are equidistributed with certain types of derangements of type B respectively. As an additional topic, we study the cohomological rigidity of n-simple polytopes with n+3 facets obtained from Gale-diagram on a pentagon and find two such polytopes which show that cohomological rigidity does not imply algebraic rigidity.

more

목차

1 Introduction 1
2 Coxeter groups 7
2.1 Coxeter groups 7
2.2 Bruhat order 9
2.3 Signed permutations 9
3 Permutation tableaux of type B 15
3.1 Permutation tableaux and bare tableaux of type B 15
3.2 Zigzag paths 18
4 Statistics of Coxeter groups of type B in permutation tableaux of type B 23
4.1 Alignments and crossings on permutation tableaux of type B 24
4.2 Inversions on permutation tableaux of type B 29
4.3 Cycles on bare tableaux of type B 36
5 On alternating signed permutations with the maximal number of fixed points using permutation tableaux of type B 41
5.1 Alternating signed permutations 41
5.2 Algorithms for proof of each types 46
5.2.1 Type -DU 47
5.2.2 Type -UD 51
5.2.3 Type +DU 52
5.2.4 Type +UD 53
6 A combinatorial proof of a symmetry of (t,q)-Eulerian numbers of type B 57
6.1 Algorithm 60
6.1.1 pre-tableau T_pr 64
6.1.2 T_pr to T(T) 67
6.2 Proofs 75
6.3 q-Eulerian numbers of type A and D 91
6.3.1 Type A 91
6.3.2 Type D 94
7 Cohomological rigidity of simple n polytopes with n+3 facets 97
7.1 Quasitoric manifolds 98
7.2 Tor-algebra and bigraded Betti numbers 99
7.3 Cohomological rigidity 102
7.4 Gale diagram on pentagon with assigned number [a,b,c,d,e] 104
7.5 Main theorem 107
8 Further study 119
Bibliography 121

more