Combinatorial Exploration: An algorithmic framework for enumeration
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912072750596096 |
|---|---|
| author | Albert, Michael H. Bean, Christian Claesson, Anders Nadeau, Émile Pantone, Jay Ulfarsson, Henning |
| author_facet | Albert, Michael H. Bean, Christian Claesson, Anders Nadeau, Émile Pantone, Jay Ulfarsson, Henning |
| contents | Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and provide an open-source Python implementation. As a prerequisite, we build up a new theoretical foundation for combinatorial decomposition strategies and combinatorial specifications.
We then apply Combinatorial Exploration to the domain of permutation patterns, to great effect. We rederive hundreds of results in the literature in a uniform manner and prove many new ones. These results can be found in a new public database, the Permutation Pattern Avoidance Library (PermPAL) at https://permpal.com. Finally, we give three additional proofs-of-concept, showing examples of how Combinatorial Exploration can prove results in the domains of alternating sign matrices, polyominoes, and set partitions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_07715 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Combinatorial Exploration: An algorithmic framework for enumeration Albert, Michael H. Bean, Christian Claesson, Anders Nadeau, Émile Pantone, Jay Ulfarsson, Henning Combinatorics Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and provide an open-source Python implementation. As a prerequisite, we build up a new theoretical foundation for combinatorial decomposition strategies and combinatorial specifications. We then apply Combinatorial Exploration to the domain of permutation patterns, to great effect. We rederive hundreds of results in the literature in a uniform manner and prove many new ones. These results can be found in a new public database, the Permutation Pattern Avoidance Library (PermPAL) at https://permpal.com. Finally, we give three additional proofs-of-concept, showing examples of how Combinatorial Exploration can prove results in the domains of alternating sign matrices, polyominoes, and set partitions. |
| title | Combinatorial Exploration: An algorithmic framework for enumeration |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2202.07715 |