Using large random permutations to partition permutation classes

[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. Search in Google Scholar

[2] M. H. Albert, C. Bean, A. Claesson, É. Nadeau, J. Pantone and H. Ulfarsson, Combinatorial Exploration: An algorithmic framework for enumeration, arXiv: 2202.07715. Search in Google Scholar

[3] M. D. Atkinson, Restricted permutations, Discrete Math., 195 (1999) 27–38. Search in Google Scholar

[4] J. West, Generating trees and forbidden subsequences, Discrete Math., 157 (1996) 363–374. Search in Google Scholar

Language:: English

Publication timeframe:: 4 times per year
Journal Subjects:: Computer Sciences, Theoretical Computer Sciences, Business and Economics, Mathematics and Statistics for Economists, Mathematics, Mathematics, Analysis, Differential Equations and Dynamical Systems

Journal RSS Feed

Using large random permutations to partition permutation classes

Christian Bean

Émile Nadeau

Jay Pantone

Henning Ulfarsson

Published Online: Jun 18, 2022

Page range: 31 - 36

Received: Mar 31, 2022

Accepted: May 15, 2022

DOI: https://doi.org/10.2478/puma-2022-0006

Keywordspermutation pattern, random sampling, clustering

© 2022 Christian Bean et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Keywords
permutation pattern, random sampling, clustering