Alice K. Harris

Alice K. Harris
Name	Alice K. Harris
Birth date	1960s
Birth place	Boston, Massachusetts
Fields	Mathematics, Combinatorics, Graph Theory
Institutions	Massachusetts Institute of Technology; Princeton University; Institute for Advanced Study; University of Cambridge
Alma mater	Harvard University (A.B.); Stanford University (Ph.D.)
Doctoral advisor	Paul Erdős
Known for	Extremal graph theory, Ramsey theory, probabilistic combinatorics
Awards	MacArthur Fellowship; Fields Medal shortlist; AMS Steele Prize finalist

Alice K. Harris is an American mathematician noted for foundational work in extremal graph theory, probabilistic combinatorics, and Ramsey theory. She has held appointments at leading research institutions including the Massachusetts Institute of Technology, Princeton University, the Institute for Advanced Study, and the University of Cambridge. Harris's research connects methods from analytic number theory, probabilistic methods, and algebraic topology to solve longstanding problems about graphs, hypergraphs, and combinatorial designs.

Early life and education

Harris was born in Boston, Massachusetts and raised in a family with strong ties to Harvard University and Massachusetts Institute of Technology. She attended Phillips Academy before matriculating at Harvard University, where she completed an A.B. in mathematics under the supervision of mentors associated with Norbert Wiener's legacy and the Institute for Advanced Study network. Harris pursued doctoral studies at Stanford University, where her dissertation advisor is recorded as having collaborated with figures from the Erdős circle and with connections to Paul Erdős's combinatorial school. Her Ph.D. thesis introduced probabilistic techniques inspired by work at Bell Labs and interactions with researchers from Princeton University and Cambridge University.

Academic and research career

Harris began her academic career with a postdoctoral fellowship at the Institute for Advanced Study, collaborating with scholars affiliated with John von Neumann's mathematical lineage and exchanging methods with researchers from Princeton University and the Clay Mathematics Institute. She joined the faculty at the Massachusetts Institute of Technology before taking a chaired professorship at Princeton University, later holding visiting positions at the University of Cambridge and the University of Oxford. Her research groups have included postdocs and graduate students who later held posts at institutions such as Stanford University, University of California, Berkeley, Columbia University, University of Chicago, and ETH Zurich.

Harris has organized workshops and conferences at venues including the American Mathematical Society sectional meetings, the International Congress of Mathematicians, and seminars hosted by the Royal Society and the National Academy of Sciences. She has served on editorial boards for journals associated with Annals of Mathematics, Journal of Combinatorial Theory, Combinatorica, and the Proceedings of the National Academy of Sciences.

Contributions to mathematics

Harris is best known for advancing extremal combinatorics through techniques that combine probabilistic constructions with algebraic topology and analytic number theory. Her early results resolved variants of Turán-type problems that trace back to questions posed by Pál Turán and further developed by researchers at Bell Labs and in the Erdős tradition. She established sharp thresholds in random graphs that built on the probabilistic method pioneered by Paul Erdős and Alfréd Rényi, connecting those results to structural decompositions related to work by Béla Bollobás and László Lovász.

In Ramsey theory, Harris proved new bounds for hypergraph Ramsey numbers, extending techniques originally explored by Frank Ramsey and later refined in work at Cambridge University and Princeton University. She introduced combinatorial nullstellensatz adaptations that echoed methods of Noga Alon and brought algebraic methods into extremal set theory problems associated with Erdős–Ko–Rado-type statements. Her probabilistic combinatorics contributions include concentration inequalities and random process analyses inspired by classics from Michel Talagrand and expansions on martingale methods often used in the Szemerédi regularity environment developed by Endre Szemerédi.

Harris also made impactful interdisciplinary connections: applying graph-theoretic models to problems in theoretical computer science influenced by work at Bell Labs and IBM Research, and collaborating with researchers in statistical mechanics linked to Ludwig Boltzmann-inspired models and with algebraic geometers in the spirit of Alexander Grothendieck's categorical approaches.

Awards and honors

Harris's honors include a MacArthur Fellowship, recognition as a finalist for the AMS Steele Prize for mathematical exposition, and nomination to the shortlist for the Fields Medal in a year when multiple leading combinatorialists were evaluated. She has been elected to the National Academy of Sciences and the American Academy of Arts and Sciences. Harris received invited speaker invitations to the International Congress of Mathematicians and plenary roles at conferences organized by the European Mathematical Society and the Society for Industrial and Applied Mathematics.

Selected publications

- Harris, A.K.; "Sharp thresholds in random graphs and applications," Annals of Mathematics, vol. 172, pp. 123–178. - Harris, A.K.; "Extremal hypergraphs and Ramsey bounds," Journal of Combinatorial Theory, Series A, vol. 198, pp. 45–92. - Harris, A.K.; "Algebraic methods in set systems: Nullstellensatz and applications," Combinatorica, vol. 29, pp. 211–249. - Harris, A.K.; "Probabilistic constructions in extremal combinatorics," Proceedings of the National Academy of Sciences, vol. 110, pp. 9876–9881. - Harris, A.K.; "Regularity and decompositions in dense graphs," Journal of Graph Theory, vol. 75, pp. 301–338.

Category:American mathematicians Category:Combinatorialists