Decidability in geometric grid classes of permutations
Proceedings of the American Mathematical Society · 12.12.2024 · 153 (3) · 987-1000
DOI: 10.1090/proc/17083 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the American Mathematical Society, online erschienen am 12.12.2024. Verfasst von Samuel Braunfeld. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 22 Literaturangaben. Gefördert von: Grantová Agentura České Republiky.
Abstract (Originalsprache)
We prove that the basis and the generating function of a geometric grid class of permutations G e o m ( M ) \mathrm {Geom}(M) are computable from the matrix M M , as well as some variations on this result. Our main tool is monadic second-order logic on permutations and words.
Förderung
- Grantová Agentura České Republiky
Zitieren
APA
Braunfeld, S. (2024). Decidability in geometric grid classes of permutations. Proceedings of the American Mathematical Society, 153(3), 987-1000. https://doi.org/10.1090/proc/17083
Vancouver
Braunfeld S. Decidability in geometric grid classes of permutations. Proceedings of the American Mathematical Society. 2024;153(3):987-1000. doi:10.1090/proc/17083
BibTeX
@article{Braunfeld2024,
author = {Braunfeld, Samuel},
title = {Decidability in geometric grid classes of permutations},
journal = {Proceedings of the American Mathematical Society},
year = {2024},
volume = {153},
number = {3},
pages = {987--1000},
doi = {10.1090/proc/17083}
}
EUVIMED