Towards the Hanna Neumann conjecture using Dicks' method

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The Hanna Neumann conjecture states that the intersection of two nontrivial subgroups of rank k + 1 and l + 1 of a free group has rank at most kl + 1. In a recent paper [3] W. Dicks proved that a strengthened form of this conjecture is equivalent to his amalgamated graph conjecture. He used this equivalence to reprove all known upper bounds on the rank of the intersection. We use his method to improve these bounds. In particular we prove an upper bound of 2kl - k - l + 1 for the rank of the intersection above (k, l ≧ 2) improving the earlier 2kl - min(k, l) bound of [1]. We prove a special case of the amalgamated graph conjecture in the hope that it may lead to a proof of the general case and thus of the strengthened Hanna Neumann conjecture.

Original languageEnglish
Pages (from-to)95-104
Number of pages10
JournalInventiones Mathematicae
Volume123
Issue number1
DOIs
Publication statusPublished - Jan 1996

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Towards the Hanna Neumann conjecture using Dicks' method'. Together they form a unique fingerprint.

  • Cite this