Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width

Let {\mathbb{F}} be a finite field. We prove that there is an MSO-transduction which, given an {\mathbb{F}}-representable matroid of path-width k, produces a branch-decomposition of width at most f(k), for some function f. As a corollary, any recognizable property of {\mathbb{F}}-representable matro...

Celý popis

Podrobná bibliografia

Vydané v:	2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) s. 678 - 690
Hlavní autori:	Campbell, Rutger, Guillon, Bruno, Kante, Mamadou Moustapha, Kim, Eun Jung, Oum, Sang-il
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 23.06.2025
Predmet:	branch-width Computer science decomposition-width definability Galois fields Logic matroid monadic second-order logic path-width recognisability transduction
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!