Non-crossing partitions for classical reflection groups (Q1377877): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126982984, #quickstatements; #temporary_batch_1722205759638 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126982984 / rank | |||
Normal rank |
Revision as of 23:29, 28 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Non-crossing partitions for classical reflection groups |
scientific article |
Statements
Non-crossing partitions for classical reflection groups (English)
0 references
15 July 1998
0 references
The lattice \(\Pi^A(n)\) of partitions of an \(n\)-set ordered by refinement is a member of a class of posets which over time has been much studied, as have many of its sublattice types, including lattices of non-crossing partitions \(\text{NC}^A(n)\), where a partition \(\pi\) is crossing if for some \(i<j< k<l\), \(ik\) and \(jl\) belong to different blocks of the partition. In free algebraic objects of dimension \(n\), where the \(n\)-set \(A\) is a basis of the object, the lattice \(\Pi^A(n)\) and its sublattices lend themselves to re-interpretations. In the paper reviewed here the case is that of vector-spaces where blocks in the partition are identified with hyperplanes through identifications \(x_i= x_j\) if \(ij\) is in one block or \(x_i \pm x_j\), \(x_i=0\) in a second case, leading to a second type corresponding to partitions of \(\{-n,-(n-1)\), \(-(n-2), \dots,-1,1, \dots, n\}\). Observations made on the lattice \(\text{NC}^B(n)\) of non-crossing partitions of the second type also show it to be a ranked lattice which is self-dual and equipped with generating functions \(f^A_n(r)= \sum_\pi r^{\text{blocks} (\pi)}\) \((\pi \in \text{NC}^A(n))\), \(F^A(r,x)= \sum^\infty_{n=0} f_n^A(r)x^n\) (misprint in Proposition 5) \(=(2x)^{-1} [1-x(r-1) -((1-x (r-1))^2- 4x)^{1/2}]\) with a similar formula for the case \(\text{NC}^B (n)\). Using several proof techniques and enumerative results obtained, the author is able to rederive known results as well as extend the theory in several directions leading to some interesting remarks and what look to be good questions for further consideration.
0 references
set partitions
0 references
dihedral group action
0 references
root system
0 references
lattice of partitions
0 references
non-crossing partitions
0 references
vector-spaces
0 references
hyperplanes
0 references
ranked lattice
0 references
generating functions
0 references
0 references