5 papers
Improved Upper Bounds for Slicing the Hypercube
Duncan Soiffer, Nathaniel Itty, Christopher D. Rosin +5
A collection of hyperplanes slices all edges of the -dimensional hypercube with vertex set if, for every edge in the hypercube, there exists…
The Karp Dataset
Mason DiCicco, Eamon Worden, Conner Olsen +3
Understanding the mathematical reasoning capabilities of Large Language Models (LLMs) is a central topic in the study of artificial intelligence. This new domain necessitates the c…
Nearest Neighbor Complexity and Boolean Circuits
Mason DiCicco, Vladimir Podolskii, Daniel Reichman
A nearest neighbor representation of a Boolean function is a set of vectors (anchors) labeled by or such that if and only if the closest anchor to $\ve…
Inoculation strategies for bounded degree graphs
Mason DiCicco, Henry Poskanzer, Daniel Reichman
We analyze a game-theoretic abstraction of epidemic containment played on an undirected graph : each player is associated with a node in and can either acquire protection fr…
The Learning and Communication Complexity of Subsequence Containment
Mason DiCicco, Daniel Reichman
We consider the learning and communication complexity of subsequence containment. In the learning problem, we seek to learn a classifier that positively labels a binary string …