AARON

swMATH11565MaRDI QIDQ23505FDOQ23505

Author name not available (Why is that?)

Official website: http://www.math.rutgers.edu/~zeilberg/programs.html

Described by source

• Refined restricted permutations

Cited In (26)

• The shape of random pattern-avoiding permutations
• Simple permutations and algebraic generating functions
• Descent sets on 321-avoiding involutions and hook decompositions of partitions
• Bijections for refined restricted permutations
• Crossings over permutations avoiding some pairs of patterns of length three
• Two refined major-balance identities on 321-avoiding involutions
• Exact and asymptotic enumeration of cyclic permutations according to descent set
• Visibility in pattern-restricted permutations
• Refined restricted permutations avoiding subsets of patterns of length three
• Major index distribution over permutation classes
• A history and a survey of lattice path enumeration
• Fixed points and excedances in restricted permutations
• Dyck paths and restricted permutations
• Fixed points of 321-avoiding permutations
• A simple and unusual bijection for Dyck paths and its consequences
• Another look at bijections for pattern-avoiding permutations
• On bijections for pattern-avoiding permutations
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• Refined restricted involutions
• \(k\)-arrangements, statistics, and patterns
• Restricted permutations refined by number of crossings and nestings
• The number of cycles with a given descent set
• Counting pattern avoiding permutations by number of movable letters
• A refinement of Wilf-equivalence for patterns of length 4
• Distributions of statistics over pattern-avoiding permutations
• Permutation statistics and multiple pattern avoidance

This page was built for software: AARON