Metraipolis › archive › dc_a2ed30394f76

Co-Decompositions and FO Model Checking — arXiv:2611.04658

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04658
License (as archived)
CC0-1.0
Archived
2026-11-04T19:00:20.145Z
SHA-256 of the archived text
e3c3521c9912ad8e0e065f818d86dfd286c574e9fd2803731e94b6cf343ccc8e
Stable URL of this page
https://metraipolis.com/documento/dc_a2ed30394f76

How to cite

Co-Decompositions and FO Model Checking — arXiv:2611.04658 — arXiv (en), https://arxiv.org/abs/2611.04658 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a2ed30394f76 (Metraipolis archive dc_a2ed30394f76, sha256 e3c3521c9912ad8e0e065f818d86dfd286c574e9fd2803731e94b6cf343ccc8e)
BibTeX
@misc{dca2ed30394f76,
  title = {Co-Decompositions and FO Model Checking — arXiv:2611.04658},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04658},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a2ed30394f76; sha256 e3c3521c9912ad8e0e065f818d86dfd286c574e9fd2803731e94b6cf343ccc8e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04658. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Tree decompositions describe large graphs as gluings of smaller component parts. Here we study their categorical duals, tree co-decompositions, which construct large graphs via fibered products of small constituent parts. Co-decompositions are compressed representations of graphs or relational structures: the decomposed object can be exponentially larger than the space required to specify the co-decomposition. Our main contribution is an algorithmic meta-theorem for first order logic: given only a co-decomposition of a $\sigma$-structure $G$ with $b$ bags, each of size at most $w$ and an FO sentence $\phi$, there is an algorithm which, without ever constructing or inspecting $G$, operates on the co-decomposition and determines whether $G \models \phi$ in time $f_\sigma(w,|\varphi|)\cdot b$. We pair this algorithm with structural results on tree co-width, including its relationship to tree-width and a separation from twin-width. Furthermore, we characterize bounded path co-width using a graph grammar. In contrast to our logical meta-theorem, we prove that $(s,t)$-Path becomes NP-hard on co-decomposition inputs. These results demonstrate how categorical constructions can enable efficient computation on exponentially compressed structures.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Category Theory (math.CT).
Pagina del lavoro: https://arxiv.org/abs/2611.04658 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:38:22.315Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).