Daniel Lazard (born December 10, 1941) is a French mathematician and computer scientist. He is emeritus professor at Pierre and Marie Curie University.
Daniel Lazard | |
|---|---|
| Born | 10 December 1941 |
| Nationality | French |
| Alma mater | |
| Scientific career | |
| Fields | Mathematics, computer science |
| Institutions | Pierre and Marie Curie University |
| Thesis | Autour de la platitude (1968) |
| Doctoral advisor | Pierre Samuel |
| Doctoral students | Jean-Charles Faugère |
Career
editDaniel Lazard was born in Carpentras, in southern France.[citation needed] His undergraduate education was at the École Normale Supérieure.[citation needed] Following graduate work at the École Normale Supérieure and the University of Paris, he was granted a doctorat d'état in 1968 by the University of Paris. His dissertation was supervised by the commutative algebraist Pierre Samuel, and was titled "Autour de la platitude" ("Around flatness", or literally "Around the platitude").[1][2]
After 1970, his main area of research changed to computer algebra, particularly multivariate polynomials, computational algebraic geometry and systems of polynomial equations. To mark his retirement at the end of 2004, there was a conference at Pierre and Marie Curie University devoted to his subject area.[3] In 2009, a special issue of the Journal of Symbolic Computation was published in his honor.[4] To date, Lazard has authored or co-authored more than 40 journal articles, book chapters, conference papers, and other publications.[5]
Selected articles
edit- Lazard, Daniel (1969), "Autour de la platitude", Bulletin de la Société Mathématique de France (in French), 97: 81–128, doi:10.24033/bsmf.1675
- Lazard, Daniel (1981), "Résolution des systèmes d'équations algébriques", Theoretical Computer Science (in French), 15: 77–110, doi:10.1016/0304-3975(81)90064-5
- Lazard, Daniel (2001), "Solving systems of algebraic equations", ACM SIGSAM Bulletin, 35 (3), translated by Michael Abramson: 11–37, doi:10.1145/569746.569750, S2CID 5244703
- Lazard, Daniel (1992), "Solving zero-dimensional algebraic systems", Journal of Symbolic Computation, 13 (2): 117–131, doi:10.1016/s0747-7171(08)80086-7.
- Faugère, Jean-Charles; Gianni, Patrizia; Lazard, Daniel; Mora, Teo (1993), "Efficient computation of zero-dimensional Gröbner bases by change of ordering", Journal of Symbolic Computation, 16 (4): 329–344, doi:10.1006/jsco.1993.1051, MR 1263871
- Lazard, Daniel (2009), "Thirty years of Polynomial System Solving, and now?", Journal of Symbolic Computation, 44 (3): 222–231, doi:10.1016/j.jsc.2008.03.004
- ICPSS, International Conference on Polynomial System Solving, and special issue of Journal of Symbolic Computation, in honor of Daniel Lazard, archived from the original on 26 April 2012
References
edit- ^ Daniel Lazard at the Mathematics Genealogy Project.
- ^ Lazard, Daniel. Autour de la platitude (Thèse de doctorat). École Normale Supérieure (library record). Retrieved March 10, 2023.
- ^ "International Conference on Polynomial System Solving, Paris, November 24-25-26 2004, in honour of Daniel Lazard", LIP6, archived from the original on March 14, 2009.
- ^ Faugère, Jean-Charles; Rouillier, Fabrice (2009-03-01). "Foreword". Journal of Symbolic Computation. Polynomial System Solving in honor of Daniel Lazard. 44 (3): 221. doi:10.1016/j.jsc.2008.08.004. ISSN 0747-7171.
- ^ "LAZARD Daniel 1998-2021 Publications". Sorbonne Institute. Retrieved February 23, 2023.