Highly Transitive Actions of Out(Fn)
classification
🧮 math.GR
keywords
transitivehighlyactiongroupk-transitiveactionsadmitscalled
read the original abstract
An action of a group on a set is called k-transitive if it is transitive on ordered k-tuples and highly transitive if it is k-transitive for every k. We show that for n>3 the group Out(Fn) = Aut(Fn)/Inn(Fn) admits a faithful highly transitive action on a countable set.
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.