An inversion statistic for reduced words

DOI10.1016/J.AAM.2019.02.005zbMATH Open1414.05005arXiv1808.01281OpenAlexW3102410742WikidataQ128322289 ScholiaQ128322289MaRDI QIDQ2423398FDOQ2423398

Sami Assaf

Publication date: 21 June 2019

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes ranked with unique maximal element. We show this metric extends naturally to balanced tableaux, and use it to recover enumerative results of Edelman and Greene and of Reiner and Roichman.

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

Recommendations

• Some combinatorial aspects of reduced words in finite Coxeter groups
• Reduced words and plane partitions
• Reduced words in affine Coxeter groups
• Stanley symmetric functions for signed involutions
• Reduced word enumeration, complexity, and randomization

zbMATH Keywords

inversionreduced wordsbalanced tableauxYang-Baxter moves

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Combinatorial identities, bijective combinatorics (05A19) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Group actions on combinatorial structures (05E18)

Cites Work

• A NEW MEASURE OF RANK CORRELATION
• Title not available (Why is that?)
• On the number of reduced decompositions of elements of Coxeter groups
• Diameter of graphs of reduced words and galleries.
• DUAL EQUIVALENCE GRAPHS I: A NEW PARADIGM FOR SCHUR POSITIVITY
• Balanced tableaux
• Balanced labellings and Schubert polynomials
• On the distance between the expressions of a permutation
• Weak dual equivalence for polynomials

Cited In (7)

• Diameter of a commutation class on reduced words
• Demazure crystals for specialized nonsymmetric Macdonald polynomials
• Diameter of the commutation classes graph of a permutation
• Inverses of words and the parabolic structure of the symmetric group
• A bijective proof of Kohnert's rule for Schubert polynomials
• Maximizing the Edelman-Greene statistic
• Commutation classes of the reduced words for the longest element of \(\mathfrak{S}_{n}\)

This page was built for publication: An inversion statistic for reduced words

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