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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
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
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963284565 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1101.1400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the word and conjugacy problems in the braid groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NORMAL FORM FOR BRAIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wellordering on positive braids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braid Groups and Left Distributive Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast method for comparing braids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating normal forms for braids and locally Garside monoids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of braids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering the braid groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-ordering of dual braid monoids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE WELL-ORDERING OF DUAL BRAID MONOID / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE BRAID GROUP AND OTHER GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Left-distributive idempotent algebras / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:53, 5 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    braid groups
    0 references
    braid monoids
    0 references
    braid orderings
    0 references
    algorithms
    0 references
    normal form theorems
    0 references
    0 references
    0 references