pith. sign in

arxiv: 1309.4266 · v1 · pith:ALP5GADMnew · submitted 2013-09-17 · 🧮 math.CO · cs.CC

Complexities of relational structures

classification 🧮 math.CO cs.CC
keywords relationalcomplexityprovidesstructurestructuresadditionalalternativeapproach
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.