Stefan Burr
Encyclopedia
Stefan Andrus Burr is a mathematician
and computer scientist
. He is currently a professor of computer science at The City College of New York.
Burr received his Ph.D. in 1969 from Princeton University
under the supervision of Bernard Dwork
; his thesis research involved the Waring–Goldbach problem
in number theory
, which concerns the representations of integers as sums of powers of prime number
s.
Many of his subsequent publications involve problems from the field of Ramsey theory
. He has published 27 papers with Paul Erdős
. The Erdős–Burr conjecture
, published as a conjecture by Erdős and Burr in 1975 and still unsolved, states that sparse graphs have linear Ramsey numbers.
Mathematician
A mathematician is a person whose primary area of study is the field of mathematics. Mathematicians are concerned with quantity, structure, space, and change....
and computer scientist
Computer scientist
A computer scientist is a scientist who has acquired knowledge of computer science, the study of the theoretical foundations of information and computation and their application in computer systems....
. He is currently a professor of computer science at The City College of New York.
Burr received his Ph.D. in 1969 from Princeton University
Princeton University
Princeton University is a private research university located in Princeton, New Jersey, United States. The school is one of the eight universities of the Ivy League, and is one of the nine Colonial Colleges founded before the American Revolution....
under the supervision of Bernard Dwork
Bernard Dwork
Bernard Morris Dwork was an American mathematician, known for his application of p-adic analysis to local zeta functions, and in particular for the first general results on the Weil conjectures. Together with Kenkichi Iwasawa he received the Cole Prize in 1962.Dwork received his Ph.D. at Columbia...
; his thesis research involved the Waring–Goldbach problem
Waring–Goldbach problem
The Waring–Goldbach problem is a problem in additive number theory, concerning the representation of integers as sums of powers of prime numbers. It is named as a combination of Waring's problem on sums of powers of integers, and the Goldbach conjecture on sums of primes...
in number theory
Number theory
Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers as well...
, which concerns the representations of integers as sums of powers of prime number
Prime number
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number. For example 5 is prime, as only 1 and 5 divide it, whereas 6 is composite, since it has the divisors 2...
s.
Many of his subsequent publications involve problems from the field of Ramsey theory
Ramsey theory
Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of mathematics that studies the conditions under which order must appear...
. He has published 27 papers with Paul Erdős
Paul Erdos
Paul Erdős was a Hungarian mathematician. Erdős published more papers than any other mathematician in history, working with hundreds of collaborators. He worked on problems in combinatorics, graph theory, number theory, classical analysis, approximation theory, set theory, and probability theory...
. The Erdős–Burr conjecture
Erdos–Burr conjecture
In mathematics, the Erdős–Burr conjecture is an unsolved problem concerning the Ramsey number of sparse graphs. The conjecture is named after Paul Erdős and Stefan Burr, and is one of many conjectures named after Erdős; it states that the Ramsey number of graphs in any sparse family of graphs...
, published as a conjecture by Erdős and Burr in 1975 and still unsolved, states that sparse graphs have linear Ramsey numbers.
External links
- Burr's home page.