Colloquium
Upcoming Seminar
March 21,
4:40 PM
in
Eliot 314
Reasoning About Cryptosystems in a Computational Logic
Josh Gancher, Cornell University
In modern cryptography, any flaw in a security proof is a potential source of an attack on the cryptosystem. As cryptographic schemes become more complex over time, we will see proofs get larger and more subtle, making them difficult to verify manually. A promising answer to this problem comes from computeraided cryptography, which aims to apply tools from formal methods to certify cryptographic security proofs. In this talk, I will present a tool from this space, AutoLWE, which delivers partially automated mechanized proofs of security for a variety of group and latticebased cryptosystems. No prior knowledge about cryptography will be assumed.
Most Thursday afternoons during the academic year, the Reed College Department of Mathematics hosts a math talk. The talks are directed to our mathematics majors but are usually accessible on a variety of levels.
201819 Schedule
Fall
4:405:30pm in Eliot 314 (unless marked otherwise). Directions to Reed.
Aug 30  Meeting with Majors Topics to be discussed: Photos will be taken of junior & senior mathematics majors for the department bulletin board. All students welcome. Refreshment will be provided. 

Sept 6  AI is Coming..... David Krueger, University of Montreal How can we build advanced artificial intelligence (AI) systems that behave as we intend and expect? ("AI alignment") How can we know whether the AI we've built is safe? ("AI safety") What will happen if it's not? Although nobody knows if or when we will develop humanlevel artificial general intelligence (AGI), recent progress in machine learning (ML), in particular deep learning (DL) and reinforcement learning (RL) have led to a massive surge of interest in AI, with billions of dollars going into research with the explicit aim of building AGI. This has coincided with increased concern over the transformative social impacts of AI technology, most notably the possibility of human extinction ("AIXrisk"). I'll give background on machine learning and AI alignment, safety, and Xrisk; and I'll talk a bit about my research in these areas. All are welcome. Free and open to the public. Refreshment will be provided 
Sept 13  Summer Research Presentations Reed students will present overviews of research in mathematics, statistics, and computer science they completed during summer 2018: Ira GlobusHarris and Marika Swanberg  Differentially private analysis of variance Simon Couch and Zeki Kazan  Differentially private nonparametric hypothesis testing Maxine Calle  Putting the "k" in curvature: kplane constant curvature conditions Henry Blanchette  Citations and collaborations among computer systems publications 
Sept 20  Summer Research Presentations Reed students will present overviews of research in mathematics, statistics, and computer science they completed during summer 2018: Zichen Cui  Minimally intersecting filling pair origamis David TamasParris and Livia Xu  Generators and relations for the equivariant BarrattEccles operad Yevgeniya Zhukova  A look at the functors Ext and Tor Nick Chaiyachakorn  De Rham cohomology is singular cohomology: de Rham's theorem 
Sept 27  Bitcoins and Blockchains Adam Groce, Reed College Cryptocurrencies like Bitcoin attempt to create an electronic "object" that functions as the equivalent of cash, allowing people to carry out electronic transactions without the need for an intermediary (like a bank or credit card company). This talk will explain what these cryptocurrencies are and the blockchain technology that makes them work. The focus will be on understanding the really innovative cryptography that makes them function, but we'll also talk about the economic and policy issues that they raise. A good technical understanding of how cryptocurrencies really work is crucial if one wants to separate their true promise from the groundless hype. 
Oct 4  Spaces of Commuting Matrices José Manuel Gómez, Universidad Nacional de Colombia In this talk I will introduce the space of commuting matrices associated to different groups of matrices both with real and complex coefficients. We will consider different explicit examples. We will pay particular attention to the problem of computing the number of pathconnected components in such spaces. At the end of the talk I will try to explain the geometric relevance of such spaces and the geometric significance of the number of pathconnected components. 
Oct 11  Inversion generating functions for signed pattern avoiding permutations Naiomi Cameron, Lewis and Clark College We consider the classical Mahonian statistics on the set Bn(Σ) of signed permutations in the hyperoctahedral group Bn which avoid all patterns in Σ, where Σ is a set of patterns of length two. In 2000, Simion gave the cardinality of Bn(Σ) in the cases where Σ contains either one or two patterns of length two and showed that Bn(Σ) is constant whenever Σ = 1, whereas in most but not all instances where Σ = 2, Bn(Σ) = (n+1)!. We answer an open question of Simion by providing bijections from Bn(Σ) to Sn+1 in these cases where Bn(Σ) = (n+1)!. In addition, we extend Simion’s work by providing a combinatorial proof in the language of signed permutations for the major index on Bn(21, ̄2 ̄1) and by giving the major index on Dn(Σ) for Σ = {21, ̄2 ̄1} and Σ = {12, 21}. The main result of this paper is to give the inversion generating functions for Bn(Σ) for almost all sets Σ with Σ ≤ . 
Oct 25  An Introduction to the Bernoulli Numbers, from Pythagoras to Present Ellen Eischen, University of Oregon Consider these basic questions: What can we say about whole number solutions to polynomial equations? What about finite sums of powers of whole numbers? Infinite sums of powers of fractions? What about factorizations into primes? In the setting of certain interesting families of examples, fractions called "Bernoulli numbers" unify these seemingly unrelated questions. After an introduction to the Bernoulli numbers, we will explore related developments for these intertwined problems, which lead to central challenges in number theory and beyond. 
Nov 1  Preperiodic points in complex and arithmetic dynamics John Doyle, Louisiana Tech University The study of complex dynamical systems was begun about a century ago, and interest was renewed in the 1980's by work of Douady, Hubbard, and others. Noting analogies between dynamical systems and various objects in algebraic geometry and number theory, Morton and Silverman began to develop an arithmetic theory of dynamical systems in the early 1990's. I will discuss preperiodic points for polynomial maps, motivated by the problem of counting the number of such points in both the complex and arithmetic settings, and I will survey various results on questions of this type.

