This is the companion page to the paper [BBF+19]. You will find here the sage worksheets in which the examples are treated. They use our implementation of the specification algorithm for permutation classes introduced in [BBP+17].

- [BBP+17] F. Bassino, M. Bouvel, A. Pierrot, C. Pivoteau, D. Rossin. An algorithm computing combinatorial specifications of permutation classes.
*Discrete Applied Mathematics*, 224:16-44, 2017. - [BBF+19] F. Bassino, M. Bouvel, V. Féray, L. Gerin, M.Maazoun, A. Pierrot. Scaling limits of permutations classes with a finite specification: a dichotomy. Preprint ArXiv:1903.07522, 2019.

- examples/AsymmetricX.ipynb
- examples/Branching.ipynb
- examples/Union.ipynb
- examples/X.ipynb
- examples/Av132.ipynb
- examples/DoubleX.ipynb
- examples/V.ipynb

To run those examples yourself, or try other classes, two options are available:

- First option: download and run the specifier algorithm. It comes bundled with the present examples. You need Sage installed. More information at the project page.
- Second option: import the files in your CoCalc account by using this link. You need to create or log into an account and copy the files to your own project to be able to modify and/or execute them.