Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Using large random permutations to partition permutation classes

Using large random permutations to partition permutation classes AbstractPermutation 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 Combinatorial Exploration: An algorithmic framework for enumeration, 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Pure Mathematics and Applications de Gruyter

Using large random permutations to partition permutation classes

Download PDF
6 pages

Loading next page...
 
/lp/de-gruyter/using-large-random-permutations-to-partition-permutation-classes-CmBeDhM0Vo
Publisher
de Gruyter
Copyright
© 2022 Christian Bean et al., published by Sciendo
eISSN
1788-800X
DOI
10.2478/puma-2022-0006
Publisher site
See Article on Publisher Site

Abstract

AbstractPermutation 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 Combinatorial Exploration: An algorithmic framework for enumeration, 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.

Journal

Pure Mathematics and Applications – de Gruyter

Published: Jun 1, 2022

Keywords: permutation pattern; random sampling; clustering; 05A05

There are no references for this article.