Restricted permutations
From MaRDI portal
Recommendations
- Extended pattern avoidance
- Permutation pattern avoidance and the Catalan triangle
- Pattern avoidance in compositions and multiset permutations
- Generating trees and the Catalan and Schröder numbers
- scientific article; zbMATH DE number 3895076
- Pattern avoidance in poset permutations
- scientific article; zbMATH DE number 2188398
- The weak order on pattern-avoiding permutations
- Pattern-restricted permutations composed of 3-cycles
- On (shape-)Wilf-equivalence for words
Cites work
- Evaluation of a class of binomial coefficient summations
- Generalized Worpitzky identities with applications to permutation enumeration
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3513846 (Why is no real title available?)
- scientific article; zbMATH DE number 3623560 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Longest Increasing and Decreasing Subsequences
- On lattice path counting by major index and descents
- Permutations, matrices, and generalized Young tableaux
- Stack sortable permutations
Cited in
(only showing first 100 items - show all)- Restricted k-ary words and functional equations
- Symmetric Schröder paths and restricted involutions
- The maximal-inversion statistic and pattern-avoiding permutations
- The Euler-Catalan identity
- Partially ordered sets associated with permutations
- Permutation statistics and linear extensions of posets
- Vexillary elements in the hyperoctahedral group
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- Forbidden subsequences and Chebyshev polynomials
- Some combinatorial properties of Schubert polynomials
- Combinatorial statistics on non-crossing partitions
- Forbidden subsequences
- The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- Permutations with one or two 132-subsequences
- Permutations generated by token passing in graphs
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Consecutive patterns in permutations
- On the diagram of 132-avoiding permutations
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
- A combinatorial proof of J. West's conjecture
- Shape avoiding permutations
- A new class of Wilf-equivalent permutations
- Continued fractions and generalized patterns
- On (shape-)Wilf-equivalence for words
- Equidistributions of Mahonian statistics over pattern avoiding permutations
- On the likelihood of single-peaked preferences
- Monomial ideals induced by permutations avoiding patterns
- Rooted forests that avoid sets of permutations
- Renewal theory for asymmetric \(U\)-statistics
- Algorithmic and algebraic aspects of unshuffling permutations
- Discrete Morse theory and the consecutive pattern poset
- Signed Mahonians
- Finite automata and pattern avoidance in words
- Finite automata for languages of combinatorial interest: An order theoretical point of view
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
- On the least exponential growth admitting uncountably many closed permutation classes
- Restricted permutations and queue jumping
- Generating trees and the Catalan and Schröder numbers
- The number of permutations containing exactly one increasing subsequence of length three
- Permutations with forbidden subsequences and nonseparable planar maps
- 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
- Restricted simsun permutations
- Reduced decompositions with one repetition and permutation pattern avoidance
- Permutations and pairs of Dyck paths
- Enumeration of restricted permutation triples
- On extremal permutations avoiding _N=NN-1 1
- On the number of permutations avoiding a given pattern
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Pattern avoidance and quasisymmetric functions
- Folding phenomenon of major-balance identities on restricted involutions
- An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
- The pure descent statistic on permutations
- Reduced word manipulation: patterns and enumeration
- On a family of conjectures of Joel Lewis on alternating permutations
- Pattern statistics in faro words and permutations
- Lower bounds for superpatterns and universal sequences
- Finding and counting permutations via CSPs
- Integer sequences and monomial ideals
- Refined Wilf-equivalences by Comtet statistics
- Cyclic pattern containment and avoidance
- Classical and consecutive pattern avoidance in rooted forests
- A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
- Length-four pattern avoidance in inversion sequences
- A combinatorial bijection on di-sk trees
- On pattern avoidance in matchings and involutions
- Pattern avoidance of \([4,k]\)-pairs in circular permutations
- Pattern-restricted permutations composed of 3-cycles
- A decomposition of ballot permutations, pattern avoidance and Gessel walks
- Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization
- Subregularity in infinitely labeled generating trees of restricted permutations
- Patterns in Shi tableaux and Dyck paths
- New results on families of pattern-replacement equivalences
- Permutations avoiding a simsun pattern
- Pattern-avoiding permutation powers
- Stieltjes moment sequences for pattern-avoiding permutations
- Pattern avoidance in biwords
- Patterns in random permutations avoiding some sets of multiple patterns
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- Permutation patterns and cell decompositions
- The operators F_i on permutations, 132-avoiding permutations and inversions
- Pattern avoidance in permutations and their squares
- Kernelization lower bound for permutation pattern matching
- Permutations generated by a depth 2 stack and an infinite stack in series are algebraic
- On the topology of the permutation pattern poset
- Two refined major-balance identities on 321-avoiding involutions
- Nine classes of permutations enumerated by binomial transform of Fine's sequence
- Pattern avoidance and the Bruhat order.
- Longest monotone subsequences and rare regions of pattern-avoiding permutations
- Pattern avoidance of generalized permutations
- Pattern avoidance for alternating permutations and Young tableaux
- A refined sign-balance of simsun permutations
- Finitely labeled generating trees and restricted permutations
- Pattern classes of permutations via bijections between linearly ordered sets
- Counting occurrences of 231 in an involution
- Avoiding patterns of length three in compositions and multiset permutations
- Pattern avoidance in compositions and multiset permutations
This page was built for publication: Restricted permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5916426)