Decidability in geometric grid classes of permutations
Combinatorics
2025-11-21 v2 Logic
Abstract
We prove that the basis and the generating function of a geometric grid class of permutations Geom are computable from the matrix , as well as some variations on this result. Our main tool is monadic second-order logic on permutations and words.
Cite
@article{arxiv.2308.04201,
title = {Decidability in geometric grid classes of permutations},
author = {Samuel Braunfeld},
journal= {arXiv preprint arXiv:2308.04201},
year = {2025}
}
Comments
15 pages; final journal version