Poset edge densities, nearly reduced words, and barely set-valued tableaux

From MaRDI portal
Publication:721043

DOI10.1016/J.JCTA.2018.03.010zbMATH Open1391.05269arXiv1603.09589OpenAlexW2963126168WikidataQ130106873 ScholiaQ130106873MaRDI QIDQ721043FDOQ721043


Authors: Victor Reiner, Bridget Eileen Tenner, Alexander Yong Edit this on Wikidata


Publication date: 18 July 2018

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it. We show that this coincidence of expectations holds for Cartesian products of chains, connected minuscule posets, weak Bruhat orders on finite Coxeter groups, certain lower intervals in Young's lattice, and certain lower intervals in the weak Bruhat order below dominant permutations. Our tools involve formulas for counting nearly reduced factorizations in 0-Hecke algebras; that is, factorizations that are one letter longer than the Coxeter group length.


Full work available at URL: https://arxiv.org/abs/1603.09589




Recommendations




Cites Work


Cited In (27)





This page was built for publication: Poset edge densities, nearly reduced words, and barely set-valued tableaux

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721043)