WILF

swMATH11643MaRDI QIDQ23583FDOQ23583

Author name not available (Why is that?)

Described by source

• Enumeration schemes and, more importantly, their automatic generation

Cited In (14)

• Some enumerative results related to ascent sequences
• Enumeration schemes for vincular patterns
• Refining enumeration schemes to count according to permutation statistics
• Pattern avoidance in ordered set partitions
• Pattern-avoiding set partitions and Catalan numbers
• Automatic discovery of structural rules of permutation classes
• Finite transition matrices for permutations avoiding pairs of length four patterns
• Pattern avoidance in the rook monoid
• Restricted \(k\)-ary words and functional equations
• Catalan numbers and pattern restricted set partitions
• Counting subwords in flattened partitions of sets
• Finitely labeled generating trees and restricted permutations
• On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
• Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3

This page was built for software: WILF