Uploaded November 2026 | Updated November 2026, 7 hours ago
Members' Colloquium
2:00pm|Simonyi 101
Topic: Mathematics as Gift Economy
Speaker: Michael Harris
Affiliation: Columbia University
Date: November 09, 2026
Although Lewis Hyde's The Gift is primarily concerned with the status of works of art, he does devote part of a chapter to arguing that scientific research functions as a gift economy: the scientist (ideally) contributes new knowledge as a shared resource for the community, which in turn is built on this sharing. Hyde doesn't specifically refer to mathematics, whose community in many ways exemplifies this ideal. Framed in this way, the crucial distinction is not between human and machine mathematics, but rather between human and corporate mathematics, and this latter distinction is responsible for the "severe misalignment," identified in a letter signed by 25 Fields medalists, between the announcements of the AI industry and the practice of human mathematics. I will explore what it means to view the former as a gift economy, and ask how AI-generated mathematics can be integrated into the gift economy under conditions of what Terence Tao has called "proof abundance."
Members' Colloquium
2:00pm|Simonyi 101
Topic: Mathematics as Gift Economy
Speaker: Michael Harris
Affiliation: Columbia University
Date: November 09, 2026
Although Lewis Hyde's The Gift is primarily concerned with the status of works of art, he does devote part of a chapter to arguing that scientific research functions as a gift economy: the scientist (ideally) contributes new knowledge as a shared resource for the community, which in turn is built on this sharing. Hyde doesn't specifically refer to mathematics, whose community in many ways exemplifies this ideal. Framed in this way, the crucial distinction is not between human and machine mathematics, but rather between human and corporate mathematics, and this latter distinction is responsible for the "severe misalignment," identified in a letter signed by 25 Fields medalists, between the announcements of the AI industry and the practice of human mathematics. I will explore what it means to view the former as a gift economy, and ask how AI-generated mathematics can be integrated into the gift economy under conditions of what Terence Tao has called "proof abundance."





![An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC...- Nataly Brukhim
Computer Science/Discrete Mathematics Seminar II
10:30am|Simonyi 101 and Remote Access
Topic: An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC Learning
Speaker: Nataly Brukhim
Affiliation: Institute for Advanced Study
Date: May 26, 2026
I will describe recent breakthrough results in multiclass PAC learning that characterize the optimal sample complexity. The talk will discuss recent work of Chirag Pabbaraju, as well as work of Steve Hanneke, Qinglin Meng, Shay Moran, and Amirreza Shaeiri.
Determining the optimal sample complexity reduces to a structural question about the Hamming-graph representation of the hypothesis class. These are hypergraphs whose vertices lie in [k]^n, where each set of vertices that agree on all coordinates except one forms an edge. It has been shown that bounding the average degree of these hypergraphs yields bounds on the sample complexity of learning. A long-standing conjecture was that this average degree can be controlled by the Daniely–Shalev-Shwartz dimension, a combinatorial dimension introduced in 2014.
The DS dimension is a natural generalization of the VC dimension, and was shown to bound the sample complexity of multiclass PAC learning in joint work with Carmon, Dinur, Moran, and Yehudayoff (2022). However, the correct dependence on the dimension remained open, with a polynomial gap between the upper and lower bounds. The recent work of Pabbaraju closes this gap by resolving the average-degree conjecture. The proof is based on a simple linear-algebraic method, which I will describe in the talk. An Average-Degree Bound for Hamming Hypergraphs, with Applications to Optimal PAC...- Nataly Brukhim](https://i.ytimg.com/vi/g_wp-OhFxeU/mqdefault.jpg)




