Claude Berge
| Claude Berge | |
|---|---|
| Born |
5 June 1926 Paris, France |
| Died | 30 June 2002 (aged 76) Paris, France |
| Nationality | French |
| Fields | Mathematics |
| Alma mater | Paris University |
Claude Jacques Berge (5 June 1926 – 30 June 2002) was a French mathematician, recognized as one of the modern founders of combinatorics and graph theory.
Claude Berge was the son of André Berge and Geneviève Fourcade, and the great-grandson of French President Félix Faure. Claude was the second of six children; his siblings were Nicole, Antoine, Philippe, Edith and Patrick. He married Jane Gentaz on December 29, 1952 and had one child, Delphine, born March 1, 1964. Although Claude Berge was unsure if he wanted study mathematics, instead often leaning towards literature, after studying at the École des Roches in Verneuil-sur-Avre, he attended the University of Paris to study mathematics and earned his Ph.D. in 1953, advised by André Lichnerowicz. At the University of Paris, Berge wrote several papers including his doctorate thesis paper Sur une théorie ensembliste des jeux alternatifs. In this paper, Berge examines properties of games where there is perfect information available and there are infinite choices for each move. This thesis served as the basis of a 55-page paper published in 1953.
Beginning in 1952 he was a Research Assistant at the French National Centre for Scientific Research (CNRS), and from 1957 to 1964 he was a Professor at the Institute of Statistics at the University of Paris. From 1965 to 1967 he directed the International Computing Center in Rome. He was also associated with the Centre d'Analyse et de Mathématique Sociales (CAMS), a research center of École des hautes études en sciences sociales. He held visiting positions at Princeton University in 1957, Pennsylvania State University in 1968, and New York University in 1985, and was a frequent visitor to the Indian statistical institute, Calcutta.
...
Wikipedia