scholarly journals Maximal Newton Points and the Quantum Bruhat Graph

2020 ◽  
Author(s):  
Elizabeth Milićević
Keyword(s):  
Bruhat Graph ◽  
Quantum Bruhat Graph

scholarly journals Maximal Newton polygons via the quantum Bruhat graph

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Elizabeth T. Beazley
Keyword(s):  
Weyl Group ◽  
Quantum Cohomology ◽  
Bruhat Order ◽  
Flag Variety ◽  
Necessary Condition ◽  
Newton Polygons ◽  
Weighted Directed Graph ◽  
Affine Weyl Group ◽  
Bruhat Graph ◽  
Quantum Bruhat Graph

International audience This paper discusses a surprising relationship between the quantum cohomology of the variety of complete flags and the partially ordered set of Newton polygons associated to an element in the affine Weyl group. One primary key to establishing this connection is the fact that paths in the quantum Bruhat graph, which is a weighted directed graph with vertices indexed by elements in the finite Weyl group, encode saturated chains in the strong Bruhat order on the affine Weyl group. This correspondence is also fundamental in the work of Lam and Shimozono establishing Peterson's isomorphism between the quantum cohomology of the finite flag variety and the homology of the affine Grassmannian. In addition, using some geometry associated to the poset of Newton polygons, one obtains independent proofs for several combinatorial statements about paths in the quantum Bruhat graph and its symmetries, which were originally proved by Postnikov using the tilted Bruhat order. An important geometric application of this work is an inequality which provides a necessary condition for non-emptiness of certain affine Deligne-Lusztig varieties in the affine flag variety. Cet article étudie une relation surprenante entre la cohomologie quantique de la variété de drapeaux complets et l'ensemble partiellement ordonné de polygones de Newton associé à un élément du groupe de Weyl affine. L’élément clé pour établir cette connexion est le fait que les chemins dans le graphe de Bruhat quantique, qui est un graphe orienté pondéré dont les sommets sont indexés par des éléments du groupe de Weyl fini, encodent des chaînes saturées dans l'ordre de Bruhat fort sur le groupe de Weyl affine. Cette correspondance est aussi fondamentale dans les travaux de Lam et Shimonozo qui établissent l'isomorphisme de Peterson entre la cohomologie quantique de la variété de drapeaux finie et l'homologie de la Grassmannienne affine. De plus, en utilisant la géométrie associée à l'ensemble partiellement ordonné des polygones de Newton, on obtient des preuves indépendantes pour plusieurs assertions combinatoires sur les chemins dans le graphe de Bruhat quantiques et les symétries de ce graphe, qui ont été originellement démontrées par Postnikov en utilisant l'ordre de Bruhat incliné. Une application géométrique importante de ce travail est une inégalité qui donne une condition nécessaire pour que certaines variétés de Deligne-Lusztig affines dans la variété de drapeaux affine soient non-vides.

scholarly journals Generic Newton points and the Newton poset in Iwahori-double cosets

2020 ◽  
Vol 8 ◽  
Author(s):  
Elizabeth Milićević ◽  
Eva Viehmann
Keyword(s):  
Reductive Group ◽  
Loop Group ◽  
Index Set ◽  
Double Cosets ◽  
Large Classes ◽  
Bruhat Graph ◽  
Newton Stratification ◽  
Quantum Bruhat Graph

Abstract We consider the Newton stratification on Iwahori-double cosets in the loop group of a reductive group. We describe a group-theoretic condition on the generic Newton point, called cordiality, under which the Newton poset (that is, the index set for non-empty Newton strata) is saturated and Grothendieck’s conjecture on closures of the Newton strata holds. Finally, we give several large classes of Iwahori-double cosets for which this condition is satisfied by studying certain paths in the associated quantum Bruhat graph.

scholarly journals Inverse K-Chevalley formulas for semi-infinite flag manifolds, I: minuscule weights in ADE type

2021 ◽  
Vol 9 ◽  
Author(s):  
Takafumi Kouno ◽  
Satoshi Naito ◽  
Daniel Orr ◽  
Daisuke Sagaki
Keyword(s):  
Flag Manifolds ◽  
Line Bundles ◽  
Affine Hecke Algebra ◽  
Double Affine Hecke Algebra ◽  
Bruhat Graph ◽  
Schubert Classes ◽  
Explicit Determination ◽  
Schubert Class ◽  
Quantum Bruhat Graph

