Forbidden subsequences
From MaRDI portal
Publication:1336669
DOI10.1016/0012-365X(94)90242-9zbMath0810.05011OpenAlexW2912910446WikidataQ60638467 ScholiaQ60638467MaRDI QIDQ1336669
Publication date: 28 November 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)90242-9
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Enumerative combinatorics (05A99)
Related Items
Nine classes of permutations enumerated by binomial transform of Fine's sequence, A combinatorial bijection on di-sk trees, A family of Bell transformations, Pattern matching for permutations, Letter Graphs and Geometric Grid Classes of Permutations, Labelled well-quasi-order for permutation classes, Wilf equivalence relations for consecutive patterns, When is a Schubert variety Gorenstein?, Generating trees and the Catalan and Schröder numbers, On \(\gamma\)-positive polynomials arising in pattern avoidance, Wilf-equivalence for singleton classes, Partitioning permutations into increasing and decreasing subsequences, Restricted Dumont permutations, Dyck paths, and noncrossing partitions, Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps, Permutations with forbidden subsequences and nonseparable planar maps, Permutations avoiding certain patterns: The case of length 4 and some generalizations, Sorting with networks of data structures, Longest increasing subsequences and log concavity, Partial permutations avoiding pairs of patterns, On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation, Finite transition matrices for permutations avoiding pairs of length four patterns, The Eulerian distribution on involutions is indeed \(\gamma\)-positive, Further refinements of Wilf-equivalence for patterns of length 4, A refinement of Wilf-equivalence for patterns of length 4, An infinite family of inv-Wilf-equivalent permutation pairs, Rationally smooth elements of Coxeter groups and triangle group avoidance., Wilf classification of three and four letter signed patterns, A new class of multiset Wilf equivalent pairs, Finitely labeled generating trees and restricted permutations, Suballowable sequences and geometric permutations, A counterexample regarding labelled well-quasi-ordering, On the growth of merges and staircases of permutation classes, Restricted permutations, Counting occurrences of 231 in an involution, Decreasing subsequences in permutations and Wilf equivalence for involutions, Permutations of a multiset avoiding permutations of length 3, On \(k\)-diameter of \(k\)-connected graphs, Permutations restricted by two distinct patterns of length three, Enumeration Schemes for Restricted Permutations, ECO:a methodology for the enumeration of combinatorial objects, Refined Wilf-equivalences by Comtet statistics, Unnamed Item, The solution of a conjecture of Stanley and Wilf for all layered patterns, Permutation patterns and cell decompositions, Explicit enumeration of 321, hexagon-avoiding permutations, An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations, Geometric grid classes of permutations, A combinatorial proof of J. West's conjecture, Growth rates of permutation grid classes, tours on graphs, and the spectral radius, Sorting with two ordered stacks in series., Combinatorial generation via permutation languages. I. Fundamentals, A new class of Wilf-equivalent permutations, Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations, \((d,m)\)-dominating numbers of hypercube
Cites Work
