On the permutations that strongly avoid the pattern 312 or 231
From MaRDI portal
Publication:6661735
DOI10.1007/s00373-024-02881-7MaRDI QIDQ6661735
Publication date: 13 January 2025
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
- On a conjecture about strong pattern avoidance
- Pattern-avoiding permutation powers
- Pattern avoidance in permutations and their squares
- Cyclic permutations realized by signed shifts
- Combinatorics of Permutations
- Permutation classes
- Restricted permutations
- Powers of permutations that avoid chains of patterns
This page was built for publication: On the permutations that strongly avoid the pattern 312 or 231
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661735)