• Corpus ID: 117919275

Galois theory, graphs and free groups

@article{Everitt2006GaloisTG,
  title={Galois theory, graphs and free groups},
  author={Brent Everitt},
  journal={arXiv: Group Theory},
  year={2006}
}
  • B. Everitt
  • Published 14 June 2006
  • Mathematics
  • arXiv: Group Theory
A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about free groups are derived. 
Solvable groups, Cayley graphs and Complexes
In this talk, we deal with the solvable groups and we use topological methods to prove some theorems in this field. In particular, we use Cayley graphs to construct suitable 2-complexes corresponding
SOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES
In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to
From 2-Complexes to Group Theory
In this talk, we introduce a topological interpretation for presentation of groups which is presented by Brent Everit in 2003. In particular, Using simplicial complexes and topological methods, we

References

SHOWING 1-10 OF 16 REFERENCES
On the intersection of subgroups of a free group
SummaryThe Hanna Neumann Conjecture says that the intersection of subgroups of rankn+1 andm+1 of a free group has rank at mostnm+1. This paper proves the conjecture for the casem=1. (See Theorem 1.)
Combinatorial Group Theory: A Topological Approach
1. Combinational group theory 2. Spaces and their paths 3. Groupoids 4. The fundamental groupoid and the fundamental group 5. Complexes 6. Coverings of spaces and complexes 7. Coverings and group
Intersections of finitely generated free groups
  • P. Nickolas
  • Mathematics
    Bulletin of the Australian Mathematical Society
  • 1985
A result of Howson is that two finitely generated subgroups U and V of a free group have finitely generated intersection. Hanna Neumann showed further that, if m, n and N are the ranks of U, V and U
On finitely generated subgroups of a free product
1. Introduction. In [2], M. Hall, Jr. proved the following theorem: Let 77 be a finitely generated subgroup of a free group Fand suppose ßi, • • • , ßn are in F but no ßi is in 77. Then we may
Subgroups of Finite Index in Free Groups
  • M. Hall
  • Mathematics
    Canadian Journal of Mathematics
  • 1949
This paper has as its chief aim the establishment of two formulae associated with subgroups of finite index in free groups. The first of these (Theorem 3.1) gives an expression for the total length
Equivalence of the strengthened Hanna Neumann conjecture and the amalgamated graph conjecture
SummaryWe show that Walter Neumann's strengthened form of Hanna Neumann's conjecture on the best possible upper bound for the rank of the intersection of two subgroups of a free group is equivalent
Topology of finite graphs
This paper derives from a course in group theory which I gave at Berkeley in 1982. I wanted to prove the standard theorems on free groups, and discovered that, after a few preliminaries, the notion
Discrete Groups of Motions
This paper deals with the discrete groups of rigid motions of the hyperbolic plane. It is known (12) that the finitely generated, orientation-preserving groups have the following presentations:
A note on free groups
The object of this note is to point out a theorem of M. Hall, Jr. (Theorem 1), proved, but formulated in a weaker form, as Theorem 5.1 of [2]. We then show that results of Karrass and Solitar [5],
Towards the Hanna Neumann conjecture using Dicks' method
The Hanna Neumann conjecture states that the intersection of two nontrivial subgroups of rankk+1 andl+1 of a free group has rank at mostkl+1. In a recent paper [3] W. Dicks proved that a strengthened
...
1
2
...