1-transitive cyclic orderings (Q1024362): Difference between revisions

Let \(X\) be a set and \(R\) be a ternary relation on \(X\). It is said that \((X,R)\) is a cyclic ordering if 1) for all \(a\in X\) a binary relation \(<_a\) on \(X-\{a\}\) is defined by the rule \(x<_a y\) if and only if \(R(a, x, y)\) is a linear ordering; 2) for all \(x ,y ,z\in X\) we have \(R(x, y, z) \Leftrightarrow R(y, z, x) \Leftrightarrow R(x, z, y)\). A coloured cyclic ordering is a triple \((X, R, F)\) where \((X, R)\) is a cyclic ordering and \(F\) maps \(X\) onto a set \(C\), called the set of colours. A coloured cyclic ordering is said to be 1-transitive if for all \(x, y \in X\) with \(F(x) = F(y)\) there is an automorphism taking \(x\) to \(y\). The authors classify all the countable 1-transitive coloured cyclic orderings (Theorem 2.12).