Jeffrey B. Remmel
Jeffrey B. Remmel | |
|---|---|
| Born | October 12, 1948 |
| Died | September 2, 2017 (aged 68) |
| Title | Distinguished Professor of Mathematics |
| Academic background | |
| Education | |
| Thesis | Co-recursively Enumerable Structures (1974) |
| Doctoral advisor | Anil Nerode |
| Academic work | |
| Discipline | Mathematician |
| Sub-discipline | |
| Institutions | UC San Diego |
Jeffrey Brian Remmel (October 12, 1948 – September 29, 2017) was an American mathematician employed by the University of California, San Diego.[1] At the time of his death he held a distinguished professorship—his title was Distinguished Professor of Mathematics;[2] he also held a position as a professor of computer science.[3]
Personal life
[edit]Remmel was born on October 12, 1948, in Clintonville, Wisconsin.[4] He died aged 68 at Scripps Memorial Hospital in La Jolla, California on September 2, 2017,[1] with a reported cause of death being a heart attack.[5]
Education
[edit]Remmel received a Bachelor of Arts degree in mathematics from Swarthmore College in 1970. Later, he received two degrees from Cornell University—a Master of Science in mathematics and a Doctor of Philosophy, also in math (1972 and 1974, respectively).[3] At Cornell, he was advised by Anil Nerode, and his dissertation was entitled Co-recursively Enumerable Structures.[6]
Career
[edit]After obtaining his Ph.D.,[a] though before he had published a single paper,[4] Remmel joined the faculty of the University of California, San Diego as an assistant professor, where he worked for his entire career.[2] Remmel was noted for his successful publication record in two separate fields—logic, in which he published in mathematical logic; and combinatorics, where he published papers on algebraic combinatorics.[6] He published over 20 papers in logic with Victor W. Marek,[7] and Remmel's more prominent career in combinatorics included over 20 co-authored papers with Sergey Kitaev.[4] A double issue of the Journal of Combinatorics[b] was published in his memory.[8]
Remmel's work is highly cited in the fields of vector spaces, including computably enumerable sets and vector spaces.[c]
References
[edit]- ^ a b Robbins, Gary (October 6, 2017). "Renowned UC San Diego mathematician Jeff Remmel dies unexpectedly". San Diego Union-Tribune. Retrieved January 11, 2024. Republished in the Chicago Tribune.
- ^ a b Boggs, Steven; Ni, Lei. "Jeffrey B. Remmel". Academic Senate. University of California. Retrieved January 11, 2024. Also published as a memorial by UC San Diego.
- ^ a b "Jeff Remmel's Home Page". UC San Diego. Retrieved January 12, 2024.
- ^ a b c d Kitaev, Sergey; Mendes, Anthony (February 19, 2021). "The Combinatorics of Jeff Remmel". Enumerative Combinatorics and Applications. 1 (2) S1H2. arXiv:2102.07269. QID 124254336.
- ^ Ni, Lei; Buss, Sam (September 30, 2017). "[FOM] Sad news, Jeff Remmel". Retrieved January 13, 2024.
- ^ a b "Notices". The Bulletin of Symbolic Logic. 23 (4): 540–545. December 2017. doi:10.1017/bsl.2017.40. ISSN 1079-8986. JSTOR 26409199. Also appears in Association for Symbolic Logic November 2017 newsletter.
- ^ Marek, Victor W. "Comments on Logic and Knowledge Representation" (PDF).
- ^ Loehr, Nicholas A. (2019). "Foreword: Special Issue In Memory of Jeff Remmel" (PDF). Journal of Combinatorics. 10 (2): 409–410.
Notes
[edit]- ^ One source attests that he had not officially completed his Ph.D. upon joining UC San Diego.[4]
- ^ ISSN 2156-3527; ISSN 2150-959X.
- ^ See, for example:
- Kalantari, Iraj (1978). "Major Subspaces of Recursively Enumerable Vector Spaces". The Journal of Symbolic Logic. 43 (2): 293–303. doi:10.2307/2272828. ISSN 0022-4812. JSTOR 2272828.
- Downey, Rod G.; Stob, M. (1986). "Structural interactions of the recursively enumerable T- and W-degrees". Annals of Pure and Applied Logic. 31: 205–236. doi:10.1016/0168-0072(86)90071-0.
- Dimitrov, Rumen D.; Harizanov, Valentina (2017). Day, Adam; Fellows, Michael; Greenberg, Noam; Khoussainov, Bakhadyr (eds.). "The Lattice of Computably Enumerable Vector Spaces" (PDF). Computability and Complexity. Vol. 10010. Cham: Springer International Publishing. pp. 366–393. doi:10.1007/978-3-319-50062-1_23. ISBN 978-3-319-50061-4.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.
