355 Altgeld Hall, MC-382
1409 W. Green Street
Urbana, IL 61801
My research interests are in combinatorics, in relation to algebra, geometry, Lie theory, probability, algorithms and other areas of mathematics. The core of my research program has been in Schubert calculus and geometry. Other work I have done may be roughly classified under combinatorial commutative algebra and combinatorial algorithms.
PhD Mathematics, University of Michigan Ann Arbor, 2003
Awards and Honors
Distinguished Teaching Award in Mathematics for Tenured Faculty, Department of Mathematics, 2018
Arnold O. Beckman Award, Campus Research Board, University of Illinois, 2018
Helen Corley Petit Professorial Scholar, College of LAS, University of Illinois, 2012-2013
Beckman Fellow, Center for Advanced Study, University of Illinois, 2011-2012
G. de B. Robinson Award, Canadian Mathematical Society, 2011
Adve, A., Robichaux, C., & Yong, A. (2021). An efficient algorithm for deciding vanishing of Schubert polynomial coefficients. Advances in Mathematics, 383, . https://doi.org/10.1016/j.aim.2021.107669
Gao, S., Orelowitz, G., & Yong, A. (2021). Newell-Littlewood Numbers. Transactions of the American Mathematical Society, 374(9), 6331-6366. https://doi.org/10.1090/tran/8375
Woo, A., & Yong, A. (2020). Tropicalization, symmetric polynomials, and complexity. Journal of Symbolic Computation, 99, 242-249. https://doi.org/10.1016/j.jsc.2019.06.002
Adve, A., Robichaux, C., & Yong, A. (2019). Computational complexity, Newton polytopes, and Schubert polynomials. Paper presented at 31st International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2019, Ljubljana, Slovenia.
Adve, A., Robichaux, C., & Yong, A. (2019). Vanishing of Littlewood–Richardson polynomials is in P. Computational Complexity, 28(2), 241-257. https://doi.org/10.1007/s00037-019-00183-6