PreprintCC BY-NC-SA 4.0arXiv
Almost Symmetric Linear Arc Monadic Datalog and Transitive Tournaments
Abstract
We introduce n-almost symmetric Datalog and study n-almost symmetric linear arc monadic Datalog. We characterize the finite relational structures whose constraint satisfaction problem is solved by this Datalog fragment as those that can be primitive positively constructed from the transitive tournament on n+2 vertices. We also give characterizations in terms of a certain homomorphism duality (which we call n-fixed unfolded caterpillar duality) and in universal-algebraic terms (the existence of k-absorptive operations and of operations forming an elevator chain of length n+1). This article generalizes the results from Bodirsky and Starke about symmetric linear arc monadic Datalog.
Versions
Related
- Conservative CSPs in Logspace are in Symmetric Linear Datalog (under complexity theoretic assumptions)
- Random Tournaments Are Asymptotically Almost Surely Link-irregular
- Reduction for flag-transitive symmetric 2-designs with gcd(k, λ) = p
- Almost sure exponential stability of multi-dimensional stochastic systems driven by a symmetric α-stable process
- Betti Sequences of Four-Generated Non-Almost-Symmetric Nearly Gorenstein Numerical Semigroup Rings
BibTeX
@misc{meyer2026almost,
title = {{Almost Symmetric Linear Arc Monadic Datalog and Transitive Tournaments}},
author = {Sebastian Meyer and Florian Starke},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2606.24711},
eprint = {2606.24711},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.24711},
note = {CC BY-NC-SA 4.0},
}
RIS
TY - UNPB
TI - Almost Symmetric Linear Arc Monadic Datalog and Transitive Tournaments
AU - Sebastian Meyer
AU - Florian Starke
PY - 2026
DA - 2026/11/04
PB - arXiv
DO - 10.48550/arxiv.2606.24711
UR - https://arxiv.org/abs/2606.24711
AB - We introduce n-almost symmetric Datalog and study n-almost symmetric linear arc monadic Datalog. We characterize the finite relational structures whose constraint satisfaction problem is solved by this Datalog fragment as those that can be primitive positively constructed from the transitive tournament on n+2 vertices. We also give characterizations in terms of a certain homomorphism duality (which we call n-fixed unfolded caterpillar duality) and in universal-algebraic terms (the existence of k-absorptive operations and of operations forming an elevator chain of length n+1). This article generalizes the results from Bodirsky and Starke about symmetric linear arc monadic Datalog.
ER -