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

Autor:	Anna Weigandt
Rok vydání:	2018
Předmět:	Combinatorics Containment (computer programming) Mathematics::Combinatorics Conjecture Schubert polynomial Upper and lower bounds Mathematics
Zdroj:	Algebraic Combinatorics. 1:415-423
DOI:	10.5802/alco.27
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7f11095a7d321ce127e03dd04ae55e32 https://doi.org/10.5802/alco.27 Zobrazit plný text záznamu