About: On decidability of MSO theories of combinatorial structures: Towards general matroids?     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • We study the problem of decidability of MSO theories on various (restricted) matroid classes. When considering the matroids representable over a finite field (which is in structural sense similar to graphs embedded on a surface), the situation resembles ordinary graphs as incidence structures. The MSO theory of all matroids over a finite field of bounded branch-width is decidable [Hlineny 2003]. Conversely, decidability of matroid MSO theory (over a finite field) implies a universal bound on branch-width [Hlineny, Seese 2005]. The situation gets much more versatile and interesting when considering matroids in general (as %22abstract%22, without a particular representation). We shall focus mainly on this part, and present some particular observations and results, and mainly open questions and directions for future research. This is related to another interesting question already raised by [Hlineny, Seese, 2006], what is a %22good%22 width measure for general matroids?
  • We study the problem of decidability of MSO theories on various (restricted) matroid classes. When considering the matroids representable over a finite field (which is in structural sense similar to graphs embedded on a surface), the situation resembles ordinary graphs as incidence structures. The MSO theory of all matroids over a finite field of bounded branch-width is decidable [Hlineny 2003]. Conversely, decidability of matroid MSO theory (over a finite field) implies a universal bound on branch-width [Hlineny, Seese 2005]. The situation gets much more versatile and interesting when considering matroids in general (as %22abstract%22, without a particular representation). We shall focus mainly on this part, and present some particular observations and results, and mainly open questions and directions for future research. This is related to another interesting question already raised by [Hlineny, Seese, 2006], what is a %22good%22 width measure for general matroids? (en)
  • We study the problem of decidability of MSO theories on various (restricted) matroid classes. When considering the matroids representable over a finite field (which is in structural sense similar to graphs embedded on a surface), the situation resembles ordinary graphs as incidence structures. The MSO theory of all matroids over a finite field of bounded branch-width is decidable [Hlineny 2003]. Conversely, decidability of matroid MSO theory (over a finite field) implies a universal bound on branch-width [Hlineny, Seese 2005]. The situation gets much more versatile and interesting when considering matroids in general (as %22abstract%22, without a particular representation). We shall focus mainly on this part, and present some particular observations and results, and mainly open questions and directions for future research. This is related to another interesting question already raised by [Hlineny, Seese, 2006], what is a %22good%22 width measure for general matroids? (cs)
Title
  • On decidability of MSO theories of combinatorial structures: Towards general matroids?
  • On decidability of MSO theories of combinatorial structures: Towards general matroids? (en)
  • On decidability of MSO theories of combinatorial structures: Towards general matroids? (cs)
skos:prefLabel
  • On decidability of MSO theories of combinatorial structures: Towards general matroids?
  • On decidability of MSO theories of combinatorial structures: Towards general matroids? (en)
  • On decidability of MSO theories of combinatorial structures: Towards general matroids? (cs)
skos:notation
  • RIV/61989100:27240/06:00013589!RIV07-GA0-27240___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/05/0050)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 490298
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27240/06:00013589
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • matroid; MSO logic; decidability; width (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [8D94EF9656AB]
http://linked.open...v/mistoKonaniAkce
  • Szeged, Hungary
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/statKonaniAkce
http://linked.open...iv/tvurceVysledku
  • Hliněný, Petr
  • Seese, Detlef
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/ukonceniAkce
http://linked.open.../riv/zahajeniAkce
http://localhost/t...ganizacniJednotka
  • 27240
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software