Department of Mathematics

West Chester University

Mathematics Information
Office: Room 101
25 University Avenue
West Chester, PA 19383
Phone (610) 436-2440
Fax (610) 738-0578
Email: Department Chair

Spring 2016 Colloquium/Seminar Schedule

Colloquium talks will normally be on a Wednesday (usually in UNA 158 from 3:15-4:15).

These seminars/colloquium talks may be by visiting speakers, WCU faculty, or WCU students, and are open to all interested students and faculty.

Send an e-mail to, if you would like to be on the e-mail list to receive advance notice of upcoming talks.

Previous Semesters: Fall 2015, Spring 2015, Fall 2014, Spring 2014, Fall 2013, Spring 2013, Fall 2012, Spring 2012, Fall 2011, Spring 2011, Fall 2010, Spring 2010, Fall 2009, Spring 2009, Fall 2008, Spring 2008, Fall 2007, Spring 2007, Fall 2006, Summer 2006, Spring 2006.





University of Maryland





Cannonballs, Donuts, and Secrets: An Introduction to elliptic curve cryptography

Wednesday, February 10, 2016 from 3:20 to 4:15PM

UNA 161

Elliptic curves have been around for centuries, but recently they have become very important in cryptography. I’ll start with a light introduction to elliptic curves and then discuss some recent cryptographic applications.


Larry Washington is a professor of Mathematics at the University of Maryland in College Park. He earned his Ph.D. from Princeton University under the supervision of Kenkichi Iwasawa. He has published over 50 research papers and has supervised 25 Ph.D. students. He is the author or coauthor of the following books: Cyclotomic Fields, Elliptic Curves - Number Theory and Cryptography, An Introduction to Number Theory with Cryptography (with James S. Kraft), Introduction to Cryptography with Coding Theory (with Wade Trappe), and Elementary Number Theory (with James S. Kraft).



For further information e-mail or





University of Richmond




Which graphs are coloring graphs?

Wednesday, February 3, 2016 from 3:15 to 4:15PM

UNA 158

For a simple graph G and a positive integer k, the k-coloring graph of G, denoted Ck(G), is the graph whose vertex set is the set of all proper (vertex) k-colorings of G with two k- colorings adjacent if and only if they differ at exactly one vertex of G. In this talk, we consider the question: Which graphs are coloring graphs? We give examples of families of graphs whose members are always, sometimes, and never coloring graphs and discuss techniques useful for investigating this inverse problem. No prior knowledge of graphs is necessary. We will begin with the definition of a graph and give lots of examples along the way! (This is joint work with Julie Beier (Earlham College), Janet Fierson (LaSalle University), Ruth Haas (Smith College), and Kara Shavo (Presbyterian College).)


Dr. Heather M. Russell attended Washington College in Chestertown, MD for her undergraduate work and received degrees in both math and computer science in 2003. She received her Ph.D. in mathematics from The University of Iowa in 2009. She completed two two-year post-doctoral positions at Louisiana State University and University of Southern California before returning to her undergraduate alma mater to teach  as an assistant professor for two years. She is now in her second semester as assistant professor at University of Richmond and very much looking forward to breaking the pattern of moving every two years! Her work focuses on knot theory and its connections to graph theory and combinatorial representation  theory. She is also very interested in promoting undergraduate research in mathematics and broadening participation in STEM fields.  In her spare time, she enjoys running, cooking, traveling, and seeing live music.




For further information e-mail or





Note: Talks will be added to the schedule throughout the semester. Check back for updates.