Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Colleen Robichaux"'
Publikováno v:
Journal of Algebra. 617:160-191
We give degree formulas for Grothendieck polynomials indexed by vexillary permutations and $1432$-avoiding permutations via tableau combinatorics. These formulas generalize a formula for degrees of symmetric Grothendieck polynomials which appeared in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb4b3b830ee11b1bbfc96fbb09cde6cd
https://doi.org/10.1016/j.jalgebra.2022.11.001
https://doi.org/10.1016/j.jalgebra.2022.11.001
Publikováno v:
computational complexity. 28:241-257
J. De Loera & T. McAllister and K. D. Mulmuley & H. Narayanan & M. Sohoni independently proved that determining the vanishing of Littlewood–Richardson coefficients has strongly polynomial time computational complexity. Viewing these as Schubert cal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5dbd872cc8798cfe47ce7425d1c667bf
https://doi.org/10.1007/s00037-019-00183-6
https://doi.org/10.1007/s00037-019-00183-6
Schubert polynomials form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. The vanishing problem for Schubert polynomials asks if a coefficient of a Schubert polynomial is zero. We give a tableau criterion to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1c8209d88f02c74d2cd349eb4560bb5
http://arxiv.org/abs/2103.05195
http://arxiv.org/abs/2103.05195
We give an explicit formula for the degree of the Grothendieck polynomial of a Grassmannian permutation and a closely related formula for the Castelnuovo-Mumford regularity of the Schubert determinantal ideal of a Grassmannian permutation. We then pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f49829210630ff4616ac2a251a27d390
http://arxiv.org/abs/1912.04477
http://arxiv.org/abs/1912.04477
Publikováno v:
Scopus-Elsevier
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby, in amenab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b769b1f20e6b0afa53ab0426027065bb
Autor:
Ka Yu Tam, David Schwein, Hailee Peck, Michelle Mastrianni, Colleen Robichaux, Christian Gaetz, Rebecca Patrias
Publikováno v:
Scopus-Elsevier
A K-theoretic analogue of RSK insertion and Knuth equivalence relations was first introduced in 2006 by Buch, Kresch, Shimozono, Tamvakis, and Yong. The resulting K-Knuth equivalence relations on words and increasing tableaux on [n] has prompted inve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8fdec5cc6c165778c68fbc34cb2eb42
http://arxiv.org/abs/1409.6659
http://arxiv.org/abs/1409.6659