Jump to content

Stefan Burr

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by JoeNMLC (talk | contribs) at 14:46, 14 November 2024 (rm stub; Wikipedia:Database reports/Long stubs; Wikipedia:WikiProject Stub improvement; you can help!). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Stefan Burr
Burr in 2015
Born
Stefan Andrus Burr

1940 (age 83–84)[2]
Alma materUniversity of California, Berkeley (A.B., Mathematics)
Princeton University (M.A.; Ph.D. Mathematics, 1969)
Known forRamsey Theory
Number theory
Scientific career
FieldsMathematics and Computer Science
InstitutionsThe City College of New York
AT&T Long Lines
Doctoral advisorBernard Morris Dwork[1]

Stefan Andrus Burr (born 1940) is a mathematician and computer scientist, specializing in graph theory and number theory, particularly Ramsey theory. He is a retired professor of Computer Science at The City College of New York.

Career

[edit]

He did his undergraduate studies at University of California, Berkeley, graduating with a Bachelor of Arts in Mathematics with Highest Honors in 1961 June.[3] He was a member of their team for the William Lowell Putnam Mathematical Competition on 1958 November 22, where the team received an honorable mention;[4] 1959 November 21, where he individually received an honorable mention;[5] and 1960 December 3, where the team won first prize and he additionally received an honorable mention.[6] As a member of the class of 1961, he received the Dorothea Klumpke Roberts Prize in Mathematics in 1960.[7] As a student there, he joined the Mathematical Association of America in 1960 April/May.[8]

He graduated from Princeton University with a Master of Arts in 1963[9] and a PhD in 1968,[10][11] both in Mathematics. His PhD thesis, An Elementary Solution of the Waring-Goldbach Problem (1968 or 1969)[12] was advised by Bernard Morris Dwork.[1]

While working on his PhD at Princeton, he had a job as a Scientific Programmer for Lockheed MSC (c. 1965).[13][14] Afterwards, starting c. 1966, he had a job as a member of the technical staff at Bell Telephone Laboratories,[15][16][17][18] then moved to American Telephone & Telegraph (AT&T) Long Lines c. 1975, where he worked as a Staff Supervisor until c. 1978.[14][18][19][20]

Afterwards, c. 1979, he became a member of the faculty of City College, part of the City University of New York (CUNY) system, in the Department of Computer Science (and perhaps briefly in the Department of Mathematics[21]).[14][22][23] In 1982, he spent 3 months from May to August visiting the University of Coimbra in Portugal as a Fulbright Scholar, where he lectured and researched computer science.[24][25][26][27] He may have spent some time at Lehman College c. 1996 – c. 1998.[28][29] He retired after teaching in the Fall 2006 semester.[30][31][32]

He became Mathematics Vice-Chair of the New York Academy of Sciences in January 1988,[33][34] became Mathematics Chair in 1990,[35][36] and retired from the position in June 1992.[37][38] He became a Managing Editor of the Journal of Graph Theory in 1991,[39][40] and retired from the position c. 1997.[41][42]

Many of his publications involve problems from the field of Ramsey theory. He has published 27 papers with Paul Erdős.[43] The Burr–Erdős conjecture, published as a conjecture by Burr and Erdős in 1975, solved only in 2015, states that sparse graphs have linearly growing Ramsey numbers.

Selected publications

[edit]

References

