Baxter d-permutations and other pattern avoiding classes

zbMATH Open1509.05005arXiv2202.12677MaRDI QIDQ6392147FDOQ6392147

Authors: Nicolas Bonichon, Pierre Morel 

Publication date: 25 February 2022

Abstract: A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n{]}^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to their diagrams on the grid $[n{]}^d$ in which there is exactly one point per hyperplane $x_i=j$ for $iin[d]$ and $jin[n]$. We first investigate exhaustively all small pattern avoiding classes. We provide some bijection to enumerate some of these classes and we propose some conjectures for others. We then give a generalization of well-studied Baxter permutations into this multidimensional setting. In addition, we provide a vincular pattern avoidance characterization of Baxter $d$-permutations.

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19)

This page was built for publication: Baxter $d$-permutations and other pattern avoiding classes

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