Maria Chudnovsky

Maria Chudnovsky
Chudnovsky in 2011.
Born (1977-01-06) January 6, 1977 (age 49)
Leningrad, Soviet Union[1]
Alma materTechnion
Princeton University
Known forGraph theory,
Combinatorial optimization
Scientific career
FieldsMathematics
InstitutionsPrinceton University
ThesisBerge Trigraphs and Their Applications. (2005)
Paul Seymour

Maria Chudnovsky (born January 6, 1977) is an Israeli-American mathematician working on graph theory and combinatorial optimization.[2] She is a 2012 MacArthur Fellow.[3]

Education and career

Chudnovsky is a professor in the department of mathematics at Princeton University. She grew up in Russia (attended Saint Petersburg Lyceum 30) and Israel, studying at the Technion,[4] and received her Ph.D. in 2003 from Princeton University under the supervision of Paul Seymour.[5] After postdoctoral research at the Clay Mathematics Institute,[4] she became an assistant professor at Princeton University in 2005, and moved to Columbia University in 2006. By 2014, she was the Liu Family Professor of Industrial Engineering and Operations Research at Columbia. She returned to Princeton as a professor of mathematics in 2015.[2]

Chudnovsky is an editor for a number of mathematical journals, including Combinatorica, Journal of Combinatorial Theory Series B, Journal of Graph Theory and Proceedings of the London Mathematical Society.[2]

Research

External videos
video icon Mathematician Maria Chudnovsky: 2012 MacArthur Fellow, MacArthur Foundation[6]

Chudnovsky's contributions to graph theory include the proof of the strong perfect graph theorem (with Neil Robertson, Paul Seymour, and Robin Thomas) characterizing perfect graphs as being exactly the graphs with no odd induced cycles of length at least 5 or their complements.[7][8][9] Other research contributions of Chudnovsky include co-authorship of the first polynomial-time algorithm for recognizing perfect graphs (time bounded by a polynomial of degree 9),[10] a structural characterization of the claw-free graphs,[11] and progress on the Erdős–Hajnal conjecture.[12]

Selected publications

  • Chudnovsky, Maria; Cornuéjols, Gérard; Liu, Xinming; Seymour, Paul; Vušković, Kristina (2005), "Recognizing Berge graphs", Combinatorica, 25 (2): 143–186, doi:10.1007/s00493-005-0012-8, MR 2127609, S2CID 2229369.
  • Chudnovsky, Maria; Seymour, Paul (2005), "The structure of claw-free graphs", Surveys in Combinatorics 2005, London Mathematical Society Lecture Note Series, vol. 327, Cambridge: Cambridge Univ. Press, pp. 153–171, CiteSeerX 10.1.1.112.4130, doi:10.1017/CBO9780511734885.008, ISBN 9780511734885, MR 2187738.
  • Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2006), "The strong perfect graph theorem", Annals of Mathematics, 164 (1): 51–229, arXiv:math/0212070, doi:10.4007/annals.2006.164.51, S2CID 119151552.
  • Chudnovsky, Maria; Sivaraman, Vaidy (2018), "Odd Holes in Bull-Free Graphs", SIAM Journal on Discrete Mathematics, 32 (2): 951–955, arXiv:1704.04262, doi:10.1137/17M1131301, MR 3794342, S2CID 1657094

Awards and honors

In 2004 Chudnovsky was named one of the "Brilliant 10" by Popular Science magazine.[13] Her work on the strong perfect graph theorem won for her and her co-authors the 2009 Fulkerson Prize.[14] In 2012 she was awarded a "genius award" under the MacArthur Fellows Program.[15][16] She was elected as a Fellow of the American Mathematical Society in the 2024 class of fellows.[17] Elected to the National Academy of Science in 2026.[18]

Personal life

In 2011, she married Daniel Panner, a viola player who teaches at Mannes School of Music and Rutgers University. They have a son named Rafael.[19]

References

  1. ^ Interview with a Mathematician
  2. ^ a b c "Maria Chudnovsky Curriculum Vitae" (PDF). Princeton University. Retrieved 21 Jan 2024.
  3. ^ "2012 MacArthur Foundation 'Genius Grant' Winners". 1 October 2012. Associated Press. Archived from the original on 2 October 2012. Retrieved 1 October 2012.
  4. ^ a b Interview with Research Fellow Maria Chudnovsky (PDF), Clay Mathematics Institute, 2005.
  5. ^ Maria Chudnovsky at the Mathematics Genealogy Project
  6. ^ "Maria Chudnovsky". MacArthur Fellows Program. MacArthur Foundation. October 2, 2012. Retrieved December 13, 2014.
  7. ^ Mackenzie, Dana (July 5, 2002), "Mathematics: Graph theory uncovers the roots of perfection", Science, 297 (5578): 38, doi:10.1126/science.297.5578.38, PMID 12098683, S2CID 116891342.
  8. ^ Cornuéjols, Gérard (2002), "The strong perfect graph conjecture", Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002) (PDF), Beijing: Higher Ed. Press, pp. 547–559, MR 1957560, archived from the original (PDF) on 2014-04-07, retrieved 2012-08-11
  9. ^ Roussel, Florian; Rusu, Irena; Thuillier, Henri (2009), "The strong perfect graph conjecture: 40 years of attempts, and its resolution", Discrete Mathematics, 309 (20): 6092–6113, CiteSeerX 10.1.1.230.1328, doi:10.1016/j.disc.2009.05.024, MR 2552645, S2CID 16049392.
  10. ^ Chudnovsky et al. (2005).
  11. ^ Chudnovsky & Seymour (2005).
  12. ^ Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (2023-01-31). "Erdős–Hajnal for graphs with no 5-hole". Proceedings of the London Mathematical Society. 126 (3). Wiley: 997–1014. arXiv:2102.04994. doi:10.1112/plms.12504. ISSN 0024-6115.
  13. ^ Minkel, J. R. (June 29, 2004), "Maria Chudnovsky", Popular Science
  14. ^ "2009 Fulkerson Prizes" (PDF), Notices of the American Mathematical Society: 1475–1476, December 2011.
  15. ^ Lee, Felicia R. (October 1, 2012), "Surprise Grants Transforming 23 More Lives", New York Times
  16. ^ Maria Chudnovsky, MacArthur Foundation, October 2, 2012.
  17. ^ 2024 Class of Fellows of the AMS, American Mathematical Society, retrieved 2023-11-08
  18. ^ "National Academy of Sciences Elects Members and International Members - NAS". National Academy of Science. April 28, 2026. Retrieved May 6, 2026.{{cite web}}: CS1 maint: url-status (link)
  19. ^ Cohen, Joyce (2014-01-08). "Striking While the Iron Is Hot - NYTimes.com". The New York Times. Retrieved 2016-02-03.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.