scholarly journals Determining whether a finite group of outer automorphisms of a free group is geometric

2005 ◽  
Vol 195 (2) ◽  
pp. 211-224
Author(s):  
Christopher Thomas
Keyword(s):  
Finite Group ◽  
Free Group ◽  
Outer Automorphisms ◽  
A Finite Group

Simple groups and irreducible lattices in wreath products

2020 ◽  
pp. 1-12 ◽  
Author(s):  
ADRIEN LE BOUDEC
Keyword(s):  
Finite Group ◽  
Wreath Product ◽  
Free Group ◽  
Wreath Products ◽  
Simple Groups ◽  
Finitely Generated ◽  
Locally Compact ◽  
Regular Tree ◽  
Finitely Generated Groups ◽  
A Finite Group

We consider the finitely generated groups acting on a regular tree with almost prescribed local action. We show that these groups embed as cocompact irreducible lattices in some locally compact wreath products. This provides examples of finitely generated simple groups quasi-isometric to a wreath product $C\wr F$ , where $C$ is a finite group and $F$ a non-abelian free group.

scholarly journals CONJUGATE PAIRS OF SUBFACTORS AND ENTROPY FOR AUTOMORPHISMS

2011 ◽  
Vol 22 (04) ◽  
pp. 577-592 ◽  
Author(s):  
MARIE CHODA
Keyword(s):  
Finite Group ◽  
Crossed Product ◽  
View Point ◽  
Jones Index ◽  
Outer Automorphisms ◽  
Outer Action ◽  
A Finite Group

Based on the fact that, for a subfactor N of a II1factor M, the first nontrivial Jones index is two and then M is decomposed as the crossed product of N by an outer action of ℤ2, we study pairs {N, uNu*} from the view-point of entropy for two subalgebras of M in connection with the entropy for automorphisms, where the inclusion of II1factors N ⊂ M is given with M being the crossed product of N by a finite group of outer automorphisms and u is a unitary in M.

Size of free groups in varieties generated by finite groups

2019 ◽  
Vol 29 (08) ◽  
pp. 1419-1430
Author(s):  
William Cocke
Keyword(s):  
Finite Group ◽  
Free Group ◽  
Finite Groups ◽  
Prime Order ◽  
Free Groups ◽  
Affine Group ◽  
Alternating Group ◽  
A Finite Group

The number of distinct [Formula: see text]-variable word maps on a finite group [Formula: see text] is the order of the rank [Formula: see text] free group in the variety generated by [Formula: see text]. For a group [Formula: see text], the number of word maps on just two variables can be quite large. We improve upon previous bounds for the number of word maps over a finite group [Formula: see text]. Moreover, we show that our bound is sharp for the number of 2-variable word maps over the affine group over fields of prime order and over the alternating group on five symbols.

scholarly journals Proficient presentations and direct products of finite groups

1999 ◽  
Vol 60 (2) ◽  
pp. 177-189 ◽  
Author(s):  
K.W. Gruenberg ◽  
L.G. Kovács
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Free Group ◽  
Finite Groups ◽  
Finite Rank ◽  
Module Structure ◽  
Direct Products ◽  
The Difference ◽  
A Finite Group ◽  
Open Question

Let G be a finite group, F a free group of finite rank, R the kernel of a homomorphism φ of F onto G, and let [R, F], [R, R] denote mutual commutator subgroups. Conjugation in F yields a G-module structure on R/[R, R] let dg(R/[R, R]) be the number of elements required to generate this module. Define d(R/[R, F]) similarly. By an earlier result of the first author, for a fixed G, the difference dG(R/[R, R]) − d(R/[R, F]) is independent of the choice of F and φ; here it is called the proficiency gap of G. If this gap is 0, then G is said to be proficient. It has been more usual to consider dF(R), the number of elements required to generate R as normal subgroup of F: the group G has been called efficient if F and φ can be chosen so that dF(R) = dG(R/[R, F]). An efficient group is necessarily proficient; but (though usually expressed in different terms) the converse has been an open question for some time.

scholarly journals Groups with large conjugacy classes

1977 ◽  
Vol 24 (3) ◽  
pp. 257-265 ◽  
Author(s):  
Bola O. Balogun
Keyword(s):  
Finite Group ◽  
Symmetric Group ◽  
Free Group ◽  
Conjugacy Classes ◽  
A Finite Group

AbstractA finite group is called repetition-free if its conjugacy classes have distinct sizes. It is known that a supersolvable repetition-free group is necessarily isomorphie to Sym(3). the symmetric group on three symbols. Thus the question arises as to whether Sym (3) is the only repetition-free group. In this paper it is proved that if mk denotes the minimum of the orders of the centralizers of elements of a repetition-free group G and mk ≦ 4 then G is isomorphie to Sym (3).

Systems of equations and generalized characters in groups

1970 ◽  
Vol 22 (5) ◽  
pp. 1040-1046 ◽  
Author(s):  
I. M. Isaacs
Keyword(s):  
Finite Group ◽  
Group Theory ◽  
Free Group ◽  
Equivalence Relation ◽  
Elementary Proof ◽  
Systems Of Equations ◽  
Recent Application ◽  
Arbitrary Group ◽  
Frobenius Theorem ◽  
A Finite Group

Let F be the free group on n generators x1, …, Xn and let G be an arbitrary group. An element ω ∈ F determines a function x → ω(x) from n-tuples x = (x1, x2, …, xn) ∈ Gn into G. In a recent paper [5] Solomon showed that if ω1, ω2, …, ωm ∈ F with m < n, and K1, …, Km are conjugacy classes of a finite group G, then the number of x ∈ Gn with ωi(x) ∈ Ki for each i, is divisible by |G|. Solomon proved this by constructing a suitable equivalence relation on Gn.Another recent application of an unusual equivalence relation in group theory is in Brauer's paper [1], where he gives an elementary proof of the Frobenius theorem on solutions of xk = 1 in a group.

scholarly journals Rigid automorphisms of linking systems

2021 ◽  
Vol 9 ◽  
Author(s):  
George Glauberman ◽  
Justin Lynd
Keyword(s):  
Finite Group ◽  
Sylow Subgroup ◽  
Fusion Systems ◽  
Outer Automorphisms ◽  
Inner Automorphism ◽  
Inner Automorphisms ◽  
A Finite Group

Abstract A rigid automorphism of a linking system is an automorphism that restricts to the identity on the Sylow subgroup. A rigid inner automorphism is conjugation by an element in the center of the Sylow subgroup. At odd primes, it is known that each rigid automorphism of a centric linking system is inner. We prove that the group of rigid outer automorphisms of a linking system at the prime $2$ is elementary abelian and that it splits over the subgroup of rigid inner automorphisms. In a second result, we show that if an automorphism of a finite group G restricts to the identity on the centric linking system for G, then it is of $p'$ -order modulo the group of inner automorphisms, provided G has no nontrivial normal $p'$ -subgroups. We present two applications of this last result, one to tame fusion systems.

Sign in / Sign up

Export Citation Format

Share Document