62 citations · 348 across the 73 of their papers we have counts for
7 papers · 1 filter
Tropicalization, symmetric polynomials, and complexity
Alexander Woo, Alexander Yong
D. Grigoriev-G. Koshevoy recently proved that tropical Schur polynomials have (at worst) polynomial tropical semiring complexity. They also conjectured tropical skew Schur polynomi…
Vanishing of Littlewood-Richardson polynomials is in P
Anshul Adve, Colleen Robichaux, Alexander Yong
J. DeLoera-T. McAllister and K. D. Mulmuley-H. Narayanan-M. Sohoni independently proved that determining the vanishing of Littlewood-Richardson coefficients has strongly polynomial…
K-orbit closures and Barbasch-Evens-Magyar varieties
Laura Escobar, Benjamin J. Wyser, Alexander Yong
We define the Barbasch-Evens-Magyar varieties. We show they are isomorphic to the smooth varieties defined in [D.~Barbasch-S.~Evens '94] that map generically finitely to symmetric…
Symmetric group representations and Z
Anshul Adve, Alexander Yong
We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluatio…
Newton polytopes and symmetric Grothendieck polynomials
Laura Escobar, Alexander Yong
Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial -theory. A polynomial has saturated Newton polytope (SNP) if every…
Newton Polytopes in Algebraic Combinatorics
Cara Monical, Neriman Tokcan, Alexander Yong
A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebra…