Upper bounds of Schubert polynomials
Upper bounds of Schubert polynomials
复制标题
舒伯特多项式的上限
DOI:
--
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Peter L. Guo
中科院分区:
文献类型:
--
作者:
Neil J. Y. Fan;Peter L. Guo
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).
影响因子:
1.7
作者:
Fink A
通讯作者:
Fink A
影响因子:
0.8
作者:
Fink A
通讯作者:
Fink A