Jennifer Balakrishnan
Jennifer Shyamala Sayaka Balakrishnan is an American mathematician[1] known for leading a team that solved the problem of the "cursed curve", a Diophantine equation that was known for being "famously difficult".[2] More generally, Balakrishnan specializes in algorithmic number theory and arithmetic geometry. She is a Clare Boothe Luce Professor at Boston University.[1] Education and careerBalakrishnan was born in Mangilao, Guam[3] to Narayana and Shizuko Balakrishnan; her father is a professor of chemistry at the University of Guam.[4][5] As a junior at Harvest Christian Academy, Balakrishnan won an honorable mention in the 2001 Karl Menger Memorial Award competition, for the best mathematical project in the Intel International Science and Engineering Fair. Her project concerned elliptic coordinate systems.[6] In the following year, she won the National High School Student Calculus Competition, given as part of the United States of America Mathematical Olympiad.[7] Balakrishnan graduated from Harvard University in 2006, with both a magna cum laude bachelor's degree and a master's degree in mathematics.[1] She moved to the Massachusetts Institute of Technology for her doctoral studies, completing her Ph.D. in 2011. Her dissertation, Coleman integration for hyperelliptic curves: algorithms and applications, was supervised by Kiran Kedlaya.[1][8] She returned to Harvard for her postdoctoral studies from 2011 to 2013, and then moved to the University of Oxford from 2013 to 2016, where she was a Junior Research Fellow in Balliol College and a Titchmarsh Research Fellow in the Mathematical Institute.[1] She became Clare Booth Luce Assistant Professor at Boston University in 2016,[9] Clare Booth Luce Associate Professor in 2021, and Clare Booth Luce Professor in 2023.[1] Balakrishnan is one of the principal investigators in the Simons Collaboration on Arithmetic Geometry, Number Theory, and Computation, a large multi-university collaboration involving Boston University, Harvard, MIT, Brown University, and Dartmouth College, with additional collaborators from other universities in the US, England, Australia, the Netherlands, and Canada.[10]. She also serves on the board of directors of the Number Theory Foundation and the editorial boards of Research in Number Theory and Mathematics of Computation.[11][12][13] She serves on the Scientific Advisory Board for the Institute for Computational and Experimental Research in Mathematics (ICERM).[14] ContributionsIn 2017, Balakrishnan led a team of mathematicians in settling the problem of the "cursed curve" . This curve is modeled by the equation and, as a Diophantine equation, the problem is to determine all rational solutions, i.e., assignments of rational numbers to the variables , , and for which the equation is true.[2] Although as an explicit equation this curve has a complicated form, it is natural and conceptually significant in the number theory of elliptic curves. The equation describes a modular curve whose solutions characterize the one remaining unsolved case of a theorem of Bilu, Parent & Rebolledo (2013) on the Galois representations of elliptic curves without complex multiplication.[15] Computations by Galbraith (2002) and Baran (2014) had previously identified seven solutions on the cursed curve (six corresponding to elliptic curves with complex multiplication, and one cusp), but their computational methods were unable to show that the list of solutions was complete.[16][17] Following a suggestion of Oxford mathematician Minhyong Kim, Balakrishnan and her co-authors constructed a "Selmer variety" associated with the curve, such that the rational points of the curve all lie on the Selmer variety as well, and such that the number of points of intersection of the curve and the variety can be computed. Using this method, they proved that the seven known solutions to the cursed curve are the only ones possible.[2] This work was initially reported in a 2017 arXiv preprint [18] and was published in the journal Annals of Mathematics in 2019.[19] Balakrishnan has researched, with Ken Ono and others, Lehmer's question on whether the Ramanujan tau function is ever zero for a positive integer n.[20] As well as for her work in number theory, Balakrishnan is known for her work implementing number-theoretical algorithms as part of the SageMath computer algebra system.[9] RecognitionBalakrishnan received the Clare Boothe Luce Assistant Professorship in 2016. In 2018, Balakrishnan was selected as a Sloan Research Fellow.[21] In 2020, she was selected for a National Science Foundation CAREER Award.[22] She was named a Fellow of the American Mathematical Society, in the 2022 class of fellows, "for contributions to arithmetic geometry and computational number theory and service to the profession".[23] She earned the 2022 AWM–Microsoft Research Prize in Algebra and Number Theory in recognition of her "outstanding contributions to explicit methods in number theory, particularly her advances in computing rational points on algebraic curves over number fields".[24] She was selected as a Fellow of the Association for Women in Mathematics in the class of 2023 "for her support of women in mathematics through mentoring and advising; for organizing and supporting programs for women and girls, especially Women in Sage and Women in Numbers; for her work in outreach and education, including GirlsGetMath; and for working to improve diversity, equity, and inclusion in research communities.[25] In 2023 she was awarded the 2023-2024 AMS-Birman Fellowship.[26] Selected publications
References
External links |