Papex

Preprint · arXiv · 23 Jul 2026 · Computer science · Not signed on Papex

Improved lower bounds for the Shannon capacity of odd cycles

Nathaniel Itty, Christopher D. Rosin, Chase Carstensen, Daniel Reichman

AI use, as the source states it

“The constructions were discovered through iterative interactions with a Large Language Model (LLM), illustrating the potential of LLMs for finding explicit combinatorial constructions.”

Named here, or see a mistake? Write to privacy@papex.org.