A simple algorithm for finding short sigma-definite representatives. (Q420741): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20F36 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20F10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20M05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 06F05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 20-04 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6037608 / rank
 
Normal rank
Property / zbMATH Keywords
 
braid groups
Property / zbMATH Keywords: braid groups / rank
 
Normal rank
Property / zbMATH Keywords
 
braid monoids
Property / zbMATH Keywords: braid monoids / rank
 
Normal rank
Property / zbMATH Keywords
 
braid orderings
Property / zbMATH Keywords: braid orderings / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithms
Property / zbMATH Keywords: algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
normal form theorems
Property / zbMATH Keywords: normal form theorems / rank
 
Normal rank

Revision as of 21:37, 29 June 2023

scientific article
Language Label Description Also known as
English
A simple algorithm for finding short sigma-definite representatives.
scientific article

    Statements

    A simple algorithm for finding short sigma-definite representatives. (English)
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    braid groups
    0 references
    braid monoids
    0 references
    braid orderings
    0 references
    algorithms
    0 references
    normal form theorems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references