scholarly journals Extremal matrices for the Bruhat-graph order

Author(s):  
Rosário Fernandes ◽  
Susana Furtado
Keyword(s):  
2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Francesco Brenti ◽  
Fabrizio Caselli

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.


2017 ◽  
Vol 304 ◽  
pp. 539-582 ◽  
Author(s):  
Francesco Brenti ◽  
Fabrizio Caselli

10.37236/7910 ◽  
2018 ◽  
Vol 25 (4) ◽  
Author(s):  
Saúl A. Blanco

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}$.


2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Saúl A. Blanco

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$.


10.37236/661 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Saúl A. Blanco

We present a description, including a characterization, of the complete cd-index of dihedral intervals. Furthermore, we describe a method to compute the complete cd-index of intervals in universal Coxeter groups. To obtain such descriptions, we consider Bruhat intervals for which Björner and Wachs's CL-labeling can be extended to paths of different lengths in the Bruhat graph. While such an extension cannot be defined for all Bruhat intervals, it can be in dihedral and universal Coxeter systems.


10.37236/1683 ◽  
2003 ◽  
Vol 9 (2) ◽  
Author(s):  
Catalin Zara

We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation, and we show how this relates to parameterizing certain spaces of paths in the Johnson graph.


2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Axel Hultman

International audience Let $G$ be a connected reductive linear algebraic group over $ℂ$ with an involution $θ$ . Denote by $K$ the subgroup of fixed points. In certain cases, the $K-orbits$ in the flag variety $G/B$ are indexed by the twisted identities $ι (θ ) = {θ (w^{-1})w | w∈W}$ in the Weyl group $W$. Under this assumption, we establish a criterion for rational smoothness of orbit closures which generalises classical results of Carrell and Peterson for Schubert varieties. That is, whether an orbit closure is rationally smooth at a given point can be determined by examining the degrees in a "Bruhat graph'' whose vertices form a subset of $ι (θ )$. Moreover, an orbit closure is rationally smooth everywhere if and only if its corresponding interval in the Bruhat order on $ι (θ )$ is rank symmetric. In the special case $K=\mathrm{Sp}_{2n}(ℂ), G=\mathrm{SL}_{2n}(ℂ)$, we strengthen our criterion by showing that only the degree of a single vertex, the "bottom one'', needs to be examined. This generalises a result of Deodhar for type A Schubert varieties. Soit $G$ un groupe algébrique connexe réductif sur $ℂ$, équipé d'une involution $θ$ . Soit $K$ le sousgroupe de ses points fixes. Dans certains cas, les orbites des points de la variété de drapeaux $G/B$ sous l'action de $K$ sont indexées par les identités tordues, $ι (θ ) = {θ (w^{-1})w | w∈W}$, du groupe de Weyl $W$. Sous cette hypothèse, on établit un critère pour la lissité rationnelle des adhérences des orbites, qui généralise des résultats classiques de Carrell et Peterson pour les variétés de Schubert. Plus précisément, on peut déterminer si l'adhérence d'une orbite est rationnellement lisse en examinant les degrés dans un "Graphe de Bruhat" dont les sommets forment un sous-ensemble de $ι (θ )$. En outre, l'adhérence d'une orbite est partout rationnellement lisse si et seulement si l'intervalle correspondant dans l'ordre de Bruhat de $ι (θ )$ est symétrique respectivement au rang. Dans le cas particulier $K=\mathrm{Sp}_{2n}(ℂ), G=\mathrm{SL}_{2n}(ℂ)$, nous améliorons notre critère en montrant qu'il suffit d'examiner le degré d'un seul sommet, celui "du bas". Ceci généralise un résultat de Deodhar pour les variétés de Schubert de type A.


2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Sam Armon ◽  
Tom Halverson

We derive a formula for the entries in the change-of-basis matrix between Young's seminormal and natural representations of the symmetric group. These entries are determined as sums over weighted paths in the weak Bruhat graph on standard tableaux, and we show that they can be computed recursively as the weighted sum of at most two previously-computed entries in the matrix. We generalize our results to work for affine Hecke algebras, Ariki-Koike algebras, Iwahori-Hecke algebras, and complex reflection groups given by the wreath product of a  finite cyclic group with the symmetric group. 


Sign in / Sign up

Export Citation Format

Share Document