Cecil C. Rousseau

Last updated

Cecil Clyde Rousseau, Jr. (January 13, 1938 Philadelphia - April 10, 2020 Memphis) [1] [2] was a mathematician and author who specialized in graph theory and combinatorics. He was a professor at The University of Memphis starting in 1970 until retiring in 2008, and was involved with USAMO in many capacities, including serving as chair. [3]

Rousseau received his Ph.D. in Physics in 1968 from Texas A&M University. [4]

He has an Erdős number of 1, and is Erdős' 5th most common co-author, with 35 joint papers. [5] He also frequently collaborated with Memphis faculty Ralph Faudree and Dick Schelp.

In 2012, Rousseau received the Paul Erdős Award from the World Federation of National Mathematics Competitions. [6]

To his students and colleagues, he was known affectionately as C²R.

Related Research Articles

Erdős number Closeness of someones association with mathematician Paul Erdős

The Erdős number describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers. The same principle has been applied in other fields where a particular individual has collaborated with a large and broad number of peers.

Ronald Graham American mathematician (1935–2020)

Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.

Paul Erdős Hungarian mathematician (1913–1996)

Paul Erdős was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. Erdős pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set theory, and probability theory. Much of his work centered around discrete mathematics, cracking many previously unsolved problems in the field. He championed and contributed to Ramsey theory, which studies the conditions in which order necessarily appears. Overall, his work leaned towards solving previously open problems, rather than developing or exploring new areas of mathematics.

Béla Bollobás Hungarian mathematician

Béla Bollobás FRS is a Hungarian-born British mathematician who has worked in various areas of mathematics, including functional analysis, combinatorics, graph theory, and percolation. He was strongly influenced by Paul Erdős since the age of 14.

Ralph Jasper Faudree was a mathematician, a professor of mathematics and the former provost of the University of Memphis.

Samuel Standfield Wagstaff Jr. is an American mathematician and computer scientist, whose research interests are in the areas of cryptography, parallel computation, and analysis of algorithms, especially number theoretic algorithms. He is currently a professor of computer science and mathematics at Purdue University who coordinates the Cunningham project, a project to factor numbers of the form bn ± 1, since 1983. He has authored/coauthored over 50 research papers and three books. He has an Erdős number of 1.

László Lovász Hungarian mathematician

László Lovász is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020.

A person's Erdős–Bacon number is the sum of one's Erdős number—which measures the "collaborative distance" in authoring academic papers between that person and Hungarian mathematician Paul Erdős—and one's Bacon number—which represents the number of links, through roles in films, by which the person is separated from American actor Kevin Bacon. The lower the number, the closer a person is to Erdős and Bacon, which reflects a small world phenomenon in academia and entertainment.

In mathematics, the Burr–Erdős conjecture was a problem concerning the Ramsey number of sparse graphs. The conjecture is named after Stefan Burr and Paul Erdős, and is one of many conjectures named after Erdős; it states that the Ramsey number of graphs in any sparse family of graphs should grow linearly in the number of vertices of the graph.

Arthur Rubin American mathematician

Arthur Leonard Rubin is an American mathematician and aerospace engineer. He was named a Putnam Fellow on four consecutive occasions from 1970 to 1973.

Noga Alon Israeli mathematician

Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

Daniel Kleitman American mathematician

Daniel J. Kleitman is an American mathematician and professor of applied mathematics at MIT. His research interests include combinatorics, graph theory, genomics, and operations research.

Suresh P. Sethi American mathematician

Suresh P. Sethi is Eugene McDermott Chair Professor of Operations Management and Director of the Center for Intelligent Supply Networks (C4ISN) at The University of Texas at Dallas. He has contributed significantly in the fields of manufacturing and operations management, finance and economics, marketing, industrial engineering, operations research, and optimal control. He is well known for his developments of the Sethi advertising model and DNSS Points, and for his textbook on optimal control.

Andries Evert Brouwer is a Dutch mathematician and computer programmer, Professor Emeritus at Eindhoven University of Technology (TU/e). He is known as the creator of the greatly expanded 1984 to 1985 versions of the roguelike computer game Hack that formed the basis for NetHack. He is also a Linux kernel hacker. He is sometimes referred to by the handle aeb.

George Barry Purdy was a mathematician and computer scientist who specialized in cryptography, combinatorial geometry and number theory. Purdy received his Ph.D. from the University of Illinois at Urbana–Champaign in 1972, officially under the supervision of Paul T. Bateman, but his de facto adviser was Paul Erdős. He was on the faculty in the mathematics department at Texas A&M University for 11 years, and was appointed the Geier Professor of computer science at the University of Cincinnati in 1986.

Vitaly Bergelson

Vitaly Bergelson is a mathematical researcher and professor at Ohio State University in Columbus, Ohio. His research focuses on ergodic theory and combinatorics.

Stefan Burr American mathematician

Stefan Andrus Burr is a mathematician and computer scientist. He is a retired professor of Computer Science at The City College of New York.

Richard H. Schelp was an American mathematician.

Nets Hawk Katz is the IBM Professor of Mathematics at the California Institute of Technology. He was a professor of Mathematics at Indiana University Bloomington until March 2013.

James Maynard (mathematician) British mathematician

James Maynard is an English mathematician working in analytic number theory and in particular the theory of prime numbers. In 2017, he was appointed Research Professor at Oxford. Maynard is a fellow of St John's College, Oxford. He was awarded the Fields Medal in 2022.

References

  1. "Rousseau, Cecil Clyde". American Men & Women of Science. Thomson Gale. 2003. p. 349. ISBN   9780787665296.
  2. "Cecil Clyde Rousseau Jr. Obituary". Legacy.com Daily Memphian.
  3. "Media Room :: World's Highest Mathematics Honor Goes to Retired U of M Professor :: University of Memphis". Archived from the original on 2013-03-05. Retrieved 2013-03-10.
  4. Cecil C. Rousseau at the Mathematics Genealogy Project
  5. Grossman, Jerry, Erdos0p, Version 2015, The Erdős Number Project , Oakland University, USA, July 14, 2015.
  6. "Cecil C Rousseau".