Peter Engel Science Center
Saint John's University
Judy Walker received her undergraduate degree from the University of Michigan and both her master's degree and her Ph.D. from the University of Illinois at Urbana-Champaign. She has been at the University of Nebraska Lincoln since 1996, and currently serves as Aaron Douglas Professor and Chair of the Department of Mathematics there. She spent much of the fall 2011 semester as a Visiting Professor at Centre Interfacultaire Bernoulli, EPFL in Lausanne, Switzerland as part of a special program in her research area of coding theory. Among her invited lectures are the AMS-MAA Joint Invited Address at the 2013 MathFest in Hartford, CT and a plenary lecture at the 2015 SIAM Conference on Applied Algebraic Geometry in Daejeon, South Korea. Walker is a co-founder of the Nebraska Conference for Undergraduate Women in Mathematics and has served as an elected member of the AWM Executive Committee and the AMS Council. She has won several teaching awards, including the Deborah and Franklin Tepper Haimo Award from the MAA and the Outstanding Teaching and Instructional Creativity Award from the University of Nebraska system. She served as the MAA's Polya Lecturer for 2009-2011 and received the 2016 Louise Hay Award for Contributions to Mathematics Education. She is a Fellow of the American Mathematical Society.
Whenever information is transmitted or stored, errors are bound to occur. It is the goal of coding theory to find efficient ways of adding redundancy to the information so that these errors can be corrected. The mathematical study of error-correcting codes began with Claude Shannon's groundbreaking 1948 paper, in which he proved probabilistically that good codes exist. The subsequent challenge has been to actually find or design these good codes; this problem has occupied the minds of many mathematicians, computer scientists and electrical engineers ever since. In addressing Shannon's challenge, many areas of mathematics have been drawn upon, including several that are not typically thought of as "applied math". This talk will give a mathematical tour through coding theory, focusing especially on the wide range of areas such as algebraic geometry, number theory, and graph theory that have played a crucial role in the development of this field.
As each of three people enter a room, either a red hat or a white hat (with the color chosen randomly and independently) is placed on his head. Each person can see the other hats but not his own. They can discuss strategy before they enter the room, but after they've entered no communication is allowed. Once they've looked at the other hats, the players must simultaneously guess their own hat colors or pass. The group shares a prize if at least one person guesses correctly and no one guesses incorrectly. The "obvious" strategy (one person guesses "Red" no matter what and the other two pass) yields a 50% success rate. Is there a better strategy? What if there are more than three players? We will use the theory of error-correcting codes to find the optimal strategy for this game in many situations.
Upcoming Conference Speakers
Former Conference Speakers
Lectures will be geared toward a general audience
Funding for travel to SJU Pi Mu Epsilon conference is provided by NSF grant DMS‐0846477 through the MAA Regional Undergraduate Mathematics Conferences program.