[edit]
  1. ^ a b "Stefan Andrus Burr". Mathematics Genealogy Project. Fargo, North Dakota: Department of Mathematics, North Dakota State University. Archived from the original on July 1, 2020. Retrieved June 22, 2024.
  2. ^ "Burr, Stefan A. (Stefan Andrus), 1940-". Library of Congress Authorities. 1982. LCCN n-82135906. Retrieved June 30, 2024.
  3. ^ "Certificates, Degrees, and Honors, June 10, 1961: Honors with Degrees: Honors with the Bachelor's Degree: In the College of Letters and Science: Mathematics: Highest Honors". Commencement. 98. California Memorial Stadium, Berkeley: University of California: 135. June 10, 1961. hdl:2027/coo.31924065367298 – via HathiTrust.
  4. ^ Bush, L. E. (August–September 1959). "The William Lowell Putnam Mathematical Competition". The American Mathematical Monthly. 66 (7). Mathematical Association of America: 570–572. doi:10.1080/00029890.1959.11989352. ISSN 0002-9890. JSTOR 2309855 – via Internet Archive.
  5. ^ Bush, L. E. (June–July 1960). "The William Lowell Putnam Mathematical Competition". The American Mathematical Monthly. 67 (6): 559–561. doi:10.1080/00029890.1960.11989546. ISSN 0002-9890. JSTOR 2309174 – via Internet Archive.
  6. ^ Bush, L. E. (August–September 1961). "The 1960 William Lowell Putnam Mathematical Competition". The American Mathematical Monthly. 68 (7): 629–637. doi:10.2307/2311508. ISSN 0002-9890. JSTOR 2311508 – via Internet Archive.
  7. ^ "Prizes: Dorothea Klumpke Roberts Prize in Mathematics". Commencement. 97. California Memorial Stadium, Berkeley: University of California: 146. June 11, 1960. hdl:2027/uc1.31378008233556 – via HathiTrust.
  8. ^ "Official Reports and Communications: New Members". The American Mathematical Monthly. 67 (5): 493–497. May 1960. doi:10.1080/00029890.1960.11989534. JSTOR 2309334 – via Internet Archive.
  9. ^ "Masters of Arts". Commencement. Princeton University: 23?. 1964 [Approved by the Board of Trustees October 25, 1963] – via Google Books.
  10. ^ "Burr, Stefan Andrus, 1968". Princeton University Graduate Alumni Index, 1839-1998. Mudd Databases. The Department of Special Collections, Princeton University Library. Archived from the original on June 22, 2024. Retrieved June 22, 2024.
  11. ^ Durgin, Lynn, ed. (2018). "Burr, Stefan Andrus, 1968". Graduate Alumni Records, 1960-1989. Finding Aids. Princeton University Archives, Department of Special Collections, Princeton University Library. AC105-04. Retrieved June 22, 2024.
  12. ^ Burr, Stefan Andrus (1968). An elementary solution of the Waring-Goldbach problem (Ph.D. thesis). Princeton University. ISBN 9781085008488. MR 2617568. OCLC 39118789. ProQuest 302326486. DAI-B PRIN 29/088/2967 , 69-2530.
  13. ^ "Individual Members: Alphabetical Listing: Burr, Stefan A." Combined Membership List of the American Mathematical Society and the Mathematical Association of America. 1965–1966: 70. October 1, 1965 – via Google Books.
  14. ^ a b c Forbes, Donald (October 1988). "Desktop Publishing". Jersey Atari Computer Group (JACG) Newsletter. 8 (8). Pine Brook, New Jersey: [5] – via Internet Archive.
  15. ^ "Individual Members: Alphabetical Listing: Burr, Stefan A." Combined Membership List of the American Mathematical Society and the Mathematical Association of America. 1966–1967: 218. October 1, 1966 – via Google Books.
  16. ^ "Individual Members: Alphabetical Listing: Burr, Stefan A." Combined Membership List of the American Mathematical Society and the Mathematical Association of America. 1967–1968: 26. May 1, 1967 – via Google Books.
  17. ^ Burr, Stefan A. (August 18–23, 1969). Atkin, Oliver; Birch, Bryan John (eds.). A Class of Theorems in Additive Number Theory which Lend Themselves to Computer Proof. Computers in Number Theory conference. Science Research Council Atlas Symposium. Vol. 2. Oxford (published 1971). p. 283 – via Google Books. List of speakers, etc.: "Chilton::ACL::Computer Algebra". Chilton Computing. Chilton Computing and UKRI Science and Technology Facilities Council. July 20, 2022. Archived from the original on January 19, 2024. Retrieved June 23, 2024.
  18. ^ a b Burr, S. A.; Erdős, P.; Spencer, J. H. (August 1975). "Ramsey theorems for multiple copies of graphs". Transactions of the American Mathematical Society. 209: 87–99. doi:10.1090/S0002-9947-1975-0409255-0. ISSN 0002-9947. JSTOR 1997371. MR 0409255.
  19. ^ "Individual Members: Alphabetical Listing: Burr, Stefan Andrus". Combined Membership List of the American Mathematical Society and the Mathematical Association of America. 1975–1976: 17. July 10, 1975 – via Google Books.
  20. ^ "Individual Members: Alphabetical Listing: Burr, Stefan Andrus". Combined Membership List of the American Mathematical Society and the Mathematical Association of America. 1978–1979: 18. July 10, 1978. ISBN 978-0-8218-0068-3 – via Google Books.
  21. ^ Burr, Stefan A. (June 20, 1979). "A Survey of Noncomplete Ramsey Theory for Graphs". In Frank, Harary (ed.). Topics in Graph Theory. Annals of the New York Academy of Sciences. Vol. 328. New York Academy of Sciences. pp. 58–75. doi:10.1111/j.1749-6632.1979.tb17768.x. ISBN 978-0-89766-028-0. ISSN 0077-8923 – via Internet Archive.
  22. ^ Burr, Stefan (May 1979). Capobianco, M.; Maurer, S.; McCarthy, D.; Molluzzo, J. (eds.). "A COLLECTION OF OPEN PROBLEMS: 19. Existence of Uniquely Non-Ramsey Graphs; 26. Binary Rank of Adjacency Matrices". Annals of the New York Academy of Sciences. 319 (1): 580, 584. doi:10.1111/j.1749-6632.1979.tb32837.x. ISSN 0077-8923 – via Wiley Online Library.
  23. ^ "Individual Members: Alphabetical Listing: Burr, Stefan Andrus". Combined Membership List of the American Mathematical Society and the Mathematical Association of America. 1979–1980: 19. July 10, 1979. ISBN 978-0-8218-0069-0 – via Google Books.
  24. ^ "Stefan Burr". Fulbright Scholar Program. Bureau of Educational and Cultural Affairs Exchange Programs, U.S. Department of State. Archived from the original on May 27, 2024. Retrieved June 23, 2024.
  25. ^ "Arquivo da Comissão Cultural Luso-Americana - Comissão Fulbright: Processos de bolsas de professores e investigadores americanos: American scholars Bro-Cap: Stefan Andrus Burr". Arquivo de Ciência e a Tecnologia (in Portuguese). Fundação para a Ciência e a Tecnologia. 1982. Código de referência: PT/FULB/FULB/024/0003/626; Localização física: PT/FCT/ACT-ÁREA A/24/01/3; Cota descritiva: A.24.01.3; Cota original: FULB021/626. Archived from the original on June 20, 2016. Retrieved June 23, 2024.
  26. ^ "Fulbright Awards for 1982-1983". Notices of the American Mathematical Society. 30 (4): 395. June 1983 – via Google Books.
  27. ^ "Scholars by Academic Field: Computer Science" (PDF). Directory of University Lecturing & Advanced Research Abroad. 1982–1983. Affiliated with the American Council on Education: 36. October 1982.
  28. ^ Burr, S. A.; Erdős, P.; Graham, R. L.; Li, W. Wen-Ching (1996). "Complete sequences of sets of integer powers". Acta Arithmetica. 77 (2): 133–138. doi:10.4064/aa-77-2-133-138. ISSN 0065-1036. 2738. Archived (PDF) from the original on June 23, 2024 – via Instytut Matematyczny Polskiej Akademii Nauk.
  29. ^ "Burr, Stefan Andrus". World Directory of Mathematicians. 11. International Mathematical Union; American Mathematical Society: 106. 1998 – via Google Books.
  30. ^ "Faculty". CCNY: Department of Computer Science. Archived from the original on September 8, 2006 – via Internet Archive's Wayback Machine.{{cite web}}: CS1 maint: unfit URL (link)
  31. ^ "Faculty". CCNY: Department of Computer Science. Archived from the original on October 22, 2007 – via Internet Archive's Wayback Machine.{{cite web}}: CS1 maint: unfit URL (link)
  32. ^ Burr, Stefan (Fall 2006). "Professor Stefan Burr". Computer Science at City College of New York. Archived from the original on June 15, 2010.
  33. ^ "The New York Academy of Sciences: An International Organization: Section Chairs and Vice-Chairs [located within 'Letters from Readers']". The Sciences. 27 (6). The New York Academy of Sciences: 14. November–December 1987. doi:10.1002/j.2326-1951.1987.tb02977.x. ISSN 0036-861X – via Wiley Online Library.
  34. ^ "The New York Academy of Sciences: An International Organization: Section Chairs and Vice-Chairs [located within 'Letters from Readers']". The Sciences. 28 (1). The New York Academy of Sciences: 14. January–February 1988. doi:10.1002/j.2326-1951.1988.tb02990.x. ISSN 0036-861X – via Wiley Online Library.
  35. ^ "The New York Academy of Sciences: Section Chairs and Vice-Chairs [located within 'Peer Review: Letters from Readers']". The Sciences. 30 (2). The New York Academy of Sciences: 12. March–April 1990. doi:10.1002/j.2326-1951.1990.tb02210.x. ISSN 0036-861X – via Wiley Online Library.
  36. ^ "The New York Academy of Sciences: Section Chairs and Vice-Chairs [located within 'Peer Review: Letters from Readers']". The Sciences. 30 (4). The New York Academy of Sciences: 10. July–August 1990. doi:10.1002/j.2326-1951.1990.tb02234.x. ISSN 0036-861X – via Wiley Online Library.
  37. ^ "The New York Academy of Sciences: Section Chairs and Vice-Chairs [located alongside 'Initial Conditions: Editor's Notebook']". The Sciences. 32 (3). The New York Academy of Sciences: 2. May–June 1992. doi:10.1002/j.2326-1951.1992.tb02381.x. ISSN 0036-861X – via Wiley Online Library.
  38. ^ "The New York Academy of Sciences: Section Chairs and Vice-Chairs [located alongside 'Initial Conditions: Editor's Notebook']". The Sciences. 32 (4). The New York Academy of Sciences: 2. July–August 1992. doi:10.1002/j.2326-1951.1992.tb02395.x. ISSN 0036-861X – via Wiley Online Library.
  39. ^ "[Masthead]". Journal of Graph Theory. 14 (6). Morristown, NJ. December 1990. doi:10.1002/jgt.3190140601. ISSN 0364-9024 – via Wiley Online Library.
  40. ^ "[Masthead]". Journal of Graph Theory. 15 (1). Morristown, NJ. March 1991. doi:10.1002/jgt.3190150101. ISSN 0364-9024 – via Wiley Online Library.
  41. ^ "[Masthead]". Journal of Graph Theory. 23 (4): fmi. December 1996. doi:10.1002/1097-0118(199612)23:4<::AID-JGT3190230401>3.0.CO;2-7 – via Wiley Online Library.
  42. ^ "Journal of Graph Theory: Editorial Board". Wiley InterScience. John Wiley & Sons, Inc. Archived from the original on January 17, 1998.{{cite web}}: CS1 maint: unfit URL (link)
  43. ^ "Paul Erdős' papers". Alfréd Rényi Institute of Mathematics. Retrieved October 25, 2022.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Stefan_Burr&oldid=1257361543"