Complexities of relational structures
Combinatorics
2013-09-18 v1 Computational Complexity
Abstract
The relational complexity, introduced by G. Cherlin, G. Martin, and D. Saracino, is a measure of ultrahomogeneity of a relational structure. It provides an information on minimal arity of additional invariant relations needed to turn given structure into an ultrahomogeneous one. The original motivation was group theory. This work focuses more on structures and provides an alternative approach. Our study is motivated by related concept of lift complexity studied by Hubicka and Nesetril.
Cite
@article{arxiv.1309.4266,
title = {Complexities of relational structures},
author = {David Hartman and Jan Hubicka and Jaroslav Nesetril},
journal= {arXiv preprint arXiv:1309.4266},
year = {2013}
}
Comments
18 pages, submitted to Mathematica Slovaca