On d-permutations and Pattern Avoidance Classes

MaRDI QIDQ6408149zbMATH OpenFDO

Authors Nathan Sun

Publication date 17 August 2022

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: Bonichon and Morel first introduced $d$-permutations in their study of multidimensional permutations. Such permutations are represented by their diagrams on $[n{]}^d$ such that there exists exactly one point per hyperplane $x_i$ that satisfies $x_i=j$ for $iin[d]$ and $jin[n]$. Bonichon and Morel previously enumerated $3$-permutations avoiding small patterns, and we extend their results by first proving four conjectures, which exhaustively enumerate $3$-permutations avoiding any two fixed patterns of size $3$. Further, we relate $3$-permutation avoidance classes with their respective recurrence relations, which lead to interesting combinatorial properties of these $3$-permutation avoidance classes. In particular, we show a recurrence relation for $3$-permutations avoiding the patterns $132$ and $213$, which contributes a new sequence to the OEIS database. We then extend our results to completely enumerate $3$-permutations avoiding three patterns of size $3$.

This page was built for publication: On $d$-permutations and Pattern Avoidance Classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6408149)