Upcoming Talks

Proof Theory and Linguistics

We often think of a proof as a list of statements, where each statement is justified by some number of previous statements via an axiom. It is shockingly useful to instead reason, not about individual statements, but about the conclusion of statements from assumptions. In such a system, the logical rules correspond to intuitive definitions of logical connectives, like implication and quantification. A more subtle advantage is that reasoning in this way allows us to restrict the structure of the sets of assumptions and conclusions. Restricting in different ways captures dozens of rich logics, including intuitionistic logic, Girard’s linear logic, and Lambek calculus. We will focus on Lambek calculus and its extensions and find that this non-commutative logic is very well-suited to linguistic analysis.

Eben Blaisdell (Univ. of Pennsylvania) – “Proof Theory and Linguistics” (see abstract)

For this week’s upcoming SIAM talk, we have a special guest speaker from the University of Pennsylvania. Eben Blaisdell will present on “Proof Theory and Linguistics” Monday, March 7, at 2 pm. Can’t wait to see you there!

Past Talks

12th Annual Epsilon Talks

On Monday, February 28, at 2 pm we have our 12th Annual Epsilon Talks! This is an opportunity for our first-year graduate students to “strut their stuff” and present on a math topic of their choosing. This year, we will see talks from Hunter Wages and Juliane Baiochi Dalben.

In this talk, we discuss the Riemannian Penrose Inequality as well as prove the inequality using monotonicity properties of the solutions of the Inverse Mean Curvature Flow Equation. The proof will follow the process laid out by Huisken and Illmanen…

Hunter Wages – “Inverse Mean Curvature Flow and The Riemannian Penrose Inequality” (see abstract)

In this talk, I am going to show the beauty of Partial Differential Equations and how they are present in our daily lives, especially the conservations laws and the NavierStokes equations. Then I am going to talk about two important notions of solutions for conservation laws that I worked with during my Masters in Brazil.

Juliane Baiochi Dalben – “From Brazil to conservation laws, the Navier-Stokes equations and beyond” (see abstract)

Speaking on the Navier-Stokes Equation

Introducing Inverse Mean Curvature Flow

Past Talks

Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths

In this talk we describe a protocol which uses playing cards to provide a perfectly sound zero-knowledge proof for Flow Free puzzles. It can easily be extended or modified to provide a protocol for a zero-knowledge proof for Hamiltonian cycles and many-to-many k-disjoint path coverings.

Join us Monday, February 21, at 2 pm in Korman 245 for “Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths” by Eammon Hart and Josh McGinnis.

Eammon and Josh give an example of encoding a solution utilizing playing cards.