Pattern avoidance of generalized permutations
From MaRDI portal
Publication:2417191
DOI10.1016/j.aam.2019.01.007zbMath1414.05017arXiv1804.06265OpenAlexW2963540272WikidataQ128480857 ScholiaQ128480857MaRDI QIDQ2417191
Publication date: 11 June 2019
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.06265
Young tableauxMotzkin numbersRiordan numbersRSK correspondencegeneralized permutationspattern avoidances
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pattern avoidance and Young tableaux
- Identities for the number of standard Young tableaux in some \((k,l)\)-hooks
- Classical sequences revisited with permutations avoiding dotted pattern
- Pattern avoidance in ``flattened partitions
- Monotonicity and unimodality of the pattern inventory
- Catalan, Motzkin, and Riordan numbers
- Asymptotic values for degrees associated with strips of Young diagrams
- Priority queues and multisets
- Two examples of unbalanced Wilf-equivalence
- Schur-concavity for avoidance of increasing subsequences in block-ascending permutations
- Pattern avoidance in multiset permutations: bijective proof
- Pattern avoidance for alternating permutations and Young tableaux
- Riordan paths and derangements
- Pattern avoidance in compositions and multiset permutations
- Restricted permutations
- Permutations of a multiset avoiding permutations of length 3
This page was built for publication: Pattern avoidance of generalized permutations
