WILF

swMATH11643MaRDI QIDQ23583

No author found.

Described by source

• Enumeration schemes and, more importantly, their automatic generation

Related Items (14)

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

This page was built for software: WILF