Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"higher Bruhat orders"”.

  1. Extending Higher Bruhat Orders to Non-longest Words in S_n

    In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words w in the symmetric group. We prove that the higher Bruhat orders of non-longest words are ranked posets with unique minimal and maximal elements. As in Manin …

    oregon Repository record for Extending Higher Bruhat Orders to Non-longest Words in S_n (opens in a new tab)

  2. On Enumerating and Generalizing Higher Bruhat Orders with Connections to Machine Learning

    The higher Bruhat orders B(n, k) were introduced by Manin–Schechtman to study discriminantal hyperplane arrangements and subsequently studied by Ziegler, who connected B(n, k) to oriented matroids. In this thesis, we study three topics: the enumeration of B(n, k), a generalization of B(n, k) to …

    washington Repository record for On Enumerating and Generalizing Higher Bruhat Orders with Connections to Machine Learning (opens in a new tab)

  3. Higher-dimensional combinatorics in representation theory

    The main result of this thesis is that the two higher Stasheff-Tamari orders are equal, as was originally conjectured by Edelman and Reiner in 1996. These are two orders on the set of triangulations of a cyclic polytope - the first introduced by Kapranov and Voevodsky, and the second introduced by …

    lancaster