14 research outputs found
Tree automata and pigeonhole classes of matroids -- I
Hlineny's Theorem shows that any sentence in the monadic second-order logic
of matroids can be tested in polynomial time, when the input is limited to a
class of F-representable matroids with bounded branch-width (where F is a
finite field). If each matroid in a class can be decomposed by a subcubic tree
in such a way that only a bounded amount of information flows across displayed
separations, then the class has bounded decomposition-width. We introduce the
pigeonhole property for classes of matroids: if every subclass with bounded
branch-width also has bounded decomposition-width, then the class is
pigeonhole. An efficiently pigeonhole class has a stronger property, involving
an efficiently-computable equivalence relation on subsets of the ground set. We
show that Hlineny's Theorem extends to any efficiently pigeonhole class. In a
sequel paper, we use these ideas to extend Hlineny's Theorem to the classes of
fundamental transversal matroids, lattice path matroids, bicircular matroids,
and H-gain-graphic matroids, where H is any finite group. We also give a
characterisation of the families of hypergraphs that can be described via tree
automata: a family is defined by a tree automaton if and only if it has bounded
decomposition-width. Furthermore, we show that if a class of matroids has the
pigeonhole property, and can be defined in monadic second-order logic, then any
subclass with bounded branch-width has a decidable monadic second-order theory.Comment: Slightly extending the main theorem to cover a more expressive logi
MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width
Seese's conjecture for finite graphs states that monadic second-order logic
(MSO) is undecidable on all graph classes of unbounded clique-width. We show
that to establish this it would suffice to show that grids of unbounded size
can be interpreted in two families of graph classes: minimal hereditary classes
of unbounded clique-width; and antichains of unbounded clique-width under the
induced subgraph relation. We explore a number of known examples of the former
category and establish that grids of unbounded size can indeed be interpreted
in them.Comment: 23 page
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..