Combinatorial Group Theory

Lyndon, R. C., & Schupp, P. E. (1977). Combinatorial Group Theory. Springer-Verlag.

Type

Book

Intellectual base

Review or monograph

Year

1977

DOI

10.1007/978-3-642-61896-3

ISBN

9783540411581

DOI registrant

Springer Nature

Link

https://doi.org/10.1007/978-3-642-61896-3

Cited by

3 citations across 3 artifacts.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Conjugacy problem
  • The entry is mathematical and descriptive; security-relevant group applications, if mentioned, remain nonprocedural and do not include attack workflows or implementation exploitation.
• Word problem for groups
  • … In a free group, repeatedly cancel adjacent generator-inverse pairs; the reduced word is empty exactly when it represents the identity. to A computational algebra system uses a confluent rewriting system to solve equality for a supported group but does not generalize that guarantee to arbitrary finite presentations..

Mechanisms

• Rewrite and Cancellation Trace
  • This is the word problem for groups

    This sourceDefines the group word problem as deciding whether a word in generators represents the identity.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 3 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:7272ca71bc0e · see in the full table