Joy Morris

Last updated

Joy Morris (born 1970) [1] is a Canadian mathematician whose research involves group theory, graph theory, and the connections between the two through Cayley graphs. [2] She is also interested in mathematics education, is the author of two open-access undergraduate mathematics textbooks, and oversees a program in which university mathematics education students provide a drop-in mathematics tutoring service for parents of middle school students. She is a professor of mathematics at the University of Lethbridge.

Contents

Education and career

Morris is originally from Toronto, Ontario. [2] [3] Both her parents had doctorates; she was the youngest of their four children, another of whom also earned a Ph.D.. She was educated through various alternative-education and gifted-student programs in the Toronto public school system. [3] She graduated from Trent University in 1992 [4] with a double major in mathematics and English, and with fourth-year honours in mathematics earned in part through a summer research project with Brian Alspach at Simon Fraser University. [3]

She entered graduate study directly after graduating, continuing to work with Alspach at Simon Fraser, [3] and completed her doctorate in 2000 with a dissertation on Isomorphisms of Cayley Graphs. [5] Morris joined the Lethbridge faculty in 2000, and was promoted to full professor in 2015. [2] [4] As of 2017 her position as a professor at Lethbridge was for half-time. [3]

Mathematics education

In 2017, after learning about the frustrating experiences of her middle-school daughter's friends' parents, Morris founded a drop-in mathematics tutoring center through the University of Lethbridge, in which Lethbridge mathematics education students would tutor middle-school parents on the mathematics their children were learning, and provide educational activities for the parents to do with their children. [3] The program was successful, and has continued in subsequent years. [6] [7]

Other contributions

Morris's results in groups, graphs, and the symmetries of groups and graphs include a proof of Toida's conjecture according to which, for certain circulant graphs (the Cayley graphs of finite cyclic groups), every symmetry of the graph comes from a symmetry of the underlying group. According to Toida's conjecture, this equivalence between group and graph symmetries should be valid when all of the members of the generating set of the group used to construct the graph are individually generators of the group. [8]

Morris has written two open textbooks in mathematics for the undergraduate students at Lethbridge. They are:

Related Research Articles

<span class="mw-page-title-main">Dragan Marušič</span> Slovenian mathematician

Dragan Marušič is a Slovene mathematician. Marušič obtained his BSc in technical mathematics from the University of Ljubljana in 1976, and his PhD from the University of Reading in 1981 under the supervision of Crispin Nash-Williams.

<span class="mw-page-title-main">Petersen graph</span> Cubic graph with 10 vertices and 15 edges

In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring.

Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.

In the mathematical field of graph theory, a vertex-transitive graph is a graph G in which, given any two vertices v1 and v2 of G, there is some automorphism

<span class="mw-page-title-main">Algebraic graph theory</span> Branch of mathematics

Algebraic graph theory is a branch of mathematics in which algebraic methods are applied to problems about graphs. This is in contrast to geometric, combinatoric, or algorithmic approaches. There are three main branches of algebraic graph theory, involving the use of linear algebra, the use of group theory, and the study of graph invariants.

<span class="mw-page-title-main">Circulant graph</span> Undirected graph acted on by a vertex-transitive cyclic group of symmetries

In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes called a cyclic graph, but this term has other meanings.

<span class="mw-page-title-main">Cheryl Praeger</span> Australian mathematician

Cheryl Elisabeth Praeger is an Australian mathematician. Praeger received BSc (1969) and MSc degrees from the University of Queensland (1974), and a doctorate from the University of Oxford in 1973 under direction of Peter M. Neumann. She has published widely and has advised 27 PhD students. She is currently Emeritus Professor of Mathematics at the University of Western Australia. She is best known for her works in group theory, algebraic graph theory and combinatorial designs.

<span class="mw-page-title-main">Václav Chvátal</span> Czech-Canadian mathematician

Václav (Vašek) Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada, and a visiting professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.

