Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2011)
Simplified Mineyev,preprint
S. Thomas (1988)
Shorter Notes: Fixed Points of Automorphisms of Finitely Generated Free Groups, 103
Warren Dicks, E. Formanek (2001)
The rank three case of the Hanna Neumann ConjectureJournal of Group Theory, 4
J. Friedman (2011)
Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture
W. Imrich (1977)
Subgroup theorems and graphs
A. Martino, E. Ventura (2004)
Fixed Subgroups are Compressed in Free GroupsCommunications in Algebra, 32
G. Tardos (1992)
On the intersection of subgroups of a free groupInventiones mathematicae, 108
Warren Dicks, E. Ventura (1996)
The Group Fixed by a Family of Injective Endomorphisms of a Free Group
Igor Mineyev (2012)
Submultiplicativity and the Hanna Neumann ConjectureAnnals of Mathematics, 175
E. Capell (2002)
Fixed subgroups in free groups: a surveyContemporary mathematics, 296
M. Bestvina, M. Handel (1992)
Train tracks and automorphisms of free groupsAnnals of Mathematics, 135
Charles Miller (2002)
Combinatorial Group Theory
G. Bergman (1999)
Supports of derivations, free factorizations, and ranks of fixed subgroups in free groupsTransactions of the American Mathematical Society, 351
J. Stallings (1983)
Topology of finite graphsInventiones mathematicae, 71
A. Martino, E. Ventura (2003)
A description of auto-flxed subgroups in a free group
A. Howson (1954)
On the Intersection of Finitely Generated Free GroupsJournal of The London Mathematical Society-second Series
Abstract. A subgroup H of a free group F is called inert in F if for every . In this paper we expand the known families of inert subgroups. We show that the inertia property holds for 1-generator endomorphisms. Equivalently, echelon subgroups in free groups are inert. An echelon subgroup is defined through a set of generators that are in echelon form with respect to some ordered basis of the free group, and may be seen as a generalization of a free factor. For example, the fixed subgroups of automorphisms of finitely generated free groups are echelon subgroups. The proofs follow mostly a graph-theoretic or combinatorial approach.
Groups Complexity Cryptology – de Gruyter
Published: Nov 1, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.