Decidability in geometric grid classes of permutations
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909914514849792 |
|---|---|
| author | Braunfeld, Samuel |
| author_facet | Braunfeld, Samuel |
| contents | We prove that the basis and the generating function of a geometric grid class of permutations Geom$(M)$ are computable from the matrix $M$, as well as some variations on this result. Our main tool is monadic second-order logic on permutations and words. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_04201 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Decidability in geometric grid classes of permutations Braunfeld, Samuel Combinatorics Logic We prove that the basis and the generating function of a geometric grid class of permutations Geom$(M)$ are computable from the matrix $M$, as well as some variations on this result. Our main tool is monadic second-order logic on permutations and words. |
| title | Decidability in geometric grid classes of permutations |
| topic | Combinatorics Logic |
| url | https://arxiv.org/abs/2308.04201 |