Draft:Colin Defant

  • Comment: It is way, way too soon, see WP:TOOSOON. While he has made a good start, he needs much, more before he will be considered notable; it is very rare for a postdoc to be considered, wait 3-5 years. Note that neither the Hertz nor the NSF postdocs count as major awards. Ldm1954 (talk) 15:13, 13 September 2025 (UTC)
Colin Defant

Colin Defant (born 1995 in Tampa, Florida) is an American mathematician known for research in combinatorics and probability, with connections to geometry and algebra. He is a Benjamin Peirce Fellow and NSF Postdoctoral Fellow at Harvard University.[1][2]

Early life and education

Defant was born in Tampa, Florida in 1995. He received a Bachelor of Science degree in mathematics from the University of Florida in 2017.[3] He earned his Ph.D. in mathematics from Princeton University in 2022 under the supervision of Noga Alon.

Fellowships and appointments

In 2018, while a Ph.D. student at Princeton, Defant was awarded a Hertz Fellowship.[3][4] He later joined Harvard University as a Benjamin Peirce Fellow and NSF Mathematical Sciences Postdoctoral Research Fellow.[2]

Mentoring and leadership

During the summers from 2017 to 2022, Defant served as an adviser at the University of Minnesota Duluth Mathematics Research Experience for Undergraduates (REU) program.[4] Since 2023, he has served as co-director of the Duluth REU along with Joseph Gallian.[5][2]

Selected publications

Defant has written over 100 research articles in combinatorics, often drawing connections with probabilistic, algebraic, and geometric contexts.

  • Defant, Colin (April 2022). "Troupes, cumulants, and stack-sorting". Advances in Mathematics. 399 108270. arXiv:2004.11367. doi:10.1016/j.aim.2022.108270.
  • Defant, Colin; Hopkins, Sam (2021). "Symmetry of Narayana Numbers and Rowvacuation of Root Posets". Forum of Mathematics, Sigma. 9 e53. doi:10.1017/fms.2021.47.
  • Barkley, Grant; Defant, Colin; Hodges, Eliot; Kravitz, Noah; Lee, Mitchell (2025). "Bender–Knuth Billiards in Coxeter Groups". Forum of Mathematics, Sigma. 13 e7. doi:10.1017/fms.2024.159.
  • Defant, Colin; Williams, Nathan (2023). "Semidistrim Lattices". Forum of Mathematics, Sigma. 11 e50. doi:10.1017/fms.2023.46.
  • Defant, Colin; Kravitz, Noah (9 December 2021). "Friends and strangers walking on graphs". Combinatorial Theory. 1. doi:10.5070/C61055363.

Awards and honors

References

  1. ^ "Colin Defant". Harvard Mathematics Department. Retrieved 9 September 2025.
  2. ^ a b c d "Colin Defant – Personal Website". Retrieved 9 September 2025.
  3. ^ a b c "Ph.D. candidate Defant, alumna Sharon receive Hertz Fellowships for graduate research". Princeton University News. March 29, 2018. Retrieved 9 September 2025.
  4. ^ a b "Colin Defant – Hertz Foundation Fellow Directory". Hertz Foundation. Retrieved 9 September 2025.
  5. ^ "Duluth REU Program". Retrieved 9 September 2025.

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.