A Myhill-Nerode theorem for hypergraphs is proven and applied to establish non-monadic definability of gain-graphic matroids for groups that are not uniformly locally finite or have infinite conviviality graphs.
Downey, Michael R
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Myhill-Nerode for hypergraphs and an application to gain-graphic matroids
A Myhill-Nerode theorem for hypergraphs is proven and applied to establish non-monadic definability of gain-graphic matroids for groups that are not uniformly locally finite or have infinite conviviality graphs.