Free \(n\)-category generated by a cube, oriented matroids, and higher Bruhat orders (Q1814352)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Free \(n\)-category generated by a cube, oriented matroids, and higher Bruhat orders
scientific article

    Statements

    Free \(n\)-category generated by a cube, oriented matroids, and higher Bruhat orders (English)
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    In investigating multidimensional generalizations of the Yang-Baxter equation, Manin and Shekhtman introduced partially ordered sets \(B(n,k)\) called higher Bruhat orders. The set \(B(n,1)\) is the symmetric group \(S_ n\) with its weak Bruhat order, and \(B(n,k+1)\) is obtained by a factorization from the set of maximal chains in \(B(n,k)\). The connection was pointed out for \(B(n,k)\) with arrangements of \(n\) hyperplanes in \(\mathbb{R}^ k\) in the general situation and also with the structure of the convex hull of a general orbit of \(S_ n\) in \(\mathbb{R}^ n\). In the present note we give an interpretation of \(B(n,k)\) as the sets of some \(k\)-dimensional strips in an \(n\)-dimensional cube. Our approach is based on a consideration of the \(n\)-category \(Q_ n\) ``freely generated'' by the faces of an \(n\)-dimensional cube. It provides a natural ``unlooping'' of the \((n-1)\)-category \(S_ n\) and generating higher Bruhat orders.
    0 references
    \(n\)-category
    0 references
    \(n\)-dimensional cubes
    0 references
    Yang-Baxter equation
    0 references
    partially ordered sets
    0 references
    higher Bruhat orders
    0 references
    symmetric group
    0 references
    weak Bruhat order
    0 references
    maximal chains
    0 references
    convex hull
    0 references
    orbit
    0 references

    Identifiers

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