Richard M. Pollack
Richard M. Pollack | |
---|---|
New York City, New York, U.S. | |
Died | September 18, 2018 Montclair, New Jersey, U.S. | (aged 83)
Alma mater | Brooklyn College New York University |
Scientific career | |
Fields | Mathematics |
Institutions | Courant Institute of Mathematical Sciences, New York |
Doctoral advisor | Harold N. Shapiro[1] |
Richard M. Pollack (January 25, 1935 – September 18, 2018
Contributions
In combinatorics, Pollack published several papers with Paul Erdős and János Pach.[4][5][6][7]
Pollack also published papers in discrete geometry.[8][9][10][11][12][13][14][15][16][17][18] His work with Jacob E. Goodman includes the first nontrivial bounds on the number of order types and polytopes,[8] and a generalization of the Hadwiger transversal theorem to higher dimensions.[9] He and Goodman were the founding editors of the journal Discrete & Computational Geometry.[19]
In real algebraic geometry, Pollack wrote a series of papers with Saugata Basu and Marie-Françoise Roy,[13][14][15][16] as well as a book.[20]
Awards and honors
In 2003, a collection of original research papers in discrete and computational geometry entitled Discrete and Computational Geometry: The Goodman–Pollack Festschrift was published as a tribute to Jacob E. Goodman and Richard Pollack on the occasion of their 2/3 × 100 birthdays.[21]
In 2012, he became a fellow of the American Mathematical Society.[22]
A special memorial 556-page issue of Discrete & Computational Geometry for Pollack was published in October 2020.[23]
References
- ^ Richard M. Pollack at the Mathematics Genealogy Project
- ^ "Richard M. Pollack". Prout Funeral Home. Retrieved November 17, 2021.
- ^ "Ricky Pollack", sent by Joseph S. B. Mitchell on behalf of the Computational Geometry steering committee to the compgeom-announce mailing list, September 19, 2018
- S2CID 6861762
- S2CID 28034074
- S2CID 8092013
- ^
- ^
- doi:10.1137/0212032
- ^ a b Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise (1996), "On the number of cells defined by a family of polynomials on a variety",
- ^ a b
Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise (1996), "On the combinatorial and algebraic complexity of quantifier elimination", Journal of the ACM, 43 (6): 1002–1045, S2CID 9536962
- ^ a b Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise (2000), "Computing roadmaps of semi-algebraic sets on a variety", Journal of the American Mathematical Society, 13: 55–82,
- ^ a b Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise (2009), "An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions",
- ^ "Discrete & Computational Geometry". Discrete & Computational Geometry. Springer Science+Business Media. Retrieved November 17, 2021.
- ^ Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise (2003), Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol. 10, Springer-Verlag
- ISBN 9783540003717.
- ^ List of Fellows of the American Mathematical Society, retrieved 2013-05-26.
- ^ "Discrete & Computational Geometry | Volume 64, issue 3". SpringerLink. Retrieved 2020-11-26.
- Pollack, Richard (1962), Some Tauberian theorems in elementary prime number theory (Ph.D. Thesis), New York University.
- Goodman, Jacob E.; Pach, János; Pollack, Richard, eds. (2008), Surveys on Discrete and Computational Geometry: Twenty Years Later, Contemporary Mathematics, vol. 453, American Mathematical Society.