Michael H. Albert
Combinatorial Exploration: An algorithmic framework for enumeration
Albert, Michael H.; Bean, Christian; Claesson, Anders; Nadeau, Émile; Pantone, Jay; Ulfarsson, Henning
Authors
Citation
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
Journal Article Type | Article |
---|---|
Acceptance Date | Feb 15, 2022 |
Online Publication Date | Feb 15, 2022 |
Publication Date | Feb 15, 2022 |
Deposit Date | Dec 20, 2024 |
Journal | arXiv |
Print ISSN | 2331-8422 |
Publisher | Cornell University |
Peer Reviewed | Peer Reviewed |
DOI | https://doi.org/10.48550/arXiv.2202.07715 |
Public URL | https://keele-repository.worktribe.com/output/1020217 |
Publisher URL | https://arxiv.org/abs/2202.07715# |
You might also like
Algorithmic coincidence classification of mesh patterns
(2023)
Journal Article
Using large random permutations to partition permutation classes
(2022)
Journal Article
Permutations Avoiding Bipartite Partially Ordered Patterns Have a Regular Insertion Encoding
(2024)
Journal Article
On the generating functions of pattern-avoiding Motzkin paths
(2022)
Journal Article
Enumeration of Permutation Classes and Weighted Labelled Independent Sets
(2021)
Journal Article
Downloadable Citations
About Keele Repository
Administrator e-mail: research.openaccess@keele.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search