312-Avoiding reduced valid hook configurations and duck words
From MaRDI portal
Publication:5056197
DOI10.54550/ECA2021V1S2R14zbMath1499.05003arXiv2010.11834MaRDI QIDQ5056197
Publication date: 7 December 2022
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.11834
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items (1)
Cites Work
- The tennis ball problem
- Stack-sorting, set partitions, and Lassalle's sequence
- Further bijections to pattern-avoiding valid hook configurations
- Catalan intervals and uniquely sorted permutations
- Preimages under the stack-sorting algorithm
- Postorder Preimages
- Troupes, cumulants, and stack-sorting
- Unnamed Item
- Unnamed Item
This page was built for publication: 312-Avoiding reduced valid hook configurations and duck words