معرفی
J. Maurice Rojas is a Professor and Associate Head of Graduate Programs at Texas A&M University's Department of Mathematics. His research focuses on computational algebraic geometry, discrete geometry, and polynomial equation solving with applications in complexity theory and number theory. He holds a Ph.D. from the University of California, Berkeley (1995), alongside earlier degrees from Berkeley and UCLA.
Rojas' work bridges theoretical and algorithmic approaches to problems in algebraic geometry, including fewnomial theory, real and p-adic root counting, and tropical geometry. His contributions address the computational complexity of polynomial systems, with recent emphasis on sparse polynomials and circuit-based algorithms. He has authored over 50 papers and contributed to NSF-funded projects on arithmetic geometry and algorithmic methods.
His research has explored applications in statistical modeling of petascale data, topological data analysis, and interdisciplinary collaborations between mathematics and computer science. Notable achievements include foundational work on A-discriminants, Viro's patchworking, and the development of sub-linear algorithms for algebraic structures.
