Phyllis Chinn

Phyllis Zweig Chinn (née Zweig, born September 26, 1941) is an American mathematician who holds a professorship in mathematics, women's studies, and teaching preparation at Humboldt State University in California. Her publications concern graph theory, mathematics education, and the history of women in mathematics.[1]

Phyllis Chinn
Born (1941-09-26) September 26, 1941
Rochester, New York
AwardsLouise Hay Award
Academic background
Alma materBrandeis University .
University of California, Santa Barbara
Doctoral advisorPaul Kelly
Academic work
DisciplineMathematics
Sub-disciplinegraph bandwidth
InstitutionsTowson State College,
Humboldt State University

Education and career

Chinn was born in Rochester, New York and graduated in 1962 from Brandeis University.[1] She earned her Ph.D. in 1969 from the University of California, Santa Barbara with a dissertation on graph isomorphism supervised by Paul Kelly.[1][2] She taught at Towson State College, a training school for teachers in Maryland, from 1969 to 1975, and earned tenure there in 1974, before moving to Humboldt State.[1] At the time she joined the Humboldt State faculty, she was the first female mathematics professor there; the only other female professor in the sciences was a biologist.[3]

In 1997 she became chair of the mathematics department at Humboldt State.[4]

Contributions

Chinn has written highly cited work on graph bandwidth,[5] dominating sets,[6] and on bandwidth.[3][7]

Chinn is also an avid juggler,[3] and founded a juggling club at Humboldt State in the 1980s.[8]

Recognition

Humboldt State named Chinn as Outstanding Professor for 1988–1989.[9] She was the 2010 winner of the Louise Hay Award for Contributions to Mathematics Education, given by the Association for Women in Mathematics, for her work in improving mathematics education at the middle and high school levels and encouraging young women to become mathematicians.[3]

gollark: Just ask another god how to increase your wizard level.
gollark: I mean, how would you know all computer science and not any maths, for instance?
gollark: You can know *some* stuff about it, but not *all* stuff.
gollark: And if they know about nothing else, presumably they wouldn't really know about any actual *evidence* related to religions' truth?
gollark: Wait, is this the same omniscient god as the one you ask questions about other stuff?

References
  1. Curriculum vitae Archived 2019-01-03 at the Wayback Machine, retrieved 2015-01-17.
  2. Phyllis Chinn at the Mathematics Genealogy Project
  3. Twentieth Annual Louise Hay Award, Association for Women in Mathematics, retrieved 2015-01-17.
  4. "Class Notes", Brandeis Review, vol. 18 no. 1, p. 58, 1997
  5. Chinn, P. Z.; Chvátalová, J.; Dewdney, A. K.; Gibbs, N. E. (1982), "The bandwidth problem for graphs and matrices—a survey", Journal of Graph Theory, 6 (3): 223–254, doi:10.1002/jgt.3190060302, MR 0666794.
  6. Brigham, Robert C.; Chinn, Phyllis Z.; Dutton, Ronald D. (1988), "Vertex domination-critical graphs", Networks, 18 (3): 173–179, doi:10.1002/net.3230180304, MR 0953920.
  7. Chinn, P. Z.; Erdős, P.; Chung, F. R. K.; Graham, R. L. (1981), "On the bandwidths of a graph and its complement", The theory and applications of graphs (Kalamazoo, Mich., 1980), Wiley, New York, pp. 243–253, MR 0634530.
  8. Tahja, Katy M. (2010), Humboldt State University, Campus History, Arcadia Publishing, p. 119, ISBN 9780738580159.
  9. "Class Notes", Brandeis Review, vol. 9 no. 1, p. 57, Winter 1989–1990
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.