Enumeration schemes and, more importantly, their automatic generation
From MaRDI portal
Publication:1305201
DOI10.1007/BF01608488zbMath0931.05006arXivmath/9805126MaRDI QIDQ1305201
Publication date: 30 September 1999
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9805126
Related Items (16)
Subregularity in infinitely labeled generating trees of restricted permutations ⋮ 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 ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 ⋮ 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 ⋮ Enumeration Schemes for Restricted Permutations ⋮ WILF ⋮ Restricted \(k\)-ary words and functional equations ⋮ Counting subwords in flattened partitions of sets
Uses Software
Cites Work
This page was built for publication: Enumeration schemes and, more importantly, their automatic generation
