The Dalrymple Lecture Series in the University of Mississippi Department of Mathematics was endowed by Mr. and Mrs. Arch Dalrymple III of Amory, Mississippi. Arch Dalrymple attended Cornell University, Amherst College and UM, where he earned a bachelor’s degree in 1947.
The Dalrymple Lecture Series brings distinguished speakers to discuss mathematics and mathematics research. Lectures are aimed at the general audience—students and non-mathematicians are encouraged to attend.
The lecture series has brought several well-known mathematicians to the University.
Additional previous lectures:
- 2014: Nándor Simányi, University of Alabama, Birmingham
- 2006: Keith Devlin, Stanford University
- 2002: Robin Thomas, Georgia Institute of Technology
- 2001: Douglas Hofstadter, Indiana University
- 2000: Raymond Smullyan
- 1996: Carl Pomerance, Dartmouth College
- 1995: Dominic Welsh, University of Oxford
- 1994: Paul R. Halmos, Santa Clara University
- 1993: Leonard Gillman
- 1992: R. Daniel Mauldin, University of North Texas
- 1991: Joseph Diestel, Kent State University
- 1990: Richard H. Schelp, University of Memphis
- 1989: Wilhelmus A. J. Luxemberg
Dr. Ken Ono is the Thomas Jefferson Professor of Mathematics at the University of Virginia, the Asa Griggs Candler Professor of Mathematics at Emory University, and the vice president of the American Mathematical Society.He is an associate producer of the film The Man Who Knew Infinity starring Dev Patel and Jeremy Irons about Srinivasa Ramanujan, a self-trained two-time college dropout who left behind three notebooks filled with equations that mathematicians are still trying to figure out today. Ramanujan claimed that his ideas came to him as visions from an Indian goddess. This lecture is about why Ramanujan matters. The answers to this question extend far beyond the world of equations and formulas. Dr. Ono -- who specializes in number theory, especially in integer partitions, modular forms, moonshine, and the fields of interest to Srinivasa Ramanujan -- will share several clips from the film in the lecture, and will tell stories about the production and promotion of the film.
Dr. Arthur Benjamin is the Smallwood Family Professor of Mathematics at Harvey Mudd College in Claremont, California. He is also a professional magician, and in his entertaining and fast-paced performance, Dr. Benjamin will demonstrate how to mentally add and multiply numbers faster than a calculator, how to figure out the day of the week of any date in history, and other amazing feats of mind.
I will discuss the basic notions related to the complexity theory. The classes of P and NP problems will be defined, with examples given. Besides discussing the statements of the problems, I will talk about the effectiveness of algorithms used in linear algebra (multiplying matrices and solving the systems of linear equations). No previous knowledge of complexity theory will be assumed, however some knowledge of linear algebra (matrices and their multiplication) will be needed.
A prime number is an integer greater than one whose only positive divisors are 1 and itself. In 1859 G. F. B. Riemann proposed a way to understand how the prime numbers are distributed among the natural numbers. More than 150 years later mathematicians still have not proven Riemann's Hypothesis. The stature of this problem has continued to rise so that today it is widely regarded as the most important unsolved problem in all of mathematics. In this talk I will describe some of the colorful history that surrounds this question.
I will talk about mathematical objects that have two seemingly contradictory attributes. On the one hand, they are generic within a given class, in the sense that if most objects within the class have a property, then our object has it as well. So generic objects are common. On the other hand, they are very special if they exist, for example, there is always, in essence, at most one such object within a given class. Generic objects show up in various areas of mathematics, for example, in topology, geometry, and analysis. They tend to have astonishing mathematical features. Can you imagine a curve C with the property that if you cover it by the union of two curves C1 and C2, then either C1 or C2 must be equal to the whole C? There is a curve like that and it is one of the generic objects.
Photo from the University of Illinois's Department of Mathematics
A three-legged stool doesn’t wobble. But four-legged stools often teeter because the tips of their legs don’t lie in the same plane.
This phenomenon of dependent sets, first theorized 75 years ago, is the focus of the 16th Dalrymple Lecture in Mathematics, set for 5:30 p.m. Friday (May 21) at the University of Mississippi. James Oxley, who holds an alumni professorship at Louisiana State University, is to deliver the address, which is free and open to the public in the Student Union Ballroom.
“There is some beautiful and intriguing mathematics that arises from some natural problems in geometry and network theory,” Oxley said. “Moreover, this mathematics is accessible to anyone who has done high school geometry.”
An internationally renowned mathematician from Australia, Oxley earned his doctoral degree from Oxford University. He has published more than 120 research papers in mathematics and authored the book “Matroid Theory,” considered the standard text in the field.
Oxley plans to discuss geometry and network theory, as well as matroids, a common theory of dependence that applies to both.
“Most people have a familiarity with games and their strategies,” said James Reid, UM professor of mathematics. “Dr. Oxley’s talk will show that games and these strategies have underlying mathematics, which unifies common concepts of games and geometry. He will illustrate applications of this mathematics to common real-world problems, such as constructing efficient computer networks.”
Description written by Ole Miss News.
Paul Erdős, one of the greatest mathematicians of the twentieth century, was a champion of applications of probabilistic methods in many areas of mathematics, such as a graph theory, combinatorics and number theory. He also, almost fifty years ago, jointly with another great Hungarian mathematician Alfred Rényi, laid out foundation of the theory of random graphs: the theory which studies how large and complex systems evolve when randomness of the relations between their elements is incurred. In my talk I will sketch the long journey of this theory from the pioneering Erdős era to modern attempts to model properties of large real world networks which grow unpredictably, including the Internet, World Wide Web (WWW), peer-to-peer, social, neural and metabolic networks.
Ever more connected, the world’s population may continue to rely on the proverbial “chewing gum and bailing wire” for cyberspace security.
So says Andrew Odlyzko, a University of Minnesota mathematician and former telecommunications researcher, who is slated to deliver the annual Dalrymple Lecture Thursday (April 2) at the University of Mississippi.
“We will never attain a secure infrastructure,” Odlyzko said. “But a combination of technology and traditional tools of human society will prove adequate, and we are unlikely to face disaster.”
Odlyzko’s lecture, “Cybersecurity, Mathematics and Limits on Technology,” starts at 6 p.m. in Butler Auditorium. It is free and open to the public.
Odlyzko is founding director of the interdisciplinary Digital Technology Center at the University of Minnesota, and he served as interim director at the Minnesota Supercomputing Institute. Before joining academe, he devoted 26 years to research at Bell Telephone Laboratories, which later became AT&T Labs.
“Dr. Odlyzko is a renowned mathematician,” said Iwo Labuda, UM mathematics chair. “We look forward to his expertise, and we hope a better appreciation and understanding for the field of mathematics will result from his lecture.”
Odlyzko has authored more than 150 technical papers in computational complexity, cryptography, number theory, combinatorics, coding theory, analysis and probability theory, and he owns three patents. He is writing a book that compares the Internet bubble to the British Railway Mania of the 1840s and explores the implications for future technology diffusion.
Description written by Ole Miss News.
Film making is undergoing a digital revolution brought on by advances in areas such as computer technology, computational physics, geometry, and approximation theory. Using numerous examples drawn from Pixar's feature films, this talk will provide a behind the scenes look at the role that math plays in the revolution.
Tony DeRose is currently a Senior Scientist and lead of the Research Group at Pixar Animation Studios. He received a B.S. in Physics from the University of California, Davis, and a Ph.D. in Computer Science from the University of California, Berkeley. From 1986 to 1995 Dr. DeRose was a Professor of Computer Science and Engineering at the University of Washington. In 1998 he was a major contributor to the Oscar-winning short film “Geri's game”, in 1999 he received the ACM SIGGRAPH Computer Graphics Achievement Award, and in 2006 he received an Academy Award for his work on surface representations.