Abstract
Multidimensional permutations, or d-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 \(i \in [d]\) and \(j \in [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. We further provide a enumerative result relating 3-permutation avoidance classes with their respective recurrence relations. 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.
Similar content being viewed by others
Data Availability
Not applicable.
References
Donald E. Knuth. The art of computer programming, volume 3: Searching and sorting. Addison-Westley Publishing Company: Reading, MA, 1973.
Rodica Simion and Frank W. Schmidt. Restricted permutations. European Journal of Combinatorics, 6(4):383–406, 1985.
Toufik Mansour. Enumeration and Wilf-classification of permutations avoiding four patterns of length 4. Discrete Math. Lett, 3:67–94, 2020.
Christian Krattenthaler. Permutations with restricted patterns and Dyck paths. Advances in Applied Mathematics, 27(2-3):510–530, 2001.
Astrid Reifegerste. On the diagram of 132-avoiding permutations. European Journal of Combinatorics, 24(6):759–776, 2003.
Julian West. Generating trees and the Catalan and Schröder numbers. Discrete Mathematics, 146(1-3):247–262, 1995.
Nicolas Bonichon and Pierre-Jean Morel. Baxter \( d \)-permutations and other pattern avoiding classes. Journal of Integer Sequences, 25(22.8.3), 2022.
Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, and D. J. McCaughan. Permuting machines and priority queues. Theoretical Computer Science, 349(3):309–317, 2005.
Benjamin Gunby and Dömötör Pálvölgyi. Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings. European Journal of Combinatorics, 82:102992, 2019.
Andrei Asinowski and Toufik Mansour. Separable \(d\)-permutations and guillotine partitions. Annals of Combinatorics, 14(1):17–43, 2010.
Neil J. A. Sloane and The OEIS Foundation Inc. The on-line encyclopedia of integer sequences, 2020.
Acknowledgements
This research was conducted at the 2022 University of Minnesota Duluth REU and is supported by Jane Street Capital, the NSA (Grant No. H98230-22-1-0015), the NSF (Grant No. DMS-2052036), and the Harvard College Research Program. The author thanks the anonymous referees for their helpful feedback and suggestions. He is also indebted to Joe Gallian for his dedication and organization of the University of Minnesota Duluth REU. Lastly, a special thanks to Joe Gallian, Amanda Burcroff, Maya Sankar, and Andrew Kwon for their invaluable advice on this paper.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author states that there is no conflict of interest. The manuscript has no associated data.
Additional information
Communicated by Mathilde Bouvel.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Sun, N. On d-Permutations and Pattern Avoidance Classes. Ann. Comb. (2024). https://doi.org/10.1007/s00026-024-00695-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00026-024-00695-1