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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.