Generating trees and forbidden subsequences
From MaRDI portal
Publication:1924376
DOI10.1016/S0012-365X(96)83023-8zbMath0877.05002OpenAlexW2129036921MaRDI QIDQ1924376
Publication date: 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)83023-8
Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)
Related Items (71)
On the least exponential growth admitting uncountably many closed permutation classes ⋮ Pattern avoidance and the Bruhat order. ⋮ Wilf-equivalence for singleton classes ⋮ Subregularity in infinitely labeled generating trees of restricted permutations ⋮ Restricted Dumont permutations, Dyck paths, and noncrossing partitions ⋮ Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations ⋮ Catalan intervals and uniquely sorted permutations ⋮ New production matrices for geometric graphs ⋮ Free rises, restricted partitions, and \(q\)-Fibonacci polynomials ⋮ Restricted simsun permutations ⋮ Partial permutations avoiding pairs of patterns ⋮ Enumeration of smooth inversion sequences and proof of a recent related conjecture ⋮ Lattice paths with catastrophes ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Restricted inversion sequences and Schröder paths ⋮ Finite transition matrices for permutations avoiding pairs of length four patterns ⋮ Enumerating two permutation classes by the number of cycles ⋮ On the period of Fibonacci sequences in nilpotent groups. ⋮ 3-step Fibonacci series modulo \(m\). ⋮ 3-step Fibonacci sequences in nilpotent groups. ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Applications of Fibonacci sequences in a finite nilpotent group. ⋮ Patterns in Random Permutations Avoiding the Pattern 132 ⋮ Enumerating in Coxeter Groups (Survey) ⋮ An application of Fibonacci numbers in matrices. ⋮ Unnamed Item ⋮ Matrix characterizations of Riordan arrays ⋮ Automatic discovery of structural rules of permutation classes ⋮ Symmetric permutations avoiding two patterns ⋮ The enumeration of maximally clustered permutations ⋮ Production matrices and riordan arrays ⋮ Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind ⋮ The Hopf algebra of diagonal rectangulations. ⋮ Finitely labeled generating trees and restricted permutations ⋮ Profinite automata ⋮ Sequence characterizations of double Riordan arrays and their compressions ⋮ Proper generating trees and their internal path length ⋮ Avoiding patterns and making the best choice ⋮ Counting permutations with no long monotone subsequence via generating trees and the kernel method ⋮ Kernel method and linear recurrence system ⋮ The tennis ball problem ⋮ Restricted 132-avoiding permutations ⋮ Waiting patterns for a printer ⋮ Restricted permutations ⋮ Restricted signed permutations counted by the Schröder numbers ⋮ Lattice congruences, fans and Hopf algebras. ⋮ Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials ⋮ Production matrices ⋮ Restricted even permutations and Chebyshev polynomials ⋮ Dyck paths and restricted permutations ⋮ A general exhaustive generation algorithm for Gray structures ⋮ Enumeration Schemes for Restricted Permutations ⋮ Restricted 123-avoiding Baxter permutations and the Padovan numbers ⋮ Some combinatorial results on smooth permutations ⋮ Stably and almost complex structures on bounded flag manifolds ⋮ Set partition statistics and \(q\)-Fibonacci numbers ⋮ On Stanley-Wilf limit of the pattern 1324 ⋮ Unnamed Item ⋮ Meeting covered elements in \(\nu\)-Tamari lattices ⋮ Explicit enumeration of 321, hexagon-avoiding permutations ⋮ Cyclic pattern containment and avoidance ⋮ Resolving two conjectures on staircase encodings and boundary grids of \(132\) and \(123\)-avoiding permutations ⋮ A combinatorial proof of J. West's conjecture ⋮ Directed animals, forests and permutations ⋮ Forbidden subsequences and Chebyshev polynomials ⋮ Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials ⋮ An application of Fibonacci sequences in groups ⋮ A linear operator approach to succession rules ⋮ On the centrosymmetric permutations in a class ⋮ A new class of Wilf-equivalent permutations ⋮ Stack-sorting for Words
Cites Work
This page was built for publication: Generating trees and forbidden subsequences
