Upper bounds of Schubert polynomials

Upper bounds of Schubert polynomials
复制标题

舒伯特多项式的上限

DOI:
--
复制
发表时间:
2019
期刊:
Science China Mathematics
影响因子:
--
通讯作者:
Peter L. Guo
Peter L. Guo
中科院分区:
--
文献类型:
--
作者:
Neil J. Y. Fan;Peter L. Guo

文献摘要

参考文献

被引文献

相似文献

设w是{1,2,…的排列,n},设D(W)是w的Rothe图。舒伯特多项式${mathfrak{S}_w}左(x T)$S w(X)可以被实现为与D(W)相关的带标志Weyl模的对偶特征标。这意味着系数式的不等式如下:$${ M{Mi}}{{ M{n}}_w}左侧(x 左{S}_w}左(x 晚上)乐{ M{Ma}}{{ M{x}}_w}左侧(x T),$$min w(X)≤S w(X)≤max w(X),其中min w(X)和max w(X)都是由D(W)决定的多项式。芬克等人。(2018)发现${mathfrak{S}_w}左(x T)$S w(X)等于下界Min w(X)当且仅当w避免了12个排列模式。本文证明了${mathfrak{S}_w}左(x T)$S w(X)达到上限w(X)当且仅当w避免两个排列模式1432和1423。类似地,对于任何给定的合成α∈ℤ≽0 n,可以定义密钥多项式α(X)的下界Minα(X)和上界Maxκα(X)。霍奇斯和勇(2020年)确立了κα(X)等于Minα(X)的充要条件是α避免了五种合成模式。我们证明了κα(X)等于maxα(X)的充要条件是α避免了单一的合成模式(0,2)。作为应用,我们得到了当α避免(0,2)时,密钥多项式κα(X)是洛伦兹的,部分验证了Huh等人的一个猜想。(2019年)。
Let w be a permutation of {1, 2, …, n }, and let D ( w ) be the Rothe diagram of w . The Schubert polynomial ${mathfrak{S}_w}left(x ight)$ S w ( x ) can be realized as the dual character of the flagged Weyl module associated with D ( w ). This implies the following coefficient-wise inequality: $${ m{Mi}}{{ m{n}}_w}left(x ight) le {mathfrak{S}_w}left(x ight) le { m{Ma}}{{ m{x}}_w}left(x ight),$$ Min w ( x ) ≤ S w ( x ) ≤ Max w ( x ) , where both Min w ( x ) and Max w ( x ) are polynomials determined by D ( w ). Fink et al. (2018) found that ${mathfrak{S}_w}left(x ight)$ S w ( x ) equals the lower bound Min w ( x ) if and only if w avoids twelve permutation patterns. In this paper, we show that ${mathfrak{S}_w}left(x ight)$ S w ( x ) reaches the upper bound Max w ( x ) if and only if w avoids two permutation patterns 1432 and 1423. Similarly, for any given composition α ∈ ℤ ≽0 n , one can define a lower bound Min α ( x ) and an upper bound Max α ( x ) for the key polynomial κ α ( x ). Hodges and Yong (2020) established that κ α ( x ) equals Min α ( x ) if and only if α avoids five composition patterns. We show that κ α ( x ) equals Max α ( x ) if and only if α avoids a single composition pattern (0, 2). As an application, we obtain that when α avoids (0, 2), the key polynomial κ α ( x ) is Lorentzian, partially verifying a conjecture of Huh et al. (2019).
作为广义置换面体整数点变换的舒伯特多项式
DOI: 10.1016/j.aim.2018.05.028
发表时间: 2018
影响因子: 1.7
作者:
Fink A
通讯作者: Fink A
零一舒伯特多项式
DOI: 10.1007/s00209-020-02544-2
发表时间: 2020
影响因子: 0.8
作者:
Fink A
通讯作者: Fink A