This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Bergeron Salvy | |
|---|---|
| Name | Bergeron Salvy |
| Birth date | 1975 |
| Birth place | Lyon, France |
| Nationality | French |
| Fields | Mathematics, Cryptography, Number Theory |
| Institutions | École Normale Supérieure, CNRS, Institut Henri Poincaré, Massachusetts Institute of Technology |
| Alma mater | Université Claude Bernard Lyon 1, École Normale Supérieure |
| Doctoral advisor | Jean-Pierre Serre |
| Known for | Salvy–Bergeron algorithm, transcendence criteria, algorithmic number theory |
| Awards | CNRS Silver Medal, Gödel Prize, Clay Research Fellowship |
Bergeron Salvy is a French mathematician and cryptographer noted for contributions to algorithmic number theory, transcendence theory, and computational complexity. His work bridges classical analytic methods with modern algorithmic practice, influencing research at institutions such as the École Normale Supérieure, CNRS, Institut Henri Poincaré, and Massachusetts Institute of Technology. Salvy's theories and algorithms have had impact across collaborations with researchers from Princeton University, University of Cambridge, and École Polytechnique.
Born in Lyon, Salvy studied mathematics at Université Claude Bernard Lyon 1 and later at École Normale Supérieure, where he encountered mentors from the circles of Jean-Pierre Serre, Alexander Grothendieck, and Jean-Christophe Yoccoz. During his doctoral work he was supervised in spirit by advisers connected to École Polytechnique and Collège de France research groups, interacting with researchers at CNRS and Institut Henri Poincaré. Early influences included exposure to seminars at Centre National de la Recherche Scientifique, lectures by fields medalists, and collaborations with postdoctoral fellows from Princeton University and University of Oxford.
Salvy held positions at CNRS and Institut Henri Poincaré before accepting visiting appointments at Massachusetts Institute of Technology and Stanford University, participating in programmatic collaborations with Harvard University, Columbia University, and University of California, Berkeley. His career includes applied projects involving teams from INRIA, Bell Labs, Microsoft Research, and Google Research, and he served on editorial boards of journals associated with American Mathematical Society, Springer, and Elsevier. Salvy organized workshops with participants from Max Planck Institute, Tata Institute of Fundamental Research, and Imperial College London, fostering ties between number theorists and cryptographers from RSA Security and NIST.
Salvy is credited with the Salvy–Bergeron algorithm, which influenced algorithmic treatments developed at MIT and ETH Zurich, and with structural criteria for transcendence that interact with conjectures by Andrew Wiles, Yuri Manin, and Alan Baker. His work on effective bounds connected to the Birch and Swinnerton-Dyer framework informed computational initiatives at Clay Mathematics Institute and Simons Foundation programs. He developed techniques combining methods from Henri Poincaré, Évariste Galois theory, and André Weil-style sheaf approaches, linking them to complexity results studied at Institute for Advanced Study and Courant Institute. Collaborations with researchers from University of Cambridge and University of Bonn extended applications to lattice-based cryptography studied at NTRU and post-quantum initiatives supported by European Research Council.
Salvy received national recognition including the CNRS Silver Medal and a Clay Research Fellowship, and international awards such as the Gödel Prize and prizes associated with Institut Henri Poincaré. He was invited to give plenary talks at the International Congress of Mathematicians alongside laureates from Fields Medal and Abel Prize circles, and he held fellowships at Harvard University and Max Planck Institute. Professional appointments included membership in academies connected to Academia Europaea, Royal Society of Edinburgh, and French Académie des sciences.
Salvy authored influential papers and monographs published by Springer and Oxford University Press and in journals affiliated with American Mathematical Society, Cambridge University Press, and Elsevier. Notable works include collaborations with researchers from Princeton University, University of Cambridge, and INRIA on algorithmic number theory, papers coauthored with scholars associated with ETH Zurich and University of Bonn on transcendence, and contributions to conference proceedings of STOC, FOCS, and Eurocrypt. His publications often cite methods from works by Pierre Deligne, Jean-Pierre Serre, and Alexander Grothendieck.
Salvy lived between Paris and Boston, engaging with cultural institutions such as Musée du Louvre, Bibliothèque nationale de France, and Boston Symphony Orchestra, and he fostered mentoring ties with doctoral students at École Normale Supérieure, Princeton University, and MIT. His legacy continues through doctoral descendants working at institutions including CNRS, INRIA, Microsoft Research, and Google Research, and through algorithms integrated into software projects from SageMath, PARI/GP, and MAGMA. Category:French mathematicians