SearcharxivSearch

arXiv subjects

John K. Truss

Publications and source records attributed to John K. Truss.

4 recordsLinked to original sources

Ehrenfeucht-Fraisse games on a class of scattered linear orders

Two structures $A$ and $B$ are $n$-equivalent if player II has a winning strategy in the $n$-move Ehrenfeucht-Fraïssé game on $A$ and $B$. In earlier papers we studied $n$-equivalence classes of ordinals and coloured ordinals. In this paper we similarly treat a class of scattered order-types, focussing on monomials and sums of monomials in $ω$ and its reverse $ω^*$.

math.LO

Some more notions of homomorphism-homogeneity

We extend the notion of 'homomorphism-homogeneity' to a wider class of kinds of maps than previously studied, and we investigate the relations between the resulting notions of homomorphism-homogeneity, giving several examples. We also give further details on related work reported in [Deborah Lockett and John K Truss, Generic endomorphisms of homogeneous structures, in 'Groups and model theory', Contemporary Mathematics 576, ed Strungmann, Droste, Fuchs, Tent, American Mathematical Society, 2012, 217-237] about the endomorphisms of chains and generic endomorphisms of tree.

math.CO

Countable locally 2-arc-transitive bipartite graphs

We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We give several new families of previously unknown countably infinite locally-2-arc-transitive graphs, each family containing continuum many members. These examples are obtained by gluing together copies of incidence graphs of semilinear spaces, satisfying a certain symmetry property, in a tree-like way. In one case we show how the classification problem for that family relates to the problem of determining a certain family of highly arc-transitive digraphs. Numerous illustrative examples are given.

math.GR

Classification of some countable descendant-homogeneous digraphs

For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set of any vertex is a q-valent tree. We also give conditions on a rooted digraph G which allow us to construct a countable descendant-homogeneous digraph in which the descendant set of any vertex is isomorphic to G.

math.CO