Related Research Articles
George Pólya was a Hungarian-American mathematician. He was a professor of mathematics from 1914 to 1940 at ETH Zürich and from 1940 to 1953 at Stanford University. He made fundamental contributions to combinatorics, number theory, numerical analysis and probability theory. He is also noted for his work in heuristics and mathematics education. He has been described as one of The Martians, an informal category which included one of his most famous students at ETH Zurich, John von Neumann.
In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured that every set of integers A with positive natural density contains a k-term arithmetic progression for every k. Endre Szemerédi proved the conjecture in 1975.
Endre Szemerédi is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science at Rutgers University since 1986. He also holds a professor emeritus status at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.
Michael Artin is an American mathematician and a professor emeritus in the Massachusetts Institute of Technology Mathematics Department, known for his contributions to algebraic geometry.
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.
The Society for Industrial and Applied Mathematics (SIAM) has three prizes named after George Pólya: the George Pólya Prize for Mathematical Exposition, established in 2013; the George Pólya Prize in Applied Combinatorics, established in 1969, and first awarded in 1971; and the George Pólya Prize in Mathematics, established in 1992, to complement the exposition and applied combinatorics prizes.
Nicholas John Higham FRS was a British numerical analyst. He was Royal Society Research Professor and Richardson Professor of Applied Mathematics in the Department of Mathematics at the University of Manchester.
Van H. Vu is a Vietnamese mathematician and the Percey F. Smith Professor of Mathematics at Yale University.
Enrique Zuazua is the Head of the Chair for Dynamics, Control, Machine Learning and Numerics - FAU DCN-AvH at the University of Erlangen–Nuremberg (FAU). He is also Distinguished Research Professor and the Director of the Chair of Computational Mathematics of DeustoTech Research Center of the University of Deusto in Bilbao, Basque Country, Spain and Professor of Applied Mathematics at Universidad Autónoma de Madrid (UAM).
Vojtěch Rödl is a Czech American mathematician, Samuel Candler Dobbs Professor at Emory University. He is noted for his contributions mainly to combinatorics having authored hundreds of research papers.
Alfred Washington Hales is an American mathematician, a professor emeritus of mathematics at the University of California, Los Angeles, and one of the namesakes of the Hales–Jewett theorem. He was born in Pasadena, California, and is the older brother of R. Stanton Hales.
Adam Wade Marcus is an American mathematician. He held the Chair of Combinatorial Analysis in the Institute of Mathematics at the École Polytechnique Fédérale de Lausanne until February 2023. The team of Marcus, Daniel Spielman and Nikhil Srivastava was awarded the Pólya Prize in 2014 for their resolution of the Kadison–Singer problem and later the Michael and Sheila Held Prize in 2021 for their solution to long-standing conjectures in the study of Ramanujan graphs.
Deryk Osthus is the Professor of Graph Theory at the School of Mathematics, University of Birmingham. He is known for his research in combinatorics, predominantly in extremal and probabilistic graph theory.
Wojciech Samotij is a Polish mathematician and a full professor at the School of Mathematical Sciences at the Tel Aviv University. He is known for his work in combinatorics, additive number theory, Ramsey theory and graph theory.
Martin Grötschel is a German mathematician known for his research on combinatorial optimization, polyhedral combinatorics, and operations research. From 1991 to 2012 he was Vice President of the Zuse Institute Berlin (ZIB) and served from 2012 to 2015 as ZIB's President. From 2015 to 2020 he was President of the Berlin-Brandenburg Academy of Sciences and Humanities (BBAW).
Albert Pfluger was a Swiss mathematician, specializing in complex function theory.
William G. Brown is a Canadian mathematician specializing in graph theory. He is a professor emeritus of mathematics at McGill University.
In graph theory, the hypergraph removal lemma states that when a hypergraph contains few copies of a given sub-hypergraph, then all of the copies can be eliminated by removing a small number of hyperedges. It is a generalization of the graph removal lemma. The special case in which the graph is a tetrahedron is known as the tetrahedron removal lemma. It was first proved by Nagle, Rödl, Schacht and Skokan and, independently, by Gowers.
József Balogh is a Hungarian-American mathematician, specializing in graph theory and combinatorics.
Alex Pothen is an Indian-born American computer scientist and applied mathematician who is a professor at Purdue University. His research primarily focuses on combinatorial scientific computing (CSC), graph algorithms, parallel computing, and bioinformatics algorithms.
References
- 1 2 3 4 Curriculum vitae: Mathias Schacht , retrieved 2015-09-30.
- ↑ Mathias Schacht at the Mathematics Genealogy Project
- ↑ Vojtech Rodl and Mathias Schacht honored by SIAM with George Polya Prize, Society for Industrial and Applied Mathematics, August 14, 2012, retrieved 2015-09-30.
| International | |
|---|---|
| National | |
| Academics | |
