Bean, C, Nadeau, É, Pantone, J and Ulfarsson, H (2022) Using large random permutations to partition permutation classes. Pure Mathematics and Applications, 30 (1). 31 - 36.

[thumbnail of 10.2478_puma-2022-0006.pdf]
10.2478_puma-2022-0006.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (469kB) | Preview


<jats:title>Abstract</jats:title> <jats:p>Permutation classes are sets of permutations defined by the absence of certain substructures. In some cases permutation classes can be decomposed as unions of subclasses. We use combinatorial specifications automatically discovered by <jats:italic>Combinatorial Exploration: An algorithmic framework for enumeration</jats:italic>, Albert et al. 2022, to uniformly generate large random permutations in a permutation class, and apply clustering methods to partition them into interesting subclasses. We seek to automate as much of this process as possible.</jats:p>

Item Type: Article
Additional Information: © 2022 Christian Bean et al., published by Sciendo This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Natural Sciences > School of Computing and Mathematics
Depositing User: Symplectic
Date Deposited: 03 May 2023 13:35
Last Modified: 03 May 2023 13:35

Actions (login required)

View Item
View Item