Abstract We prove an explicit inverse Chevalley formula in the equivariant K-theory of semi-infinite flag manifolds of simply laced type. By an ‘inverse Chevalley formula’ we mean a formula for the product of an equivariant scalar with a Schubert class, expressed as a $\mathbb {Z}\left [q^{\pm 1}\right ]$ -linear combination of Schubert classes twisted by equivariant line bundles. Our formula applies to arbitrary Schubert classes in semi-infinite flag manifolds of simply laced type and equivariant scalars $e^{\lambda }$ , where $\lambda $ is an arbitrary minuscule weight. By a result of Stembridge, our formula completely determines the inverse Chevalley formula for arbitrary weights in simply laced type except for type $E_8$ . The combinatorics of our formula is governed by the quantum Bruhat graph, and the proof is based on a limit from the double affine Hecke algebra. Thus our formula also provides an explicit determination of all nonsymmetric q-Toda operators for minuscule weights in ADE type.

scholarly journals Peak algebras, paths in the Bruhat graph and Kazhdan-Lusztig polynomials

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Francesco Brenti ◽  
Fabrizio Caselli
Keyword(s):  
Combinatorial Formula ◽  
Quasisymmetric Functions ◽  
International Audience ◽  
Bruhat Graph ◽  
Lusztig Polynomials

International audience We obtain a nonrecursive combinatorial formula for the Kazhdan-Lusztig polynomials which holds in complete generality and which is simpler and more explicit than any existing one, and which cannot be linearly simplified. Our proof uses a new basis of the peak subalgebra of the algebra of quasisymmetric functions. On montre une formule combinatoire pour les polynômes de Kazhdan-Lusztig qui est valable en toute généralité. Cette formule est plus simple et plus explicite que toutes les autres formules connues; de plus, elle ne peut pas être simplifiée linéairement. La preuve utilise une nouvelle base pour la sous-algèbre des sommets de l’algèbre des fonctions quasi-symmetriques.

scholarly journals Peak algebras, paths in the Bruhat graph and Kazhdan–Lusztig polynomials

2017 ◽  
Vol 304 ◽  
pp. 539-582 ◽  
Author(s):  
Francesco Brenti ◽  
Fabrizio Caselli
Keyword(s):  
Bruhat Graph ◽  
Lusztig Polynomials

scholarly journals Flip Posets of Bruhat Intervals

10.37236/7910 ◽  
2018 ◽  
Vol 25 (4) ◽  
Author(s):  
Saúl A. Blanco
Keyword(s):  
Maximal Chain ◽  
Combinatorial Description ◽  
Bruhat Graph ◽  
Eulerian Posets ◽  
Bruhat Intervals

In this paper we introduce a way of partitioning the paths of shortest lengths in the Bruhat graph $B(u,v)$ of a Bruhat interval $[u,v]$ into rank posets $P_{i}$ in a way that each $P_{i}$ has a unique maximal chain that is rising under a reflection order. In the case where each $P_{i}$ has rank three, the construction yields a combinatorial description of some terms of the complete $\textbf{cd}$-index as a sum of ordinary $\textbf{cd}$-indices of Eulerian posets obtained from each of the $P_{i}$.

scholarly journals Shortest path poset of finite Coxeter groups

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Saúl A. Blanco
Keyword(s):  
Shortest Path ◽  
Coxeter Group ◽  
Coxeter Groups ◽  
Shortest Paths ◽  
Combinatorial Interpretation ◽  
Nous Permet ◽  
Finite Coxeter Group ◽  
International Audience ◽  
Absolute Length ◽  
Bruhat Graph

International audience We define a poset using the shortest paths in the Bruhat graph of a finite Coxeter group $W$ from the identity to the longest word in $W, w_0$. We show that this poset is the union of Boolean posets of rank absolute length of $w_0$; that is, any shortest path labeled by reflections $t_1,\ldots,t_m$ is fully commutative. This allows us to give a combinatorial interpretation to the lowest-degree terms in the complete $\textbf{cd}$-index of $W$. Nous définissons un poset en utilisant le plus court chemin entre l'identité et le plus long mot de $W, w_0$, dans le graph de Bruhat du groupe finie Coxeter, $W$. Nous prouvons que ce poset est l'union de posets Boolean du même rang que la longueur absolute de $w_0$; ça signifie que tous les plus courts chemins, étiquetés par réflexions $t_1,\ldots, t_m$ sont totalement commutatives. Ça nous permet de donner une interprétation combinatoire aux termes avec le moindre grade dans le $\textbf{cd}$-index complet de $W$.

Sign in / Sign up

Export Citation Format

Share Document