The Amherst College Math Colloquium is a series of talks for undergraduates.
All are welcome! The talks are intended to be mostly accessible to students who have taken calculus, although they may also provide a preview of deeper waters. The colloquium talks are usually one hour long (50 + 10 minutes for questions). We usually have a 30 minute pre-talk small gathering (with snacks and refreshments) beforehand.
Wednesday, April 17, 2024
4:00-5:00, SMUD 206. Pre-talk gathering at 3:30 in Williams Lounge (Room 208).
Comparing models of disturbance in applied dynamical systems
Different choices for modeling disturbance to a dynamical system can lead to different predictions of future outcomes. For example, when modeling population growth, traditional techniques use a continuous disturbance to model removing part of the population. However, if the disturbance is relatively fast compared to the recovery period, we can choose to remove part of the population instantaneously in a type of impulsive differential equation that I like to call a flow-kick system. In this talk I'll introduce flow-kick systems and show that when maintaining a constant disturbance rate, flow-kick systems can have qualitatively different outcomes than their analogous continuous systems if the time between disturbances is large enough. I'll discuss some theory briefly but mainly focus on applications, including fires in savannas and human immune system reaction to reoccurring exposure to a virus.
Alanna Hoyer-Leitzel is an Associate Professor Mathematics at Mount Holyoke College. Her research in dynamical systems focuses on bifurcations and disturbance, with applications in physical, ecological, and biological systems. She likes cats, small dogs, and dabbling in fiber arts and gardening.
Wednesday, April 3, 2024
5:00-6:00, SMUD 206. Pre-talk gathering at 4:30 in Williams Lounge (Room 208).
It's all about Chemistry!
Have you ever wondered what a Partial Differential Equation (PDE) is and how it is used to model real life? In this talk, I will give two different PDE models for a chemical reaction and show that they are two different sides of the same coin. Come and see how a simple integration by parts makes all our worries go away! No math knowledge (beyond calculus) and no chemistry knowledge required.
Peyam Tabrizian (he/him) is currently a Lecturer in the Applied Mathematics Department at Brown University. His speciality lies in the field of nonlinear partial differential equations, and his thesis work was on asymptotic methods for chemical reactions and diffusions. He also has a YouTube channel called "Dr Peyam" which currently has over 166,667 subscribers and close to 1000 videos.
Wednesday, March 27, 2024
4:00-5:00, SMUD 206. Pre-talk gathering at 3:30 in Williams Lounge (Room 208).
Tensegrities: linear algebra as art?
Kenneth Snelson's beautiful tensegrity sculptures feature metal bars that seem to float magically in the air. In this talk I'll try to convince you that a tensegrity is the physical manifestation of a linear dependence relation on the rows of a matrix. Then I'll discuss how the mathematics used to describe tensegrities can also be used to study other disparate problems including sensor network localization, the rigidity of bar-and-joint frameworks, and the distributed control of formations of robots.
Jessica Sidman loves to work on pure and applied problems at the intersection of computational algebra, algebraic geometry, and combinatorics. Her recent work in rigidity theory combines aspects of these three fields, and all got started when an undergraduate doing a thesis on protein folding asked her a question about projective space. She got her Ph.D. from the University of Michigan and did postdoctoral work at UC Berkeley and UMass Amherst. She was the Professor of Mathematics on the John Stewart Kennedy Foundation at Mount Holyoke College and is now a Professor of Mathematics at Amherst College.
Thursday, February 22, 2024
4:00-5:00, SMUD 206. Pre-talk gathering at 3:30 in Williams Lounge (Room 208).
Factoring Integers Using Quantum Computers
Factoring large numbers is notoriously difficult, even with the help of a computer and state of the art algorithms. In fact, if you could factor large integers into their prime components efficiently, you could break the security systems that websites use to protect users' credit card information (and become quite rich). In 1994 Peter Shor developed an algorithm which runs on a "quantum computer" in "polynomial time". In this talk I will discuss what a quantum computer is, what basic logical operations it can perform, and use Shor's algorithm to factor the number 15. The talk will assume some basic facts from Linear Algebra.
Monday, February 12, 2024
4:00-5:00, SMUD 206. Pre-talk gathering at 3:30 in Williams Lounge (Room 208).
Beyond Fermat's last theorem
What do we (number theorists) do with ourselves now that Fermat's last theorem (FLT) has fallen? I'll discuss numerous generalizations of FLT -- for instance, for fixed integers $a,b,c \geq 2$ satisfying $1/a + 1/b + 1/c < 1$, Darmon and Granville proved the single generalized Fermat equation $x^a + y^b = z^c$ has only finitely many coprime integer solutions. Conjecturally something stronger is true: for $a,b,c \geq 3$ there are no non-trivial solutions. More generally, I'll discuss my subfield "arithmetic geometry", and in particular the geometric intuitions that underlie the conjecture framework of modern number theory.
David Zureick-Brown is a professor of mathematics at Amherst College. He is broadly interested in Number Theory, Arithmetic Geometry, and Algebraic Geometry, especially making connections between different subareas of mathematics.
Tuesday, November 14, 2023
4:00-5:00, SMUD 206. Pre-talk refreshments at 3:45 in Room 208.
On Numbers… and Patterns… and Games… and Greed
Two sequences are complementary if their union gives the positive integers and their intersection is empty. For instance, the even and odd numbers are two complementary sequences. Similarly, the prime and composite numbers form another pair of complementary sequences. Combinatorial Games are two player (usually alternating), deterministic games (no flipping coins, tossing dice, ...) and with perfect information (each player knows all information available about the state of the game. Nothing is hidden). On the other hand continued fractions are a special type of fractions that form under the following rules: "add a fraction to an existing fraction’s denominator." In this talk we will present some old and new results about complementary sequences, see how some of they arise as winning strategies for combinatorial games and how these sequences relate to continued fractions and other mathematical objects like dynamical systems.
My name is Geremías Polanco and I am an Assistant Professor of Mathematics at Smith College. I obtained my PhD in Mathematics from the University of Illinois at Urbana-Champaign, and my area of specialization is Number Theory. In this area of mathematics we study the integers which are the numbers $\cdots -3,-2,-1,0,1,2,3,\cdots$ and their generalizations. My research uses tools from combinatorics (counting techniques), tools from algebra and tools from analysis (a sophisticated version of calculus) to solve problems involving the integers, and I actively mentor students in this endeavor.
To be more specific, I investigate number theoretic and combinatorial properties of complementary integer sequences, especially those that are increasing. My research spans analyzing their inherent properties, exploring various generation methods, examining related mathematical constructs, and applying them in areas such as combinatorial games where these sequences emerge as solutions. I also study problems in uniform distribution theory, a central area in mathematics, that provides a framework to understand how sequences spread out over a specific interval or space. Finally I am lately working on some problems that require the use of analysis and algebra to better understand prime numbers and their properties.
Professionally, I have three main passions:
1. I am passionate about engaging in collaborative research with students and other colleagues, particularly delving into intriguing challenges in number theory. 2. My enthusiasm lies in effective teaching and conveying mathematical concepts to diverse audiences, with a special emphasis on undergraduate students. 3. My ultimate aim is to contribute to the establishment of a more inclusive mathematics community by breaking down barriers that hinder access and by providing support to all individuals, enabling them to flourish within the field of mathematics. I was born in the Dominican Republic where I completed my undergraduate studies. After completing my Phd I moved to the Pioneer Valley where I worked as an Assistant professor at Hampshire College for 6 years, as a Visiting Assistant Professor at Amherst College for 1 year, and I have been at Smith since 2020. I love baseball (being a good dominican myself) and other outdoor activities.On Saturday nights, I am likely to be playing board games with my family and any friends that may join us.
Thursday, November 9, 2023
Data Cohesion: From Similarity Comparisons to Clustering (joint Math/Stat colloquium)
We often want to observe the shape of our data and will use clustering and data visualization methods to do so. These methods typically require that our data is described with respect to a relatively small set of variables or that we provide distances among all pairs of points. For many interesting problems, however, this initial step can be quite challenging. In such a case, we may instead wish to work from a set of responses to similarity comparisons (e.g., among x, y, and z, which one is the outlier?). In this talk, I will introduce cohesion, a new measure of relative proximity that is built on this comparison framework. We’ll see how cohesion offers a perspective on our data that is quite different from distance alone and can help address challenges that arise in high-dimensional settings. I will also share some initial progress toward the development of cohesion-based methods for clustering and data visualization.
A new characterization of characters (or: algebra and analysis can be friends!)
One of the fundamental concepts of analysis is the fourier transform, which translates information about a function into information about its frequencies. One of the fundamental concepts of algebra is the homomorphism, which translates information about one structured set into information about another structured set. While on the surface these two concepts are unrelated, Gauss discovered some connections between the two. In fact, it turns out that sometimes the two concepts carry equivalent information! Although the talk will include some results that are new, the main ideas should be accessible to all; in particular, I will introduce all the relevant concepts.
Prior to realizing that he could get paid to play with puzzles for his own amusement, Leo Goldmakher pursued a number of other careers--astronaut, paleontologist, singer songwriter--all before the age of 5. A string of outrageous oversights by admissions officers led him to obtain degrees from Princeton and the University of Michigan, after which he was inexplicably hired by the University of Toronto as a postdoc and, subsequently, assistant professor. In 2014 he joined the Williams math/stat department, and has been inflicting mathematics and unforgivable puns on students ever since. He is the recipient of numerous awards, primarily for participation in little league soccer, and is one of the most highly-regarded mathematicians in his household. His primary research interests remain largely unchanged since middle school: to discover and quantify structure and randomness within the natural numbers.
Monday, October 16, 2023
4:00-5:00, SCCE E110 (Lipton Lecture Hall)
Art Benjamin: Mathemagician
Dr. Benjamin, Professor of Mathematics at Harvey Mudd College, has performed his mixture of math and magic for audiences across the world. He’s appeared on the Colbert Report, Today, and NPR, and is profiled in NY Times, LA Times, USA Today, Scientific American, Discover, Esquire, People, and Wired magazines.
All are welcome and encouraged to attend this lively, fun event!
Thursday, October 5, 2023
4:00-5:00, SMUD 206. Pre-talk refreshments at 3:45 in Room 208.
Curvature and polyhedra
What does it mean for a surface to be curved? One way to answer this question is in terms of triangles drawn on the surface, and there's a neat way to approach it for polyhedra -- surfaces with planar faces, like the cube and the octahedron. We'll explore this idea and also encounter an invariant called the Euler characteristic: a glimpse of the area of mathematics called topology.
Jake Levinson is an assistant professor of mathematics at the Université de Montréal. As an undergrad he attended Williams College (go Ephs!). He is interested in algebra, geometry and combinatorics.
Wednesday, September 20, 2023
4:00-5:00, SMUD 206. Pre-talk refreshments at 3:45 in Room 208.
The $abc$ Conjecture: An Introduction
The $abc$-conjecture is a straightforward statement about the prime factors of integers $a$, $b$, and $c$ satisfying the equation $a+b=c$. In spite of the simple name, simple equation, and simple statement, however, the conjecture turns out to be a quite subtle statement in number theory.
In this talk, we will motivate and state the $abc$-conjecture. To help us get there, we'll spend most of our time looking at the related case of putting polynomials, rather than integers, in the roles of $a$, $b$, and $c$.
No background beyond Math 111 is needed for this talk.
Rob Benedetto has been a Professor of Mathematics at Amherst College since 2002. Previously, he held postdoctoral positions at the University of Rochester and Boston University. His research is in number theory and dynamical systems.
Tuesday, March 28, 2023
4:30pm-5:30pm, Seeley Mudd 206
Different Differences: A Primer on NSFD Methods For Solving Differential Equations
From Calculus we know that a derivative of a function can be approximated using a difference quotient. There are different forms of the difference quotient, such as the forward difference (most common), backward difference and centered difference (more accurate). In this talk I will discuss several different differences, specifically nonstandard finite differences (NFSD) that can be used to approximate the derivatives that appear in differential equations as a solution technique. Many NSFD schemes have been discovered and promoted by Ronald E. Mickens, an African-American Emeritus Professor of Physics at Clark Atlanta University, who has written more than 300 research articles and a dozen books. I will present a number of examples of how NSFD schemes can be used to solve a variety of problems drawn from first-semester Calculus to elementary ordinary differential equations to advanced partial differential equations.
All students (faculty and staff) are welcome to attend. Only knowledge of elementary derivatives/anti-derivatives and Taylor approximations will be assumed.
Recent advances in the study of flow polytopes of graphs
A flow polytope of a graph is the set of flows on the edges of the graph with prescribed net flows on vertices. Flow polytopes of graphs are a rich family of polytopes of interest in probability, optimization, representation theory, and algebraic combinatorics. Special cases of these polytopes have remarkable formulas for their volume related to the famous Selberg integral. I will give an overview of recent work on these polytopes including formulas that relate their volume to the number of lattice points, and the geometry of their triangulations.
A guided walk through object oriented statistical machine learning
Usually, we treat data as vectors stored in an excel sheet or data matrix. In this talk we navigate attendees through a spectrum of challenging problems in data science and machine learning that show the need for more sophisticated approaches. We briefly discuss some (recent) mathematical and statistical aspects and the central role of distance and similarity functions.
In this talk, we will explore two very different worlds: the world of quantum spin systems and the world of coarse geometry. Quantum spin systems are powerful mathematical models of interacting quantum many-body systems. They are widely studied in condensed matter physics, mathematical physics as well as quantum information theory. On the other hand, since its introduction by John Roe, coarse geometry has remained a beautiful and effective description of large-scale behavior of spaces. After introducing both worlds separately, I will explain an on-going effort to connect the two through an idea called homology. I will only assume backgrounds in calculus and linear algebra.
Bowen Wang (2018 Amherst graduate)
Thursday, March 18, 2021
5:30pm-6:30pm, via Zoom
The Mystery of Colliding Blocks
I will solve a simple physics problem with a very surprising answer.
Tuesday, September 29, 2020
5:30pm-6:30pm, via Zoom
Wallpaper Patterns and Life on the Klein Bottle
Wallpaper patterns are patterns in the plane which repeat forever in two directions (say, horizontally and vertically, the way wallpaper does!). We'll study their classification using ideas from geometry, and a related field, topology, which one can think of as 'flexible geometry'. We'll encounter many fun mathematical objects along the way, including donuts, Mobius bands, and Klein bottles!
Patricia Cahn (Smith College)
Tuesday, September 15, 2020
6:00pm-7:00pm, via Zoom
Stranger Things (in Math)
As most of you know, 'Stranger Things' is a popular series on Netflix, in which the main characters explore the unknown 'Upside Down' world, where things don't work as they usually do. Following the analogy, we will explore a non-commutative version of algebra and geometry, in which the order in which you write your variables matter. For example, usual addition and multiplication are commutative operations, but subtraction, division, and composition of functions are non-commutative. We will introduce some 'non-commutative creatures' and we will delve into two interesting results: the Baker-Campbell-Hausdorff formula and the Gelfand-Naimark theorem, in an alternate non-commutative world.
Ivan Contreras (Amherst)
Thursday, February 20, 2020
4:30pm, Seeley Mudd 206
Symmetry, Almost
Some definitions of the word symmetry include 'correct or pleasing proportion of the parts of a thing,' 'balanced proportions,' and 'the property of remaining invariant under certain changes, as of orientation in space.' One might think of snowflakes, butterflies, and our own faces as naturally symmetric objects– or at least close to it. Mathematically one can also conjure up many symmetric objects: even and odd functions, fractals, certain matrices, and modular forms, a type of symmetric complex function. All of these things exhibit a kind of beauty in their symmetries, so would they lose some of their innate beauty if their symmetries were altered? Alternatively, could some measure of beauty be gained with slight symmetric imperfections? We will explore these questions guided by the topic of modular forms and their variants. What can be gained by perturbing modular symmetries in particular? We will discuss this theme from past to present: the origins of these questions have their roots in the first half of the 20th century, dating back to Ramanujan and Gauss, while some fascinating and surprising answers come from just the last 15 years.
Amanda Folsom (Amherst)
Thursday, February 6, 2020
4:30pm, Seeley Mudd 207
Unsupervised Clustering, Harmonic Analysis, and Applications
Machine learning is revolutionizing the sciences. But, most existing methods require large amounts of human-generated training data to succeed. In this talk, we will introduce the unsupervised clustering problem, which requires an algorithm to make predictions without training data. We will discuss some classical methods for clustering before introducing a couple new approaches. Throughout, connections with graph theory, Fourier analysis, and probability theory will be developed. We will also demonstrate applications to image processing and remote sensing.
James M. Murphy (Tufts University)
Thursday, November 21, 2019
4:30pm, Seeley Mudd 206
A fun optimization problem
For any set of three vectors $U = \left\{ u_1, u_2, u_3 \right\} = \left\{ \begin{bmatrix} 1 \\ 0 \end{bmatrix} , \begin{bmatrix} \cos \theta_1 \\ \sin \theta_1 \end{bmatrix} , \begin{bmatrix} \cos \theta_2 \\ \sin \theta_2 \end{bmatrix} \right\}$ where the variables $ \theta_1, \theta_2 $ are in the interval $ [0, 2\pi], $ we define the function $$ f(\theta_1, \theta_2) = \sum_{k \neq l = 1}^{3} (u_k \cdot u_l)^2 \cos^2(\theta_1) + \cos^2(\theta_2) + \cos^2(\theta_2 - \theta_1). $$ What is the minimum of this function over the set of all three unit-norm vectors in the plane? What is/are the corresponding minimizer(s)? Using multivariable calculus, we will answer these questions and explore some of the properties of the solution(s). We will then try to see how the solution changes when we have $ 4, 5, \dots, N $ vectors instead of 3.
Kasso Okoudjou (U. Maryland)
Thursday, November 14, 2019
4:30pm-5:30pm, SMUD 204
Comparing Songs without Listening: From Mathematics, Statistics, and Computer Science to Music and Back Again
Music is deeply entrenched in our daily lives, from our playlists to the background songs in our favorite television shows. The multidisciplinary field of Music Information Retrieval (MIR) is motivated by the comparisons that we, as humans, make about music and the various contexts of these comparisons. By defining tasks such as building better song recommendation systems or finding structural information in a given recording, MIR seeks to algorithmically make these musical comparisons in the same manner that a human being would, but on a much larger scale. In this talk, we will introduce the field of MIR, including popular tasks and cutting edge techniques. Then we will present aligned hierarchies, a structure-based representation that can be used for comparing songs, and new extensions of aligned hierarchies that leverage ideas from topological data analysis.
Katie Kinnaird (Smith College)
Wednesday, November 6, 2019
4:30pm, Seeley Mudd 206
Turán's Problem and an Introduction to Sums of Squares
What is the maximum number of edges in a graph on n vertices without triangles? Mantel's answer in 1907—that at most half of the edges can be present—started a new field: extremal combinatorics. More generally, what is the maximum number of edges in a n‐vertex graph that does not contain any subgraph isomorphic to H? What about if you consider hypergraphs instead of graphs? I will introduce the technique of sums of squares and discuss how it can be used to attack such problems.
Annie Raymond (UMass Amherst)
Thursday, October 24, 2019
4:30pm, Seeley Mudd 206
Knot for Everyday Purposes
Knots are a part of our everyday lives, from twisted strands of DNA, to shoelaces, braided hair, and the inevitable tangle of headphones. Mathematics offers an insight into the structure and complexity of everyday knots and provides tools to tell them apart. Starting with pieces of string, we will explore the study of knots and how it ties together various fields of mathematics. No background knowledge is assumed.
David Freund (Harvard University)
Thursday, October 10, 2019
4:30pm, Seeley Mudd 206
A Beginner's Introduction to the Mandelbrot Set
The Mandelbrot Set is a beautiful and intricate geometric object, a small portion of which appears as the background image of the Department's webpage. It arises naturally in the field of Complex Dynamics, the study of the behavior of a function when you compose it with itself over and over again, when the variable is a complex number. In this talk, I'll describe the basics of complex dynamics, as well as some of the fractal sets that arise along the way. That will lead to considering the Mandelbrot set, and exhibiting some of its special structures. The only background required is Math 121. No prior knowledge of dynamics, fractals, or complex numbers is needed.
Rob Benedetto (Amherst)
Thursday, September 26, 2019
4:30pm, Seeley Mudd 206
Mathematical Physics and the Shape of Graphs
Quantum Mechanics has revolutionized the way we understand our world. Since the beginning of the 20th century, beautiful mathematics has been devised and implemented in order to achieve such success. This talk intends to give a gentle overview of a discrete model of quantum mechanics: the Schrödinger equation on graphs. We will use the combinatorial graph Laplacian to learn about certain properties of finite graphs. No prior knowledge of physics or graph theory will be assumed.