English
Related papers

Related papers: A Monoid for the Universal K-Bruhat Order

200 papers

The variety of complete quadrics is the wonderful compactification of $GL_n/O_n$ and admits a cell decomposition into Borel orbits indexed by combinatorial objects called $\mu$-involutions. We study Coxeter-theoretic properties of…

Combinatorics · Mathematics 2026-04-07 Jack Chen-An Chou , Zachary Hamaker

It has been proposed that cobordism and K-theory groups, which can be mathematically related in certain cases, are physically associated to generalised higher-form symmetries. As a consequence, they should be broken or gauged in any…

High Energy Physics - Theory · Physics 2023-04-12 Ralph Blumenhagen , Niccolò Cribiori , Christian Kneissl , Andriana Makridou

The reduced universal monoid on the action category associated to a pointed simplicial M-set has appeared in the guise of various simplicial monoid and group constructions. These include the classical constructions of Milnor and James, as…

Algebraic Topology · Mathematics 2013-03-18 Man Gao , Jie Wu

There is a natural analogue of weak Bruhat order on the involutions in any Coxeter group. The saturated chains of intervals in this order correspond to reduced words for a certain set of group elements called atoms. Brion gives a general…

Combinatorics · Mathematics 2025-06-12 Zachary Hamaker , Eric Marberg

We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…

Combinatorics · Mathematics 2014-02-07 Avinash J. Dalal , Jennifer Morse

We revisit $R$-polynomials with introducing the new idea ``shifted $R$-polynomials" (or Bruhat weight) for all Bruhat intervals in finite Coxeter groups. Then, we apply these polynomials to weighted counting of Bruhat paths. Further, we…

Combinatorics · Mathematics 2019-07-30 Masato Kobayashi

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 $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with…

Combinatorics · Mathematics 2021-06-01 Daniel Hothem

We give positive descriptions for certain Schubert structure constants $c_{u,v}^w$ for the full flag variety in Lie types $C$ and $D$. This is accomplished by first observing that a number of the $K=GL(n,\C)$-orbit closures on these flag…

Combinatorics · Mathematics 2012-07-02 Benjamin J. Wyser

We show the equivalence of the Pieri formula for flag manifolds and certain identities among the structure constants, giving new proofs of both the Pieri formula and of these identities. A key step is the association of a symmetric function…

alg-geom · Mathematics 2016-11-08 Nantel Bergeron , Frank Sottile

We study the restriction of the strong Bruhat order on an arbitrary Coxeter group $W$ to cosets $x W_L^\theta$, where $x$ is an element of $W$ and $W_L^\theta$ the subgroup of fixed points of an automorphism $\theta$ of order at most two of…

Representation Theory · Mathematics 2023-11-14 Nathan Chapelier-Laget , Thomas Gobet

We prove that linear extensions of the Bruhat order of a matroid are shelling orders and that the barycentric subdivision of a matroid is a Coxeter matroid, viewing barycentric subdivisions as subsets of a parabolic quotient of a symmetric…

Combinatorics · Mathematics 2023-06-13 Davide Bolognini , Paolo Sentinelli

We consider a natural generalization of braids which we call shrinking braids. We state the relations of shrinking braids and use them to define algebraically the monoid $R$. We endow a subset of $R$ with a \emph{left distributive monoid}…

Group Theory · Mathematics 2020-12-03 Linjun Li

We use the rational tableaux introduced by Stembridge to give a bideterminant basis for a normal reductive monoid and for its variety of noninvertible elements. We also obtain a bideterminant basis for the full coordinate ring of the…

Representation Theory · Mathematics 2010-09-14 Rudolf Tange

The goal of the paper is twofold: on one side it provides an order structure on the set of all maximal chains in the Bruhat poset of Schubert varieties in a Grassmann variety; on the other hand, using this order structure, it works out…

Algebraic Geometry · Mathematics 2024-03-14 Rocco Chirivì , Xin Fang , Peter Littelmann

Let $(W,S)$ be a finite Coxeter system with root system $R$ and with set of positive roots $R^+$. For $\alpha\in R$, $v,w\in W$, we denote by $\partial_\alpha$, $\partial_w$ and $\partial_{w/v}$ the divided difference operators and skew…

Quantum Algebra · Mathematics 2018-04-18 Christoph Bärligea

We develop combinatorics of parabolic double cosets in finite Coxeter groups as a follow-up of recent articles by Billey-Konvalinka-Petersen-Slofstra-Tenner and Petersen. (1) We construct a double coset system as a generalization of a…

Combinatorics · Mathematics 2019-07-30 Masato Kobayashi

Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…

Combinatorics · Mathematics 2007-05-23 Cristian Lenart

We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…

Group Theory · Mathematics 2012-05-09 Patrick Dehornoy

The Schur orthogonality relations are a cornerstone in the representation theory of groups. We utilize a generalization to weak Hopf algebras to provide a new, readily verifiable condition on the skeletal data for deciding whether a given…

Quantum Algebra · Mathematics 2024-02-06 Jacob C. Bridgeman , Laurens Lootens , Frank Verstraete

In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly…

Combinatorics · Mathematics 2010-05-20 Masato Kobayashi