On the effective and automatic enumeration of polynomial permutation classes
Combinatorics
2015-11-17 v3
Abstract
We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations of length n which can be obtained by a finite number of block sorting operations (e.g., reversals, block transpositions, cut-and-paste moves).
Cite
@article{arxiv.1308.4946,
title = {On the effective and automatic enumeration of polynomial permutation classes},
author = {Cheyne Homberger and Vince Vatter},
journal= {arXiv preprint arXiv:1308.4946},
year = {2015}
}