Using large random permutations to partition permutation classes
References
- [1] M. H. Albert, M. D. Atkinson and R. Brignall, The enumeration of permutations avoiding 2143 and 4231, Pure Math. Appl. (PU.M.A), 22 (2011) 87_98.
- [2] M. H. A
lbert , C. Bean , A. Claesson , É. Nadeau , J. Pantone and H. Ulfarsson , Combinatorial Exploration: An algorithmic framework for enumeration, arXiv: 2202.07715. - [3] M. D. A
tkinson , Restricted permutations, Discrete Math., 195 (1999) 27–38. - [4] J. W
est , Generating trees and forbidden subsequences, Discrete Math., 157 (1996) 363–374.
DOI: https://doi.org/10.2478/puma-2022-0006 | Journal eISSN: 1788-800X
Language: English
Page range: 31 - 36
Submitted on: Mar 31, 2022
Accepted on: May 15, 2022
Published on: Jun 18, 2022
Published by: Corvinus University of Budapest
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2022 Christian Bean, Émile Nadeau, Jay Pantone, Henning Ulfarsson, published by Corvinus University of Budapest
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.