2 papers
cs.IT2026
Improved lower bounds for the Shannon capacity of odd cycles
Nathaniel Itty, Christopher D. Rosin, Chase Carstensen +1
The Shannon capacity of a graph quantifies the maximum rate at which information can be transmitted with zero error over a noisy channel. It is lower bounded by $α(G^d…
cs.AI2026
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…