Groups with a complemented presentation (Q678835): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Braids, Links, and Mapping Class Groups. (AM-82) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3848243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4015542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braid Groups and Left Distributive Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure group for the associativity identity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMS FOR POSITIVE BRAIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE BRAID GROUP AND OTHER GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braid group actions on left distributive structures, and well orderings in the braid groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Isoperimetric Inequality for Artin Groups of Finite Type / rank
 
Normal rank

Latest revision as of 11:20, 27 May 2024

scientific article
Language Label Description Also known as
English
Groups with a complemented presentation
scientific article

    Statements

    Groups with a complemented presentation (English)
    0 references
    0 references
    8 September 1997
    0 references
    A presentation of a group is said to be right complemented if for any two generators \(x\) and \(y\), there exists one relation of the form \(xu=yv\), where \(u\) and \(v\) are finite products of generators, and furthermore any relation in the presentation is such a relation. Artin's braid groups are an important example. The author investigates such groups and presents a simple quadratic algorithm for solving their word problem.
    0 references
    right complemented presentations
    0 references
    generators
    0 references
    relations
    0 references
    Artin's braid groups
    0 references
    quadratic algorithms
    0 references
    word problems
    0 references

    Identifiers