Algebraic Combinatorics 2018
DOI: 10.5802/alco.27
|View full text |Cite
|
Sign up to set email alerts
|

Schubert polynomials, 132-patterns, and Stanley’s conjecture

Abstract: Motivated by a recent conjecture of R. P. Stanley we offer a lower bound for the sum of the coefficients of a Schubert polynomial in terms of 132-pattern containment. Write η w := #P 132 (w). If η w 1 then w contains the pattern 132. Example 1.1. Let w = 25143. Below, we list the elements of P 132 (w) by marking in bold the positions i < j < k for which (i, j, k) ∈ P 132 (w).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 4 publications
0
10
0
Order By: Relevance
“…, 1) which has been extensively studied in recent years (see e.g. [BHY,MeS,SeS,Sta4,Wei,Woo]). Below we present two such formulas: Here σ × ω and σ ⊗ ω are the direct sum and the Kronecker product of permutations σ and ω (see §2.2).…”
Section: Introductionmentioning
confidence: 99%
“…, 1) which has been extensively studied in recent years (see e.g. [BHY,MeS,SeS,Sta4,Wei,Woo]). Below we present two such formulas: Here σ × ω and σ ⊗ ω are the direct sum and the Kronecker product of permutations σ and ω (see §2.2).…”
Section: Introductionmentioning
confidence: 99%
“…Finally, under Theorem 1.3, each F i corresponds to a distinct exponent vector since the sum of the labels is strictly decreasing at each step F i−1 → F i . From Corollary 4.5, this result of A. Weigandt [17] is immediate: As shown in [17], Corollary 4.6 in turn implies S w (1, 1, . .…”
Section: Define a Collection Of Intervals In [N] Bymentioning
confidence: 83%
“…A deeper study of Macdonald's reduced word identity and its generalizations has seen renewed interest recently and has brought forth various interesting aspects of the interplay between Schubert polynomials, combinatorics of reduced words, and differential operators on polynomials. We refer the reader to [9,26,62,47] for more details. As we shall see in the next section, an expression rather reminiscent of the right hand side of (2.15) plays a key role in our quest to obtain the Schubert expansion for τ n = [Perm n ], and its appearance in this context begs for deeper explanation.…”
Section: Reduced Wordsmentioning
confidence: 99%
“…Proof of Proposition 6.4. We use here [62,Lemma 3.6(iii)] which states that for any w ∈ S ∞ , a(γ w ) = a(γ w −1 ), which translates into ā(w) = ā(w −1 ). We then conclude by Proposition A.2.…”
mentioning
confidence: 99%