Factorization of the Robinson-Schensted-Knuth correspondence

@article{Little2005FactorizationOT,
  title={Factorization of the Robinson-Schensted-Knuth correspondence},
  author={David P. Little},
  journal={J. Comb. Theory, Ser. A},
  year={2005},
  volume={110},
  pages={147-168}
}
In [4], a bijection between collections of reduced factorizations of elements of the symmetric group was described. Initially, this bijection was used to show the Schur positivity of the Stanley symmetric functions. Further investigations have revealed that our bijection has strong connections to other more familiar combinatorial algorithms. In this paper we will show how the Robinson-Schensted-Knuth correspondence can be decomposed into a sequence of applications of this bijection. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Permutations, matrices, and generalized Young tableaux

  • Donald E. Knuth
  • Pacific J. Math.,
  • 1970
Highly Influential
8 Excerpts

Longest increasing and decreasing subsequences

  • C. Schensted
  • Canad. J. Math.,
  • 1961
Highly Influential
8 Excerpts

Combinatorial aspects of the Lascoux-Schützenberger

  • David P. Little
  • tree. Adv. Math.,
  • 2003
3 Excerpts

Billey , William Jockusch , and Richard P . Stanley . Some combinatorial properties of Schubert polynomials

  • C. Sara
  • J . Algebraic Combin .
  • 1993

Schubert polynomials and the Littlewood- Richardson rule

  • Alain Lascoux, Marcel-Paul Schützenberger
  • Lett. Math. Phys.,
  • 1985

On the number of reduced decompositions of elements of Coxeter groups

  • Richard P. Stanley
  • European J. Combin.,
  • 1984
1 Excerpt

Knuth . Permutations , matrices , and generalized Young tableaux

  • E. Donald
  • Pacific J . Math .
  • 1970

Little . Combinatorial aspects of the Lascoux - Schützenberger tree

  • P. David
  • Adv . Math .

Similar Papers

Loading similar papers…