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...

Full description

Bibliographic Details

Published in:	2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) pp. 678 - 690
Main Authors:	Campbell, Rutger, Guillon, Bruno, Kante, Mamadou Moustapha, Kim, Eun Jung, Oum, Sang-il
Format:	Conference Proceeding
Language:	English
Published:	IEEE 23.06.2025
Subjects:	branch-width Computer science decomposition-width definability Galois fields Logic matroid monadic second-order logic path-width recognisability transduction
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!