Math Table

Welcome!

Math Table is a seminar jointly run by the Harvard Mathematics department and undergraduate students. The purpose of Math Table is to provide an opportunity for undergraduates to be exposed to interesting mathematical topics, as well as to gain experience in communicating and teaching mathematics.

Talks take place roughly every other Wednesday at 5 PM in SC 507. For Fall 2026, starting date is September 9.

Who can attend/give talks?

All Harvard undergraduate students are welcome to attend any Math Table talk and to sign up to give a talk. Talks come in a wide array of topics, background levels, and styles (see the "Resources" tab). The Math Table organizers (see "About" tab) are here to help you pick topics and develop your talk, so even if you aren't sure about what your topic is, you should come speak with us!

To sign up to give a talk, or if you have any questions about Math Table, please send an email to Oliver Knill (knill@math.harvard.edu). You can also contact Noam Elkies (elkies@math.harvard.edu ).

Upcoming Talks (Fall 2026)

Wednesday, Sept 2

5 PM SC 507

The Stable Homotopy Groups of spheres

Speaker: Tomer Schlank

Abstract: A fundamental problem in algebraic topology is to understand the higher homotopy groups of spheres, $\pi_n(S^k)$. Freudenthal showed that, for large $k$, these groups depend only on the difference $n-k$. The corresponding group for $m=n-k$, denoted $\pi_m^S$, is finite for $m>0$, and the sequence of finite abelian groups $\pi_m^S$ exhibits fascinating patterns. We shall survey how the study of these groups is related not only to algebraic topology, but also to differential topology and algebra, and discuss some of the modern methods developed to understand them.

Wednesday, Sept 9

5 PM SC 507

Real-Rootedness via Pendant Extensions and Clique Graphs

Speaker: Lale Baylar

Abstract: The independent set sequences of graphs have been widely studied, but only recently have analogous questions been considered for strong independent set sequences of hypergraphs. We develop two tools to prove and preserve the real-rootedness of strong independence polynomials. The first is a pendant-edge transform for uniform pendant hyperedge attachments; it preserves real-rootedness when one or two pendant hyperedges are attached at each vertex, and this range is sharp. The second uses clique graphs and a theorem of Chudnovsky and Seymour on real-rootedness of independence polynomials of claw-free graphs to prove that any finite hypergraph in which every vertex lies in at most two hyperedges has a real-rooted strong independence polynomial. For linear hypertrees, this degree condition exactly characterizes when the clique graph is claw-free.

Recent Talks

For more past talks, check out our "Archive" section.

Report abuse