Mapping class groups are automatic (Q5970591)

From MaRDI portal
scientific article; zbMATH DE number 819352
Language Label Description Also known as
English
Mapping class groups are automatic
scientific article; zbMATH DE number 819352

    Statements

    Mapping class groups are automatic (English)
    0 references
    0 references
    7 January 1996
    0 references
    Let \(S\) be a compact surface with a finite set (possibly empty) of punctures \(P\) removed. The main result of the paper says that the mapping class group of \(S\), \({\mathcal M} {\mathcal C} {\mathcal G}(S)\), is automatic. An automatic structure on a group \(G\) is a finite set \(A\) of generators together with a set \(L\) of words in the letters of \(A\), called normal forms, such that each element of \(G\) is represented by at least one normal form, and such that finite deterministic automata may be used to decide whether a given word in the letters of \(A\) is a normal form, whether two normal forms represent equal elements in \(G\), and whether two normal forms represent elements in \(G\) differing by a given generator. A general automatic group has a quadratic time algorithm for the word problem and satisfies certain nice geometric properties; for example the isoperimetric function is quadratically bounded.
    0 references
    compact surface
    0 references
    mapping class group
    0 references
    automatic
    0 references
    automatic structure
    0 references
    word problem
    0 references
    isoperimetric function
    0 references

    Identifiers