Nov 8  Using Topological Invariants to Distinguish Objects Courtney Thatcher, University of Puget Sound A common question asked in topology is whether or not two objects are the same. One way to try to answer this is by looking at the intrinsic properties of the objects such as the number of pieces, how many holes it contains, and how it is twisted. These properties, known as topological invariants, are shared by spaces that are considered the same, but they may not be able to distinguish between spaces that are different. In this talk, we will take a closer look at a particular invariant known as the Euler characteristic and see how it is used to distinguish 2dimensional objects (the classification of surfaces). Some additional invariants and classification problems will also be presented. 
Nov 15  Prime numbers and their biases Stephan R. Garcia, Pomona College We survey some classical and modern results about prime numbers. In particular, we highlight remarkable biases displayed by prime pairs that were recently discovered by Pomona undergraduates. 
Nov 29  Scissors congruence and Hilbert's Third Problem Daniel Dugger, University of Oregon In 1900 Hilbert posed a (now wellknown) list of 23 problems that he thought should guide future research for the next century. The third problem concerned whether it was possible to chop up a certain tetrahedron (into a finite number of pieces) and reassemble them to form a cube. The story behind this strange question dates back to Euclid and the early foundations of geometry, and in some form continues to the present day. This was the first of Hilbert's problems to be solved, by Max Dehn. The solution hinged on being able to define and manipulate a new type of "number system". I will describe this story from the beginning and give a sketch of Dehn's work. The talk will assume little in the way of prerequisites; it can probably be understood by anyone who has taken high school geometry. 
Spring
4:405:30pm in Eliot 314 (unless marked otherwise). Directions to Reed.
Jan 31  Please note change in time. Please note change in location. The Shape of the Quantum RealmSpyridon Michalakis, California Institute of Technology Time: 4:30 PM Location: Vollum Lecture Hall At the turn of the century, a list of thirteen significant open problems at the intersection of math and physics was posted online by the president of the International Association of Mathematical Physics. But with problems such as NavierStokes on the list, quick progress seemed unreasonable. Indeed, a decade later, with only one problem partially solved and despite the progress yielding two Fields Medals, the list was all but forgotten. Then, in 2008, as a young mathematician at Los Alamos National Lab, I was tasked with solving the second problem on the list, which asked for a rigorous explanation of the Quantum Hall effect, an important phenomenon in physics with applications to quantum computing and beyond. The solution, which would involve a deep connection between topology and quantum physics, would come a year later. I want to share that journey with you, focusing on insights gained along the way about the relationship of mathematics to physics.


Feb 7  How to obtain parabolic theorems from their elliptic counterparts Blair Davey, City College of New York Experts have long realized the parallels between elliptic and parabolic theory of partial differential equations. It is wellknown that elliptic theory may be considered a static, or steadystate, version of parabolic theory. And in particular, if a parabolic estimate holds, then by eliminating the time parameter, one immediately arrives at the underlying elliptic statement. Producing a parabolic statement from an elliptic statement is not as straightforward. In this talk, we demonstrate a method for producing parabolic theorems from their elliptic analogues. Specifically, we show that an $L^2$ Carleman estimate for the heat operator may be obtained by taking a highdimensional limit of $L^2$ Carleman estimates for the Laplacian. Other applications of this technique will be discussed.

