The number of involutions with r fixed points and a long increasing subsequence
The number of involutions with \(r\) fixed points and a long increasing subsequence
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\).
- The number of fixed points of Wilf's partition involution
- Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees
- Involutions with a fixed point set RP(2m) P(2m,2n+1)
- Involution number sequence and dimensions of components in fixed point set of involution
- Asymptotic distribution of fixed points of pattern-avoiding involutions
- Involution number sequence and dimensions of the components in fixed point set of an involution. II
- Enumerating \(r\)c-invariant permutations with no long decreasing subsequences
- Counting covered fixed points and covered arcs in an involution
- The asymptotics of monotone subsequences of involutions
- Longest increasing subsequences in involutions avoiding patterns of length three
- Enumeration of plane partitions
- Exact Values for Degree Sums Over Strips of Young Diagrams
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- Longest Increasing and Decreasing Subsequences
- Permutations, matrices, and generalized Young tableaux
- Quelques remarques sur une Construction de Schensted.
- Standard Young tableaux of height 4 and 5
This page was built for publication: The number of involutions with \(r\) fixed points and a long increasing subsequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174154)
