Andrew Suk

Andrew Suk is a Professor in the Department of Mathematics at the University of California, San Diego (UCSD). He holds an NSF CAREER Award and an Alfred P. Sloan Research Fellowship. His research focuses on Combinatorics, Discrete Geometry, Ramsey Theory, and Extremal Combinatorics, supported by grants such as NSF FRG Collaborative Research (DMS-1952786) and NSF (DMS-2246847). He completed his Ph.D. at New York University's Courant Institute in 2011, followed by an NSF Postdoctoral Fellowship at MIT under Jacob Fox.

Education:

• Ph.D., Mathematics, New York University, 2011

Research Interests: Suk's work spans Geometric Combinatorics, Ramsey Theory, and extremal problems in discrete structures. Notable contributions include resolving the Erdős-Szekeres convex polygon problem asymptotically and advancing Ramsey-type results for semi-algebraic relations. His research bridges combinatorial geometry with graph theory and hypergraphs.

Recent Contributions: His articles explore topics like cliques in point-line arrangements, semi-algebraic Ramsey numbers, and geometric Ramsey problems. Key themes include extremal configurations, topological graphs, and applications of VC-dimension.

Awards:

• NSF CAREER Award
• Alfred P. Sloan Research Fellowship

Service & Mentorship: Suk advises Ph.D. students and serves as an editor for SIAM Journal on Discrete Mathematics and Studia Scientiarum Mathematicarum Hungarica. He organizes workshops and chairs program committees for conferences like SoCG and GD.

Teaching: Recent courses include Calculus for Science and Engineering at UCSD.