Feb 14  Quantum Learning from Symmetric Oracles (or: How to multiply two matrices when you only know one of them) Jamie Pommersheim, Reed College The study of quantum computation has been motivated, in part, by the possibility that quantum computers can preform certain tasks dramatically faster than classical computers. Many of the known quantumoverclassical speedups, such as Shor's algorithm for factoring integers and Grover's search algorithm, can be framed as oracle problems or concept learning problems. In one model of concept learning, a student wishes to learn a concept from a teacher by asking questions, called queries, to which the teacher responds. In the interest of efficiency, the student wishes to learn the concept by making as few queries as possible. For any such concept learning problem, there is a corresponding quantum concept learning problem. In the quantum version, the student is allowed to ask a superposition of queries – mathematically, a linear combination of queries – and the teacher answers with the corresponding superposition of the responses. After making this idea precise, we will examine several concept learning problems and their quantum analogues. We will discuss recent joint work with former Reed student Daniel Copeland, in which we show how tools from representation theory can be used to precisely analyze any quantum learning problem with sufficient symmetry. 
Feb 21  What is a perfectoid space and what is it good for? Matthew Morrow, Institut de Mathématiques de JussieuParis Rive Gauche The subject of padic arithmetic geometry is concerned with number theory which is ``close to’’ a fixed prime number p. There has been incredible progress in recent years, largely thanks to perfectoid spaces: their creation and the development of the subsequent theory was one of the reasons that Peter Scholze was awarded a Fields Medal last year. In the talk I will attempt to explain some of the main ideas around perfectoids and how we use them. 
Feb 28  Machine Translation: 350 years of progress and new challenges in the connectionist age Jonathan May, University of Southern California Methods and mechanisms for algorithmically converting between human languages have been pursued since at least the 17^{th} century, and translation was one of the first applications devised for computers in the postwar era. The availability of large corpora of translation examples and methods for extracting and wrangling corpus statistics in the 1990s led to a proliferation of higher quality output that could be used by anyone. Today's neural networkdriven MT systems are far more fluent and flexible than their predecessors but also far more datahungry, and have opened the door to a series of new challenges and opportunities:
In this talk I'll provide a selective history of machine translation, introduce core methods and ideas of the field, and discuss work that I and others have done to address these new challenge areas. 
Mar 7  New Points on Curves Dino Lorenzini, University of Georgia Let X/Q be the plane curve defined by a polynomial f(x,y) with coefficients in the field Q of rational numbers. Thus a point (a,b) in the complex plane is on this plane curve iff f(a,b)=0. A rational point on this curve is a point (a,b) where both a and b are rational numbers. It is easy to construct points on this curve which are not rational. For instance, choose any rational number b, and then solve the equation f(x,b)=0 to obtain a point (a,b) on the curve where most often the coordinate a is not a rational number. To any point (a,b), we associate the smallest field extension of Q generated by a and b, and when this field extension Q(a,b) is a finite dimensional Qvector space, we call its dimension d (the degree of this field over Q). With this definition, a rational point has degree d=1. In the case of the Fermat curve x^n+y^n=1 with n>2, setting b=2 produces a point (a,b) on that curve with a= nth root of (12^n). The degree of L:=Q(a,b) is then n. So the Fermat curve has points of degree 1 and of degree n. Can one find other points on this curve with degree 1<d<n? Switching the roles of the curve and the field, given the field L, can you find other smooth plane curves f(x,y)=0 with 1<deg(f)<n and with a point whose coordinates generate that field? Already in the special case of Fermat curves the complete answers to these questions are not easy/known. In this talk we will build on this example and discuss some general results relevant to all curves and all field extensions. 
Mar 14  Japanese Temple Geometry David Krumm, Reed College During the period of Japanese history known as the Edo period, Japan followed a strict isolationist foreign policy in which travel outside the country was forbidden and cultural exchange with European nations was effectively cut off. Coupled with the peace and economic prosperity enjoyed during the Edo period, this “closed country” policy led to a flourishing of uniquely Japanese arts and culture. One of the curious practices that developed during this time was a tradition of hanging wooden tablets inscribed with geometry problems in Buddhist temples and Shinto shrines. In this talk we will discuss the Japanese mathematics of the Edo period generally and the sangaku tablets in particular, including the one problem from these tablets that remains unsolved. 
Mar 21  Reasoning About Cryptosystems in a Computational Logic Josh Gancher, Cornell University In modern cryptography, any flaw in a security proof is a potential source of an attack on the cryptosystem. As cryptographic schemes become more complex over time, we will see proofs get larger and more subtle, making them difficult to verify manually. A promising answer to this problem comes from computeraided cryptography, which aims to apply tools from formal methods to certify cryptographic security proofs. In this talk, I will present a tool from this space, AutoLWE, which delivers partially automated mechanized proofs of security for a variety of group and latticebased cryptosystems. No prior knowledge about cryptography will be assumed. 
Apr 4  Chris Piech, Stanford University 
Apr 11  Nathan Ilten, Simon Fraser University 
Apr 18  Adam Smith, Boston University 
Apr 25  John Palmieri, University of Washington 
May 2  Mike Hill, UCLA 