The mathematical field of combinatorics was studied to varying degrees in numerous ancient societies. Its study in Europe dates to the work of Leonardo Fibonacci in the 13th century AD, which introduced Arabian and Indian ideas to the continent. It has continued to be studied in the modern era.

<span class="mw-page-title-main">Hamiltonian decomposition</span>

In graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles. Hamiltonian decompositions have been studied both for undirected graphs and for directed graphs. In the undirected case a Hamiltonian decomposition can also be described as a 2-factorization of the graph such that each factor is connected.

Norman Linstead Biggs is a leading British mathematician focusing on discrete mathematics and in particular algebraic combinatorics.

In combinatorial mathematics, Toida's conjecture, due to Shunichi Toida in 1977, is a refinement of the disproven Ádám's conjecture from 1967.

Daniela Kühn is a German mathematician and the Mason Professor in Mathematics at the University of Birmingham in Birmingham, England. She is known for her research in combinatorics, and particularly in extremal combinatorics and graph theory.

Brian Roger Alspach is a mathematician whose main research interest is in graph theory. Alspach has also studied the mathematics behind poker, and writes for Poker Digest and Canadian Poker Player magazines.

Katherine A. Heinrich is a mathematician and mathematics teacher who was the first female president of the Canadian Mathematical Society. Her research interests include graph theory and the theory of combinatorial designs. Originally from Australia, she moved to Canada where she worked as a professor at Simon Fraser University and as an academic administrator at the University of Regina.

<span class="mw-page-title-main">Klavdija Kutnar</span> Slovene mathematician

Klavdija Kutnar is a Slovene mathematician. She received her PhD at the University of Primorska (UP) in 2008, and she currently serves as the Rector of the university.

Pearls in Graph Theory: A Comprehensive Introduction is an undergraduate-level textbook on graph theory by Nora Hartsfield and Gerhard Ringel. It was published in 1990 by Academic Press with a revised edition in 1994 and a paperback reprint of the revised edition by Dover Books in 2003. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries.

Convex Polytopes is a graduate-level mathematics textbook about convex polytopes, higher-dimensional generalizations of three-dimensional convex polyhedra. It was written by Branko Grünbaum, with contributions from Victor Klee, Micha Perles, and G. C. Shephard, and published in 1967 by John Wiley & Sons. It went out of print in 1970. A second edition, prepared with the assistance of Volker Kaibel, Victor Klee, and Günter M. Ziegler, was published by Springer-Verlag in 2003, as volume 221 of their book series Graduate Texts in Mathematics.

References

  1. ↑ Birth year from WorldCat Identities, retrieved 2019-08-26.
  2. 1 2 3 "Dr. Joy Morris", STEM from the Prairies, NSERC Chair for Women in Science & Engineering, archived from the original on 2018-12-10, retrieved 2019-08-26
  3. 1 2 3 4 5 6 "Interview with Joy Morris", Mathematics with a Human Face, Math Central, May 2017, retrieved 2019-08-26
  4. 1 2 "Joy Morris", Campus Directory, University of Lethbridge, retrieved 2019-08-26
  5. ↑ Joy Morris at the Mathematics Genealogy Project
  6. ↑ Scarpelli, Joe (January 19, 2018), Lethbridge parents join middle school math class to keep up with their kids, Global News
  7. ↑ Kalinowski, Tim (February 3, 2019), "U of L offering Math Help Sessions for Parents", Lethbridge Herald, archived from the original on February 3, 2019
  8. ↑ Review of Morris's paper "Toida's conjecture is true" (with Edward Dobson, Elect. J. Combin. 2002): Seifter, Norbert (2003), MR 1928787
  9. ↑ "Proofs and Concepts", Open Textbook Library, Center for Open Education, University of Minnesota College of Education and Human Development, retrieved 2019-08-26
  10. ↑ "Combinatorics", Open Textbook Library, Center for Open Education, University of Minnesota College of Education and Human Development, retrieved 2019-08-26
This page is based on this Wikipedia article
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.