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 5 of 5 for “"Bruhat graph"”.

  1. Affine quantum Bruhat graphs and double affine Demazure products

    … single affine Demazure product using the quantum Bruhat graph. We focus on type cSL2, where we prove that the corresponding affine quantum Bruhat graph has a well-defined weight function, and satisfies nice properties involving length posivite sets, allowing us to construct a well-defined Demazure …

    glasgow Repository record for Affine quantum Bruhat graphs and double affine Demazure products (opens in a new tab) Download PDF for Affine quantum Bruhat graphs and double affine Demazure products (opens in a new tab)

  2. A Combinatorially Explicit Relative Möbius Function on Affine Grassmannians and a Proposal for an Affine Infinite Symmetric Group

    … the subposet of affine Grassmannians under the Bruhat order is non-zero by utilizing the quantum Bruhat graph of the classical Weyl group associated to W . Then we examine embedding stable and consistent statistics on the affine Weyl group of type A which permit the definition of an affine …

    vt Repository record for A Combinatorially Explicit Relative Möbius Function on Affine Grassmannians and a Proposal for an Affine Infinite Symmetric Group (opens in a new tab)

  3. Simple Stationary Steps in Quantum Walks

    … a sum over a set of quantum walks in the quantum Bruhat graph, QBG(An−1). We establish bounds on the number of quantum steps and simple stationary steps in these quantum walks. By a result of Kato, we map this formula to the equivariant quantum K-theory of partial flag manifolds G/P to give an …

    vt Repository record for Simple Stationary Steps in Quantum Walks (opens in a new tab)

  4. Double Affine Bruhat Order

    … of a given element of W with respect to the Bruhat order, specifically when W is associated to a finite root system that is irreducible and simply laced. We show two approaches: one extending the work of Lam and Shimozono, and its strengthening by Milicevic, where cocovers are characterized …

    vt Repository record for Double Affine Bruhat Order (opens in a new tab)

  5. Shortest Path Poset Of Bruhat Intervals And The Complete Cd-Index

    Let (W, S ) be a Coxeter system, [u, v ] be a Bruhat interval and B (u, v ) be its corresponding Bruhat graph. The combinatorial and topological structures of the longest u-v paths of B (u, v ) have been studied extensively and is well-known. Nevertheless, not much is known of the remaining paths. …

    cornell Repository record for Shortest Path Poset Of Bruhat Intervals And The Complete Cd-Index (opens in a new tab)