Restricted permutations

From MaRDI portal

Publication:5916426

Jump to:navigation, search

DOI10.1016/S0195-6698(85)80052-4zbMath0615.05002OpenAlexW4212838771WikidataQ59649904 ScholiaQ59649904MaRDI QIDQ5916426

Rodica Simion, Frank W. Schmidt

Publication date: 1985

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(85)80052-4

zbMATH Keywords

permutation finite set

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)

Related Items

Continued fractions and generalized patterns, Combinatorial statistics on non-crossing partitions, Forbidden subsequences, Pattern matching for permutations, On the least exponential growth admitting uncountably many closed permutation classes, Restricted permutations and queue jumping, A fast algorithm for permutation pattern matching based on alternating runs, Pattern avoidance in poset permutations, The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!, Refined restricted involutions, Generating trees and the Catalan and Schröder numbers, Signed enumeration of upper-right corners in path shuffles, Restricted Dumont permutations, Dyck paths, and noncrossing partitions, The Euler-Catalan identity, Permutation pattern avoidance and the Catalan triangle, On (shape-)Wilf-equivalence for words, Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps, Bijections for refined restricted permutations, Permutations avoiding certain patterns: The case of length 4 and some generalizations, Partially ordered sets associated with permutations, Sorting with networks of data structures, Permutations with one or two 132-subsequences, Consecutive pattern avoidances in non-crossing trees, Free rises, restricted partitions, and \(q\)-Fibonacci polynomials, Generalized Schröder permutations, Partial permutations avoiding pairs of patterns, Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths, Wilf-classification of mesh patterns of short length, Permutations generated by token passing in graphs, Cyclic and lift closures for \(k \ldots 21\)-avoiding permutations, Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux, Sign imbalances of snakes and valley-signed permutations, Pattern avoidance in ordered set partitions, Equivalence classes of permutations modulo replacements between 123 and two-integer patterns, Refining enumeration schemes to count according to permutation statistics, The weak order on pattern-avoiding permutations, Inversion formulae on permutations avoiding 321, Finite transition matrices for permutations avoiding pairs of length four patterns, Consecutive patterns in permutations, Equidistributions of Mahonian statistics over pattern avoiding permutations, On the diagram of 132-avoiding permutations, Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three, Repetition in reduced decompositions, On the likelihood of single-peaked preferences, Sign-balance identities of Adin-Roichman type on 321-avoiding alternating permutations, Permutation patterns and statistics, Symmetric functions and P-recursiveness, Monomial ideals induced by permutations avoiding patterns, Rooted forests that avoid sets of permutations, Enumeration formulæ for pattern restricted Stirling permutations, Catalan numbers and pattern restricted set partitions, Descent sets on 321-avoiding involutions and hook decompositions of partitions, Operators of equivalent sorting power and related Wilf-equivalences, Renewal theory for asymmetric \(U\)-statistics, On the sub-permutations of pattern avoiding permutations, Sign balance for finite groups of Lie type, Avoidance of partitions of a three-element set, An infinite family of inv-Wilf-equivalent permutation pairs, Pattern avoiding partitions and Motzkin left factors, Permutations generated by stacks and deques, Symmetric permutations avoiding two patterns, The enumeration of maximally clustered permutations, Enumerating \(r\)c-invariant permutations with no long decreasing subsequences, Generating-tree isomorphisms for pattern-avoiding involutions, Wilf classification of three and four letter signed patterns, Permutation statistics and linear extensions of posets, A note on statistical averages for oscillating tableaux, Algorithmic and algebraic aspects of unshuffling permutations, Sorting twice through a stack, Pattern frequency sequences and internal zeros, Counting permutations by their rigid patterns, Discrete Morse theory and the consecutive pattern poset, Restricted partitions and \(q\)-Pell numbers, Signed Mahonians, Restricted involutions and Motzkin paths, The area above the Dyck path of a permutation, Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials, Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents, The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2, The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns, Refined sign-balance on 321-avoiding permutations, Finite automata and pattern avoidance in words, More restrictive Gray codes for some classes of pattern avoiding permutations, Restricted 123-avoiding Baxter permutations and the Padovan numbers, Mesh patterns with superfluous mesh, Vexillary elements in the hyperoctahedral group, Restricted \(k\)-ary words and functional equations, Finite automata for languages of combinatorial interest: An order theoretical point of view, The solution of a conjecture of Stanley and Wilf for all layered patterns, Restricted permutations refined by number of crossings and nestings, Symmetric Schröder paths and restricted involutions, The maximal-inversion statistic and pattern-avoiding permutations, A combinatorial proof of J. West's conjecture, Forbidden subsequences and Chebyshev polynomials, Some combinatorial properties of Schubert polynomials, Shape avoiding permutations, A new class of Wilf-equivalent permutations, Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations, Two descent statistics over \(321\)-avoiding centrosymmetric involutions, Permuting machines and priority queues, Nine classes of permutations enumerated by binomial transform of Fine's sequence, A combinatorial bijection on di-sk trees, On pattern avoidance in matchings and involutions, On avoiding 1233, Pattern avoidance of \([4,k\)-pairs in circular permutations], Pattern avoidance and the Bruhat order., Pattern-restricted permutations composed of 3-cycles, Schröder partitions, Schröder tableaux and weak poset patterns, A decomposition of ballot permutations, pattern avoidance and Gessel walks, Wilf-equivalence for singleton classes, Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization, Subregularity in infinitely labeled generating trees of restricted permutations, A New Upper Bound for 1324-Avoiding Permutations, Patterns in Shi tableaux and Dyck paths, The number of permutations containing exactly one increasing subsequence of length three, Permutations with forbidden subsequences and nonseparable planar maps, Prolific permutations, Atoms for signed permutations, Impulse parameter and a new equivalence between 123- and 132-avoiding permutations, Avoiding a pair of patterns in multisets and compositions, The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three, Longest monotone subsequences and rare regions of pattern-avoiding permutations, Stack words, standard tableaux and Baxter permutations, Crossings and embracings of set-partitions and \(q\)-analogues of the logarithm of the Fourier transform, Generating trees and forbidden subsequences, New results on families of pattern-replacement equivalences, Restricted simsun permutations, Pattern avoidance of generalized permutations, Unnamed Item, Inversion sequences avoiding pairs of patterns, Permutations avoiding a simsun pattern, Affine Permutations and an Affine Catalan Monoid, Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations, Pattern-avoiding permutation powers, Pattern avoidance for alternating permutations and Young tableaux, Reduced decompositions with one repetition and permutation pattern avoidance, Combinatorial isomorphism between Fibonacci classes, Permutation classes and polyomino classes with excluded submatrices, Permutations and pairs of Dyck paths, Stieltjes moment sequences for pattern-avoiding permutations, A refined sign-balance of simsun permutations, On extremal permutations avoiding \(\omega_N=NN-1\dots 1\), Automatic discovery of structural rules of permutation classes, On the number of permutations avoiding a given pattern, Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind, Finitely labeled generating trees and restricted permutations, Pattern classes of permutations via bijections between linearly ordered sets, Pattern avoidance in biwords, Enumeration of Dumont permutations avoiding certain four-letter patterns, Pattern avoidance and quasisymmetric functions, Folding phenomenon of major-balance identities on restricted involutions, Unnamed Item, An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations, Difference Necklaces, Counting occurrences of 231 in an involution, Avoiding patterns of length three in compositions and multiset permutations, Pattern avoidance in compositions and multiset permutations, Decreasing subsequences in permutations and Wilf equivalence for involutions, The pure descent statistic on permutations, Reduced word manipulation: patterns and enumeration, On a family of conjectures of Joel Lewis on alternating permutations, Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials, Restricted even permutations and Chebyshev polynomials, Dyck paths and restricted permutations, Crossings over permutations avoiding some pairs of patterns of length three, Unnamed Item, Reduced decompositions and permutation patterns, Pattern statistics in faro words and permutations, Lower bounds for superpatterns and universal sequences, Finding and counting permutations via CSPs, Patterns in random permutations avoiding some sets of multiple patterns, Unnamed Item, Set partition statistics and \(q\)-Fibonacci numbers, The limiting case of Haglund's \((q,t)\)-Schröder theorem and an involution formula, Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences, Integer sequences and monomial ideals, Refined Wilf-equivalences by Comtet statistics, Unnamed Item, Counting pattern avoiding permutations by number of movable letters, Distributions of Statistics over Pattern-Avoiding Permutations, Structure of random 312-avoiding permutations, Permutation patterns and cell decompositions, The operators \(F_i\) on permutations, 132-avoiding permutations and inversions, Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations, Visibility in pattern-restricted permutations, Generalized noncrossing partitions and combinatorics of Coxeter groups, Pattern avoidance in permutations and their squares, Cyclic pattern containment and avoidance, Partially ordered generalized patterns, Simple permutations and pattern restricted permutations, Permutations, Moments, Measures, Kernelization lower bound for permutation pattern matching, Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials, Classical and consecutive pattern avoidance in rooted forests, Permutations generated by a depth 2 stack and an infinite stack in series are algebraic, On the topology of the permutation pattern poset, A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra, Two refined major-balance identities on 321-avoiding involutions, Length-four pattern avoidance in inversion sequences, QUANTUM SCHUBERT POLYNOMIALS AND QUANTUM SCHUR FUNCTIONS, Unnamed Item, Consecutive patterns in inversion sequences II: avoiding patterns of relations, Algorithmic coincidence classification of mesh patterns, Unnamed Item, A complete enumeration of Ballot permutations avoiding sets of small patterns, Pattern avoiding alternating involutions, Involutions and the Gelfand character, On refinements of Wilf-equivalence for involutions, Unnamed Item, Wilf equivalences for patterns in rooted labeled forests, Equidistribution of set-valued statistics on standard Young tableaux and transversals, Restricted Grassmannian permutations, Rowmotion on 321-avoiding permutations, Patterns in Random Permutations Avoiding the Pattern 132, Unnamed Item, Unnamed Item, $k$-Arrangements, Statistics, and Patterns, Unnamed Item, Containing All Permutations, Visibility in restricted involutions, Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations, Restricted 132-avoiding permutations, Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations, Restricted permutations, On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation, Generalized pattern avoidance, Permutations of a multiset avoiding permutations of length 3, Pattern-avoiding polytopes, Wilf-collapse in permutation classes having two basis elements of size three, Permutations with restricted patterns and Dyck paths, Permutations restricted by two distinct patterns of length three, The Schützenberger involution over Dyck paths, Counting the Nontrivial Equivalence Classes of $S_n$ under $\{1234,3412\}$-Pattern-Replacement, Unnamed Item, An operator on ascent sequences, On the centrosymmetric permutations in a class, Pattern restricted quasi-Stirling permutations

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5916426&oldid=14183762"