Given an endomorphism h of a free group F, the fixed subgroup of h consists of those elements x ∈ F for which h(x)=x. In this talk I will give some background on fixed subgroups in free groups, and then present an algorithm which computes the fixed subgroup and the stable image for any endomorphism of the free group of rank 2. This answers, for rank 2, a question posed by Stallings in 1984 and a more recent question of Ventura. I will explain why general endomorphisms are more difficult than automorphisms, and in what ways our algorithm needs the restriction on the rank. This is joint work with Alan Logan.
Tag - Infinite groups
A finite graph that can be obtained from a given graph by contracting edges and removing vertices and edges is said to be a minor of this graph. Minors have played an important role in graph theory, ever since the well-known result of Kuratowski that characterized planar graphs as those that do not admit the complete graph on five vertices nor the complete bipartite graph on (3,3) vertices as minors. In this talk, we will explore how this concept interacts with some notions from geometric group theory, and describe a new characterisation of virtually free groups in terms of minors of their Cayley graphs.
I will describe a new proof, joint with Adam Piggott (UQ), that groups presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 are exactly the plain groups (free products of finite and infinite cyclic groups). Our proof relies on a new result about properties of embedded circuits in geodetic graphs, which may be of independent interest in graph theory.
A non-compact, compactly generated, locally compact group whose proper quotients are all compact is called just-non-compact. Discrete just-non-compact groups are John Wilson’s famous just-infinite groups. In this talk, I'll describe an ongoing project to use permutation groups to better understand the class of just-non-compact groups that are totally disconnected. An important step for this project has recently been completed: there is now a structure theorem for non-compact tdlc groups G that have a compact open subgroup that is maximal. Using this structure theorem, together with Cheryl Praeger and Csaba Schneider’s recent work on homogeneous cartesian decompositions, one can deduce a neat test for whether the monolith of such a group G is a one-ended group in the class 𝒮 of non-discrete, topologically simple, compactly generated, tdlc groups. This class 𝒮 plays a fundamental role in the structure theory of compactly generated tdlc groups, and few types of groups in 𝒮 are known.
In 1967 Richard Thompson introduced the group F, hoping that it was non-amenable, since then it would disprove the von Neumann conjecture. Though the conjecture has subsequently been disproved, the question of the amenability of Thompson's group F has still not been rigorously settled. In this talk I will present the most comprehensive numerical attack on this problem that has yet been mounted. I will first give a history of the problem, including mention of the many incorrect "proofs" of amenability or non-amenability. Then I will give details of a new, efficient algorithm for obtaining terms of the co-growth sequence. Finally I will describe a number of numerical methods to analyse the co-growth sequences of a number of infinite, finitely-generated groups, and show how these methods provide compelling evidence (though of course not a proof) that Thompson's group F is not amenable. I will also describe an alternative route to a rigorous proof.
The theory of EG, the class of elementary amenable groups, has developed steadily since the class was introduced constructively by Day in 1957. At that time, it was unclear whether or not EG was equal to the class AG of all amenable groups. Highlights of this development certainly include Chou's article in 1980 which develops much of the basic structure theory of the class EG, and Grigorchuk's 1985 result showing that the first Grigorchuk group G is amenable but not elementary amenable. In this talk we report on work where we demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group F which is strictly well-ordered by the embeddability relation in type ε0 + 1. All except the maximum element of this family (which is F itself) are elementary amenable groups. In this way, for each α less than ε0, we obtain a finitely generated elementary amenable subgroup of F whose EA-class is α + 2. The talk will is pitched for an algebraically inclined audience, but little background knowledge will be assumed.
We show that for almost all primitive integral cohomology classes in the fibred cone of a closed fibred hyperbolic 3-manifold, the monodromy normally generates the mapping class group of the fibre. The key idea of the proof is to use Fried’s theory of suspension flow and dynamic blow-up of Mosher. If the time permits, we also discuss the non-existence of the analogue of Fried’s continuous extension of the normalized entropy over the fibered face in the case of asymptotic translation lengths on the curve complex.
I will begin with the definition of topological full groups and explain various examples of them. The topological full group arising from a minimal homeomorphism on a Cantor set gave the first example of finitely generated simple groups that are amenable and infinite. The topological full groups of one-sided shifts of finite type are viewed as generalization of the Higman-Thompson groups. Based on these two fundamental examples, I will discuss recent development of the study around topological full groups.
We explain the proof that Neretin groups have no non-trivial ergodic invariant random subgroups (IRS). Equivalently, any non-trivial ergodic p.m.p. action of Neretin’s group is essentially free. This property can be thought of as simplicity in the sense of measurable dynamics; while Neretin groups were known to be abstractly simple by a result of Kapoudjian. The heart of the proof is a 'double commutator' lemma for IRSs of elliptic subgroups.
The notion of a "hierarchically hyperbolic space/group" grows out of geometric similarities between CAT(0) cubical groups and mapping class groups. Hierarchical hyperbolicity is a "coarse nonpositive curvature" property that is more restrictive than acylindrical hyperbolicity but general enough to include many of the usual suspects in geometric group theory. The class of hierarchically hyperbolic groups is also closed under various procedures for constructing new groups from old, and the theory can be used, for example, to bound the asymptotic dimension and to study quasi-isometric rigidity for various groups. One disadvantage of the theory is that the definition - which is coarse-geometric and just an abstraction of properties of mapping class groups and cube complexes - is complicated. We therefore present a comparatively simple sufficient condition for a group to be hierarchically hyperbolic, in terms of an action on a hyperbolic simplicial complex. I will discuss some applications of this criterion to mapping class groups and (non-right-angled) Artin groups.

You must be logged in to post a comment.