Norman Levinson
Norman Levinson | |
---|---|
Born | Lynn, Massachusetts |
11 August 1912
Died | Script error: The function "death_date_and_age" does not exist. Boston |
Residence | USA |
Nationality | American |
Fields | Mathematics |
Alma mater | MIT |
Known for | Levinson recursion Levinson's inequality |
Notable awards | Bôcher Memorial Prize (1953) Chauvenet Prize (1971) |
Norman Levinson (August 11, 1912 in Lynn, Massachusetts – October 10, 1975 in Boston) was an American mathematician. Some of his major contributions were in the study of Fourier transforms, complex analysis, non-linear differential equations, number theory, and signal processing. He worked closely with Norbert Wiener in his early career. He joined the faculty of the Massachusetts Institute of Technology in 1937. In 1954, he was awarded the Bôcher Memorial Prize of the American Mathematical Society and in 1971 the Chauvenet Prize (after winning in 1970 the Lester R. Ford Award) of the Mathematical Association of America for his paper A Motivated Account of an Elementary Proof of the Prime Number Theorem.[1] In 1974 he published a paper proving that more than a third of the zeros of the Riemann zeta function lie on the critical line, a result later improved to two fifths by Conrey.
He received both his bachelor's degree and his master's degree in electrical engineering from MIT in 1934, where he had studied under Norbert Wiener and took almost all of the graduate-level courses in mathematics. He received the MIT Redfield Proctor Traveling Fellowship to study at the University of Cambridge, with the assurance that MIT would reward him with a PhD upon his return regardless of whatever he produced at Cambridge. Within the first four months in Cambridge, he had already produced two papers. In 1935, MIT awarded him with the PhD in mathematics.
His death in 1975 was caused by a brain tumor. He was married since 1938; his widow Zipporah died at age 93 in 2009, survived by two daughters and four grandchildren. Norman Levinson's doctoral students include Raymond Redheffer and Harold Shapiro.[2]
See also
Publications
- Lua error in package.lua at line 80: module 'strict' not found.[3]
- Lua error in package.lua at line 80: module 'strict' not found.[4]
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
References
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Norman Levinson at the Mathematics Genealogy Project
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
External links
- Lua error in package.lua at line 80: module 'strict' not found..
Lua error in package.lua at line 80: module 'strict' not found.