|
List Of People By Erdős Number
Paul Erdős (1913–1996) was a Hungarian mathematician. He considered mathematics to be a social activity and often collaborated on his papers, having 511 joint authors, many of whom also have their own collaborators. The Erdős number measures the "collaborative distance" between an author and Erdős. Thus, his direct co-authors have Erdős number one, theirs have number two, and so forth. Erdős himself has Erdős number zero. There are more than 11,000 people with an Erdős number of two. This is a partial list of authors with an Erdős number of three or less. For more complete listings of Erdős numbers, see the databases maintained by the Erdős Number Project or the collaboration distance calculators maintained by the American Mathematical Society and by zbMATH. Zero * Paul Erdős One A * János Aczél * Ron Aharoni * Martin Aigner * Miklós Ajtai * Leonidas Alaoglu * Yousef Alavi * Krishnaswami Alladi * Noga Alon * Nesmith Ankeny * Joseph Arkin * Boris Ar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
László Babai
László "Laci" Babai (born July 20, 1950, in Budapest) a fellow of the American Academy of Arts and Sciences, and won the Knuth Prize. Babai was an invited speaker at the International Congresses of Mathematicians in Kyoto (1990), Zürich (1994, plenary talk), and Rio de Janeiro Rio de Janeiro ( , , ; literally 'River of January'), or simply Rio, is the capital of the state of the same name, Brazil's third-most populous state, and the second-most populous city in Brazil, after São Paulo. Listed by the GaWC as a b ... (2018). Sources Professor László Babai's algorithm is next big step in conquering isomorphism in graphs// Published on Nov 20, 2015 Division of the Physical Sciences / The University of Chicago Mathematician claims breakthrough in complexity theory by Adrian Cho 10 November 2015 17:45 // Posted iMath Science AAAS News A Quasipolynomial Time Algorithm for Graph Isomorphism: The Details+ Background on Graph Isomorphism + The Main Result // Math ∩ P ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Brillhart
John David Brillhart (November 13, 1930 – May 21, 2022) was a mathematician who worked in number theory at the University of Arizona. Early life and education Brillhart was born on November 13, 1930 in Berkeley, California. He studied at the University of California, Berkeley, where he received his A.B. in 1953, his M.A. in 1966, and his Ph.D. in 1967. His doctoral thesis in mathematics was supervised by D. H. Lehmer, with assistance from Leonard Carlitz. Before becoming a mathematician, he served in the United States Army. Career Brillhart joined the faculty at the University of Arizona in 1967 and retired in 2001. He advised two Ph.D. students. Research Brillart worked in integer factorization. His joint work with Michael A. Morrison in 1975 describes how to implement the continued fraction factorization method originally developed by Lehmer and Ralph Ernest Powers in 1931. One consequence was the first factorization of the Fermat number F^7 = 2^+1. Their ideas were influe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joel Lee Brenner
Joel Lee Brenner ( – ) was an American mathematician who specialized in matrix theory, linear algebra, and group theory. He is known as the translator of several popular Russian texts. He was a teaching professor at some dozen colleges and universities and was a Senior Mathematician at Stanford Research Institute from 1956 to 1968. He published over one hundred scholarly papers, 35 with coauthors, and wrote book reviews.LeRoy B. Beasley (1987) "The Mathematical Work of Joel Lee Brenner", Linear Algebra and its Applications 90:1–13 Academic career In 1930 Brenner earned a B.A. degree with major in chemistry from Harvard University. In graduate study there he was influenced by Hans Brinkmann, Garrett Birkhoff, and Marshall Stone. He was granted the Ph.D. in February 1936. Brenner later described some of his reminiscences of his student days at Harvard and of the state of American mathematics in the 1930s in an article for American Mathematical Monthly. In 1951 Brenner publis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Adrian Bondy
John Adrian Bondy (born 1944 in London) is a retired English mathematician, known for his work in combinatorics and graph theory. Career Bondy received his Ph.D. in graph theory from the University of Oxford in 1969. His advisor was Dominic Welsh. Between 1969 and 1994, Bondy was ''Professor of Graph Theory'' at the University of Waterloo in Canada, and then, until his retirement, at Université Lyon 1 in France. From 1976, he was managing editor, and, between 1979 and 2004, co-editor-in-chief (together with U. S. R. Murty) of Journal of Combinatorial Theory, Series B. Throughout his career, Bondy has (co-)authored over 100 publications with 51 co-authors, including the widely influential textbook ''Graph Theory with Applications'' (with U. S. R. Murty), and supervised 12 Ph.D. students. His Erdős number is 1. Bondy was dismissed from his tenured position at the University of Waterloo in 1995, after 25 years in which he had been a major contributor to the renown of the Un ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Béla Bollobás
Béla Bollobás FRS (born 3 August 1943) 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. Early life and education As a student, he took part in the first three International Mathematical Olympiads, winning two gold medals. Paul Erdős invited Bollobás to lunch after hearing about his victories, and they kept in touch afterward. Bollobás' first publication was a joint publication with ErdősBollobás, Béla; Erdös, Paul , Über graphentheoretische Extremalprobleme. (Extremal problems in graph theory.) , Mat. Lapok 13, 143-152 (1962) on extremal problems in graph theory, written when he was in high school in 1962. With Erdős's recommendation to Harold Davenport and a long struggle for permission from the Hungarian authorities, Bollobás was able to spend an undergraduate year in Cambridge, England ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ralph P
Ralph (pronounced ; or ,) is a male given name of English, Scottish and Irish origin, derived from the Old English ''Rædwulf'' and Radulf, cognate with the Old Norse ''Raðulfr'' (''rað'' "counsel" and ''ulfr'' "wolf"). The most common forms are: * Ralph, the common variant form in English language, English, which takes either of the given pronunciations. * Rafe (name), Rafe, variant form which is less common; this spelling is always pronounced , as are all other English spellings without "l". * Raife, a very rare variant. * Raif, a very rare variant. Raif Rackstraw from H.M.S. Pinafore * Ralf, the traditional variant form in Dutch language, Dutch, German language, German, Swedish language, Swedish, and Polish language, Polish. * Ralfs (given name), Ralfs, the traditional variant form in Latvian language, Latvian. * Raoul (other), Raoul, the traditional variant form in French language, French. * Raúl, the traditional variant form in Spanish language, Spanish. * Raul, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andreas Blass
Andreas Raphael Blass (born October 27, 1947) is a mathematician, currently a professor at the University of Michigan. He works in mathematical logic, particularly set theory, and theoretical computer science. Blass graduated from the University of Detroit, where he was a Putnam Fellow in 1965, in 1966 with a B.S. in physics. He received his Ph.D. in 1970 from Harvard University, with a thesis on ''Orderings of Ultrafilters'' written under the supervision of Frank Wattenberg. Since 1970 he has been employed by the University of Michigan, first as a ''T.H. Hildebrandt Research Instructor'' (1970–72), then assistant professor (1972–76), associate professor (1976–84) and since 1984 he has been a full professor there. In 2014, he became a Fellow of the American Mathematical Society. Selected publications and results In 1984 Blass proved that the existence of a basis for every vector space is equivalent to the axiom of choice. He made important contributions in the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vitaly Bergelson
Vitaly Bergelson (born 1950 in Kiev) is a mathematical researcher and professor at Ohio State University in Columbus, Ohio. His research focuses on ergodic theory and combinatorics. Bergelson received his Ph.D in 1984 under Hillel Furstenberg at the Hebrew University of Jerusalem. He gave an invited address at the International Congress of Mathematicians in 2006 in Madrid. Among Bergelson's best known results is a polynomial generalization of Szemerédi's theorem. The latter provided a positive solution to the famous Erdős–Turán conjecture from 1936 stating that any set of integers of positive upper density contains arbitrarily long arithmetic progressions. In a 1996 paper Bergelson and Leibman obtained an analogous statement for "polynomial progressions". The Bergelson-Leibman theoremAlexander Soifer, Branko Grünbaum, and Cecil RousseauMathematical Coloring Book: Mathematics of Coloring and the Colorful Life of Its Creators. Springer-Verlag, New York, 2008, ; p. 358 an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Bellman
Richard Ernest Bellman (August 26, 1920 – March 19, 1984) was an American applied mathematician, who introduced dynamic programming in 1953, and made important contributions in other fields of mathematics, such as biomathematics. He founded the leading biomathematical journal Mathematical Biosciences. Biography Bellman was born in 1920 in New York City to non-practising Jewish parents of Polish and Russian descent, Pearl (née Saffian) and John James Bellman, who ran a small grocery store on Bergen Street near Prospect Park, Brooklyn. On his religious views, he was an atheist. He attended Abraham Lincoln High School, Brooklyn in 1937,Salvador SanabriaRichard Bellman profile at http://www-math.cudenver.edu retrieved October 3, 2008. and studied mathematics at Brooklyn College where he earned a BA in 1941. He later earned an MA from the University of Wisconsin. During World War II he worked for a Theoretical Physics Division group in Los Alamos. In 1946 he received h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mehdi Behzad
Mehdi Behzad (Persian:مهدی بهزاد; born April 22, 1936) is an Iranian mathematician specializing in graph theory. He introduced his total coloring theory (also known as "Behzad's conjecture" or "the total chromatic number conjecture") during his Ph.D. studies in 1965. Despite the active work during the last 50 years this conjecture remains as challenging as it is open. In fact, Behzad's conjecture now belongs to mathematics’ classic open problems. Behzad has been instrumental in institutionalizing mathematics education and popularization of mathematics in Iran, and has received numerous awards and recognition for his lifetime service to the Iranian scientific community. Graph theory Behzad is the coauthor of two text books on graph theory published in 1972 and 1979 in the U.S., which were among the key references on this new field of mathematics. He has been one of the direct collaborators of Paul Erdős. Professorship Behzad was the first faculty member of Sharif Un ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
James Earl Baumgartner
James Earl Baumgartner (March 23, 1943 – December 28, 2011) was an American mathematician who worked in set theory, mathematical logic and foundations, and topology. Baumgartner was born in Wichita, Kansas, began his undergraduate study at the California Institute of Technology in 1960, then transferred to the University of California, Berkeley, from which he received his PhD in 1970 from for a dissertation entitled ''Results and Independence Proofs in Combinatorial Set Theory''. His advisor was Robert Vaught. He became a professor at Dartmouth College in 1969, and spent his entire career there. One of Baumgartner's results is the consistency of the statement that any two \aleph_1-dense sets of reals are order isomorphic (a set of reals is \aleph_1-dense if it has exactly \aleph_1 points in every open interval). With András Hajnal he proved the Baumgartner–Hajnal theorem, which states that the partition relation \omega_1\to(\alpha)^2_n holds for \alpha<\omega_1 and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
