Higman group

Last updated

In mathematics, the Higman group, introduced by GrahamHigman  ( 1951 ), was the first example of an infinite finitely presented group with no non-trivial finite quotients. The quotient by the maximal proper normal subgroup is a finitely generated infinite simple group. Higman (1974) later found some finitely presented infinite groups Gn,r that are simple if n is even and have a simple subgroup of index 2 if n is odd, one of which is one of the Thompson groups.

Higman's group is generated by 4 elements a, b, c, d with the relations

Related Research Articles

<span class="mw-page-title-main">Abelian group</span> Commutative group (mathematics)

In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after early 19th century mathematician Niels Henrik Abel.

<span class="mw-page-title-main">Simple group</span> Group without normal subgroups other than the trivial group and itself

In mathematics, a simple group is a nontrivial group whose only normal subgroups are the trivial group and the group itself. A group that is not simple can be broken into two smaller groups, namely a nontrivial normal subgroup and the corresponding quotient group. This process can be repeated, and for finite groups one eventually arrives at uniquely determined simple groups, by the Jordan–Hölder theorem.

<span class="mw-page-title-main">Cyclic group</span> Mathematical group that can be generated as the set of powers of a single element

In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted Cn, that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer power of g in multiplicative notation, or as an integer multiple of g in additive notation. This element g is called a generator of the group.

In mathematics, a presentation is one method of specifying a group. A presentation of a group G comprises a set S of generators—so that every element of the group can be written as a product of powers of some of these generators—and a set R of relations among those generators. We then say G has presentation

In mathematics, a free abelian group is an abelian group with a basis. Being an abelian group means that it is a set with an addition operation that is associative, commutative, and invertible. A basis, also called an integral basis, is a subset such that every element of the group can be uniquely expressed as an integer combination of finitely many basis elements. For instance the two-dimensional integer lattice forms a free abelian group, with coordinatewise addition as its operation, and with the two points (1,0) and (0,1) as its basis. Free abelian groups have properties which make them similar to vector spaces, and may equivalently be called free-modules, the free modules over the integers. Lattice theory studies free abelian subgroups of real vector spaces. In algebraic topology, free abelian groups are used to define chain groups, and in algebraic geometry they are used to define divisors.

<span class="mw-page-title-main">Sporadic group</span> Finite simple set type not classified as Lie, cyclic or alternating

In mathematics, a sporadic group is one of the 26 exceptional groups found in the classification of finite simple groups.

<span class="mw-page-title-main">Conway group</span>

In the area of modern algebra known as group theory, the Conway groups are the three sporadic simple groups Co1, Co2 and Co3 along with the related finite group Co0 introduced by (Conway 1968, 1969).

<span class="mw-page-title-main">Higman–Sims group</span>

In the area of modern algebra known as group theory, the Higman–Sims group HS is a sporadic simple group of order

In mathematics, more specifically in group theory, a group is said to be perfect if it equals its own commutator subgroup, or equivalently, if the group has no non-trivial abelian quotients. In symbols, a perfect group is one such that G(1) = G, or equivalently one such that Gab = {1}.

In mathematics, the Thompson groups are three groups, commonly denoted , that were introduced by Richard Thompson in some unpublished handwritten notes in 1965 as a possible counterexample to the von Neumann conjecture. Of the three, F is the most widely studied, and is sometimes referred to as the Thompson group or Thompson's group.

In geometric topology, a field within mathematics, the obstruction to a homotopy equivalence of finite CW-complexes being a simple homotopy equivalence is its Whitehead torsion which is an element in the Whitehead group. These concepts are named after the mathematician J. H. C. Whitehead.

<span class="mw-page-title-main">Graham Higman</span> English mathematician

Graham Higman FRS was a prominent English mathematician known for his contributions to group theory.

<span class="mw-page-title-main">Hyperbolic group</span> Mathematical concept

In group theory, more precisely in geometric group theory, a hyperbolic group, also known as a word hyperbolic group or Gromov hyperbolic group, is a finitely generated group equipped with a word metric satisfying certain properties abstracted from classical hyperbolic geometry. The notion of a hyperbolic group was introduced and developed by Mikhail Gromov (1987). The inspiration came from various existing mathematical theories: hyperbolic geometry but also low-dimensional topology, and combinatorial group theory. In a very influential chapter from 1987, Gromov proposed a wide-ranging research program. Ideas and foundational material in the theory of hyperbolic groups also stem from the work of George Mostow, William Thurston, James W. Cannon, Eliyahu Rips, and many others.

<span class="mw-page-title-main">Lattice of subgroups</span>

In mathematics, the lattice of subgroups of a group is the lattice whose elements are the subgroups of , with the partial order relation being set inclusion. In this lattice, the join of two subgroups is the subgroup generated by their union, and the meet of two subgroups is their intersection.

In mathematics, a matrix group is a group G consisting of invertible matrices over a specified field K, with the operation of matrix multiplication. A linear group is a group that is isomorphic to a matrix group.

In mathematics, a polycyclic group is a solvable group that satisfies the maximal condition on subgroups. Polycyclic groups are finitely presented, which makes them interesting from a computational point of view.

In mathematics, in the realm of group theory, a countable group is said to be SQ-universal if every countable group can be embedded in one of its quotient groups. SQ-universality can be thought of as a measure of largeness or complexity of a group.

In the mathematical area of group theory, the Grigorchuk group or the first Grigorchuk group is a finitely generated group constructed by Rostislav Grigorchuk that provided the first example of a finitely generated group of intermediate growth. The group was originally constructed by Grigorchuk in a 1980 paper and he then proved in a 1984 paper that this group has intermediate growth, thus providing an answer to an important open problem posed by John Milnor in 1968. The Grigorchuk group remains a key object of study in geometric group theory, particularly in the study of the so-called branch groups and automata groups, and it has important connections with the theory of iterated monodromy groups.

In the mathematical subject of group theory, the rank of a groupG, denoted rank(G), can refer to the smallest cardinality of a generating set for G, that is

In abstract algebra, the focal subgroup theorem describes the fusion of elements in a Sylow subgroup of a finite group. The focal subgroup theorem was introduced in and is the "first major application of the transfer" according to. The focal subgroup theorem relates the ideas of transfer and fusion such as described in. Various applications of these ideas include local criteria for p-nilpotence and various non-simplicity criteria focussing on showing that a finite group has a normal subgroup of index p.

References