Concept

Thompson groups

In mathematics, the Thompson groups (also called Thompson's groups, vagabond groups or chameleon 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. The Thompson groups, and F in particular, have a collection of unusual properties that have made them counterexamples to many general conjectures in group theory. All three Thompson groups are infinite but finitely presented. The groups T and V are (rare) examples of infinite but finitely-presented simple groups. The group F is not simple but its derived subgroup [F,F] is and the quotient of F by its derived subgroup is the free abelian group of rank 2. F is totally ordered, has exponential growth, and does not contain a subgroup isomorphic to the free group of rank 2. It is conjectured that F is not amenable and hence a further counterexample to the long-standing but recently disproved von Neumann conjecture for finitely-presented groups: it is known that F is not elementary amenable. introduced an infinite family of finitely presented simple groups, including Thompson's group V as a special case. A finite presentation of F is given by the following expression: where [x,y] is the usual group theory commutator, xyx−1y−1. Although F has a finite presentation with 2 generators and 2 relations, it is most easily and intuitively described by the infinite presentation: The two presentations are related by x0=A, xn = A1−nBAn−1 for n>0. The group F also has realizations in terms of operations on ordered rooted binary trees, and as a subgroup of the piecewise linear homeomorphisms of the unit interval that preserve orientation and whose non-differentiable points are dyadic rationals and whose slopes are all powers of 2.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.