The number of involutions with \(r\) fixed points and a long increasing subsequence (Q1174154): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Enumeration of plane partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact Values for Degree Sums Over Strips of Young Diagrams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Standard Young tableaux of height 4 and 5 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permutations, matrices, and generalized Young tableaux / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3947818 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Longest Increasing and Decreasing Subsequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quelques remarques sur une Construction de Schensted. / rank | |||
Normal rank |
Latest revision as of 09:51, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of involutions with \(r\) fixed points and a long increasing subsequence |
scientific article |
Statements
The number of involutions with \(r\) fixed points and a long increasing subsequence (English)
0 references
25 June 1992
0 references
It is pointed out that the number \(c(n,m,r)\) of involutions in the symmetric group \(S_ n\) on \(\{1,2,\ldots,n\}\) having \(r\) fixed points and longest increasing subsequence of length \(m\) can be expressed as a sum is degrees \(f^ \lambda\) of irreducible representations of \(S_ n\) labelled by partitions \(\lambda\). The sum is restricted to those \(\lambda\) for which the corresponding Ferrers diagram has \(m\) columns, of which \(r\) have odd length. A new expression is derived for the sum of Schur functions \(s_ \lambda(x)\) weighted by \(t^ r\), where the sum is over partitions with an upper bound \(m\) on the largest part and \(r\) is as before. This expression involves division by the Vandermonde determinant \(V(x)\). Using an earlier result [Can. J. Math. 42, 763-775 (1990; Zbl 0723.05118)] to carry out this division, the author then derives an explicit formula for \(c(n,m,r)\) in those cases for which \((n-1)/2\leq m\leq n-1\).
0 references
Ferrers diagram
0 references
Schur functions
0 references