Combinatorial Exploration: An algorithmic framework for enumeration

Albert, Michael H.; Bean, Christian; Claesson, Anders; Nadeau, Émile; Pantone, Jay; Ulfarsson, Henning

doi:10.48550/arXiv.2202.07715

All Outputs (3)

On the generating functions of pattern-avoiding Motzkin paths (2022)
Journal Article
Bean, C., Bernini, A., Cervetti, M., & Ferrari, L. (2022). On the generating functions of pattern-avoiding Motzkin paths. Journal of Symbolic Computation, 113, 126-138. https://doi.org/10.1016/j.jsc.2022.02.006

Using large random permutations to partition permutation classes (2022)
Journal Article
Bean, C., Nadeau, E., Pantone, J., & Ulfarsson, H. (2022). Using large random permutations to partition permutation classes. https://doi.org/10.2478/puma-2022-0006

<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 a... Read More about Using large random permutations to partition permutation classes.

Combinatorial Exploration: An algorithmic framework for enumeration (2022)
Journal Article
Albert, M. H., Bean, C., Claesson, A., Nadeau, É., Pantone, J., & Ulfarsson, H. (2022). Combinatorial Exploration: An algorithmic framework for enumeration. arXiv, https://doi.org/10.48550/arXiv.2202.07715