The fine structure of 321 avoiding permutations
From MaRDI portal
Abstract: Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in enumerating permutations which have a block structure avoiding 321 and whose blocks also have such structure (recursively). Generalizations of these results are discussed.
This page was built for publication: The fine structure of 321 avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6472383)
