Free n-category generated by a cube, oriented matroids, and higher Bruhat orders

\(n\)-category \(n\)-dimensional cubes convex hull higher Bruhat orders maximal chains orbit partially ordered sets symmetric group weak Bruhat order Yang-Baxter equation

Mathematics Subject Classification ID

Algebraic aspects of posets (06A11) Ordered groups (06F15) Symmetric groups (20B30) Representations of finite symmetric groups (20C30) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Review text

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.

Recommendations

Cites work

Cited in

(29)

This page was built for publication: Free \(n\)-category generated by a cube, oriented matroids, and higher Bruhat orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814352)