Maximizing the Edelman-Greene statistic

Gidon Orelowitz

备注：: 9 Pages

英文摘要：

The $\textit{Edelman-Greene statistic}$ of S. Billey-B. Pawlowski measures the "shortness" of the Schur expansion of a Stanley symmetric function. We show that the maximum value of this statistic on permutations of Coxeter length $n$ is the number of involutions in the symmetric group $S_n$, and explicitly describe the permutations that attain this maximum. Our proof confirms a recent conjecture of C. Monical, B. Pankow, and A. Yong: we give an explicit combinatorial injection between a certain collections of Edelman-Greene tableaux and standard Young tableaux.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Relating Edelman-Greene insertion to the Little map

The Little map and the Edelman-Greene insertion algorithm, a generalization of the Robinson-Schensted correspondence, are both used for enumerating the reduced decompositions of an element of the symmetric group. We show the Little map factors through Edelman-Greene insertion and establish new results about each map as a consequence. In particular, we resolve some conjectures of Lam and Little.

2013-01-12math.CO

Properties of the Edelman-Greene bijection

Edelman and Greene constructed a correspondence between reduced words of the reverse permutation and standard Young tableaux. We prove that for any reduced word the shape of the region of the insertion tableau containing the smallest possible entries evolves exactly as the upper-left component of the permutation's (Rothe) diagram. Properties of the Edelman-Greene bijection restricted to 132-avoiding and 2143-avoiding permutations are presented. We also consider the Edelman-Greene bijection applied to non-reduced words.

2019-01-07math.CO

A generalization of Edelman--Greene insertion for Schubert polynomials

Edelman and Greene generalized the Robinson--Schensted--Knuth correspondence to reduced words in order to give a bijective proof of the Schur positivity of Stanley symmetric functions. Stanley symmetric functions may be regarded as the stable limits of Schubert polynomials, and similarly Schur functions may be regarded as the stable limits of Demazure characters for the general linear group. We modify the Edelman--Greene correspondence to give an analogous, explicit formula for the Demazure character expansion of Schubert polynomials. Our techniques utilize dual equivalence and its polynomial …

2019-03-14math.CO

vexillary 双 Edelman–Greene 系数的表格式公式

Tableau formula for vexillary double Edelman--Greene coefficients

本文针对 vexillary 置换情形，给出了双 β-Edelman–Greene 系数的表格式公式，使其 β-Graham 正性直接可见，并揭示了更精细的正性结构。

2024-12-29math.CO

双Edelman-Greene系数的正则组合公式

A positive combinatorial formula for the double Edelman--Greene coefficients

本文通过无峰管道图和递增链的组合模型，首次证明了双Edelman-Greene系数的正性，并给出了体现更细致正性的组合公式。

2025-12-13math.CO

Bumpless Pipedreams, Reduced Word Tableaux and Stanley Symmetric Functions

Lam, Lee and Shimozono introduced the structure of bumpless pipedreams in their study of back stable Schubert calculus. They found that a specific family of bumpless pipedreams, called EG-pipedreams, can be used to interpret the Edelman-Greene coefficients appearing in the expansion of a Stanley symmetric function in the basis of Schur functions. It is well known that the Edelman-Greene coefficients can also be interpreted in terms of reduced word tableaux for permutations. Lam, Lee and Shimozono proposed the problem of finding a shape preserving bijection between reduced word tableaux for a p…

2018-10-29math.CO

更多相关论文收起更多论文

Schubert Products for Permutations with Separated Descents

We say that two permutations $π$ and $ρ$ have separated descents at position $k$ if $π$ has no descents before position $k$ and $ρ$ has no descents after position $k$. We give a counting formula, in terms of reduced word tableaux, for computing the structure constants of products of Schubert polynomials indexed by permutations with separated descents, and recognize that these structure constants are certain Edelman-Greene coefficients. Our approach uses generalizations of Schützenberger's jeu de taquin algorithm and the Edelman-Greene correspondence via bumpless pipe dreams.

2023-01-12math.CO

Standard Rothe Tableaux

Edelman and Greene constructed a bijection between the set of standard Young tableaux and the set of balanced Young tableaux of the same shape. Fomin, Greene, Reiner and Shimozono introduced the notion of balanced Rothe tableaux of a permutation $w$, and established a bijection between the set of balanced Rothe tableaux of $w$ and the set of reduced words of $w$. In this paper, we introduce the notion of standard Rothe tableaux of $w$, which are tableaux obtained by labelling the cells of the Rothe diagram of $w$ such that each row and each column is increasing. We show that the number of stan…

2016-07-13math.CO

Back stable Schubert calculus

We study the back stable Schubert calculus of the infinite flag variety. Our main results are: 1) a formula for back stable (double) Schubert classes expressing them in terms of a symmetric function part and a finite part; 2) a novel definition of double and triple Stanley symmetric functions; 3) a proof of the positivity of double Edelman-Greene coefficients generalizing the results of Edelman-Greene and Lascoux-Schutzenberger; 4) the definition of a new class of bumpless pipedreams, giving new formulae for double Schubert polynomials, back stable double Schubert polynomials, and a new form o…

2021-03-22math.AGmath.CO

Balanced shifted tableaux

We introduce balanced shifted tableaux, as an analogue of balanced tableaux of Edelman and Greene, from the perspective of root systems of type B and C. We show that they are equinumerous to standard Young tableaux of the corresponding shifted shape by presenting an explicit bijection.

2022-03-23math.CO