Strongly transitive multiple trees
classification
🧮 math.GR
math.LO
keywords
treesmultipleconstructionstronglytransitiveamalgamationautomorphismcodistance
read the original abstract
We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield multiple trees.
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.