Skip to main content

Research Repository

Advanced Search

Using large random permutations to partition permutation classes

Bean, Christian; Nadeau, Emile; Pantone, Jay; Ulfarsson, Henning

Using large random permutations to partition permutation classes Thumbnail


Authors

Emile Nadeau

Jay Pantone

Henning Ulfarsson



Abstract

<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>

Acceptance Date May 15, 2022
Online Publication Date Jun 18, 2022
Publication Date Jun 1, 2022
Journal Pure Mathematics and Applications
Pages 31 - 36
DOI https://doi.org/10.2478/puma-2022-0006
Publisher URL https://sciendo.com/article/10.2478/puma-2022-0006

Files




You might also like



Downloadable Citations