Live briefing
Everything about Word problem for groups
Problem in finite group theory
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group is the algorithmic problem of deciding whether two words in the generators represent the same element of. The word problems for certain groups provide well-known examples of undecidable problems. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Word problem for groupsA 5-minute orientation
- Skim a recent paper: The word problem for finitary automaton groupsInfluential work since 2022
- Pick up a classic book: The TempestThe most-reprinted book on the subject
- Read the landmark paper: The word problem for free partially commutative groupsCited 30 times
- Go sideways: Adian–Rabin theoremA closely related topic
- Go sideways: Absolute presentation of a groupA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
The word problem for free partially commutative groups
The Word Problem for Groups
The word problem and the isomorphism problem for groups
The word problem for Artin groups of FC type
Solution of the Word Problem for Certain Types of Groups I
The complexity of the word problem for abelian l-groups
A simple solution to the word problem for virtual braid groups
REFINING KNOWN RESULTS ON THE GENERALIZED WORD PROBLEM FOR FREE GROUPS
🆕 Influential since 2022
đź“š Books worth reading
The TempestWilliam Shakespeare · 1611
Brave New WorldAldous Huxley · 1932
The Autobiography of Benjamin FranklinBenjamin Franklin · 1791
SonnetsWilliam Shakespeare · 1609
Commentarii de bello gallico et de bello civiliGaius Julius Caesar · 1471
The Art of Public SpeakingStephen E. Lucas · 1983
La Guia Facil del Sexo for DummiesRuth K. Westheimer, Pierre A. Lehu · 1995
Your OfficeAmy S. Kinser, Eric Kinser · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Adian–Rabin theorem In the mathematical subject of group theory, the Adyan–Rabin theorem is a result that states that most "reasonable" properties of finitely presentable…
- Absolute presentation of a group In mathematics, an absolute presentation is one method of defining a group. Recall that to define a group G {\displaystyle G} by means of a presentation…
- Dehn function In the mathematical subject of geometric group theory, a Dehn function, named after Max Dehn, is an optimal function associated to a finite group presentation…
- XTR In cryptography, XTR is an algorithm for public-key encryption. XTR stands for 'ECSTR', which is an abbreviation for Efficient and Compact Subgroup Trace…
- Rank of a group In the mathematical subject of group theory, the rank of a group G, denoted rank(G), can refer to the smallest cardinality of a generating set for G, that…
- Artin–Tits group In the mathematical area of group theory, Artin groups, also known as Artin–Tits groups or generalized braid groups, are a family of infinite discrete…
- Signalizer functor In mathematics, in the area of abstract algebra, a signalizer functor is a mapping from a potential finite subgroup to the centralizers of the nontrivial…
- Descendant tree (group theory) In mathematics, specifically group theory, a descendant tree is a hierarchical structure that visualizes parent-descendant relations between isomorphism…