scientific article; zbMATH DE number 4168687

MaRDI QIDQ3495358zbMATH OpenFDO

Authors Dana Richards

Publication date 1988

zbMATH Keywords

ascending subsequenceballot sequencesbijectionCatalan numberpermutationrankingunranking

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• Generalized ballot sequences are ascent sequences
• A complete enumeration of Ballot permutations avoiding sets of small patterns
• Loopless generation of up-down permutations
• Ballot permutations and odd order permutations
• Generating permutations with given ups and downs

Cited in

(20)

• A partition of Catalan permuted sequences with applications
• Forbidden subsequences
• A new class of Wilf-equivalent permutations
• Generating trees and the Catalan and Schröder numbers
• The peak and descent statistics over ballot permutations
• A decomposition of ballot permutations, pattern avoidance and Gessel walks
• Ballot permutations and odd order permutations
• Generalized ballot sequences are ascent sequences
• Pattern avoidance in poset permutations
• Two new bijections on lattice paths
• Impulse parameter and a new equivalence between 123- and 132-avoiding permutations
• Labelled well-quasi-order for permutation classes
• The bidirectional ballot polytope
• Permutations restricted by two distinct patterns of length three
• Bijections for refined restricted permutations
• A complete enumeration of Ballot permutations avoiding sets of small patterns
• On (joint) equidistributions of mesh patterns 123 and 132 with symmetric shadings
• Knights, spies, games and ballot sequences
• Inversion formulae on permutations avoiding 321
• Efficient enumeration of all ladder lotteries and its application

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495358)