Enumeration of permutations with prescribed up-down and inversion sequences

38Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A method is described by which the enumeration of permutations of 1, 2, ... n with a prescribed sequence A of rises and falls, or a prescribed sequence B of inversions of order, or with both A and B, is effected in terms of numbers derived from the representation theory of the symmetric group. A connexion with Schensted pairs of standard Young tableaux is also discussed. © 1976.

Cite

CITATION STYLE

APA

Foulkes, H. O. (1976). Enumeration of permutations with prescribed up-down and inversion sequences. Discrete Mathematics, 15(3), 235–252. https://doi.org/10.1016/0012-365X(76)90028-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free