A group-theoretic approach to Shannon capacity of graphs and a limit theorem from lattice packings

TL;DR

This paper introduces a group-theoretic method to analyze the Shannon capacity of graphs, extending known bounds and proving convergence results for fractional and fraction graphs using lattice-based independent sets.

Contribution

It develops a unified group-theoretic framework that extends lower bounds on Shannon capacity and proves convergence for a broad class of fraction graphs.

Findings

Shannon capacity of cycle graphs converges to fractional clique covering number as p→∞.

The approach constructs independent sets as subgroups and lattices in powers of fraction graphs.

Circumvents barriers faced by previous linear constructions of independent sets.

Abstract

We develop a group-theoretic approach to the Shannon capacity problem. Using this approach we extend and recover, in a structured and unified manner, various families of previously known lower bounds on the Shannon capacity. Bohman (2003) proved that, in the limit $p\to\infty$, the Shannon capacity of cycle graphs $\Theta(C_p)$ converges to the fractional clique covering number, that is, $\lim_{p \to \infty} p/2 - \Theta(C_p) = 0$. We strengthen this result by proving that the same is true for all fraction graphs: $\lim_{p/q \to \infty} p/q - \Theta(E_{p/q}) = 0$. Here the fraction graph $E_{p/q}$ is the graph with vertex set $\mathbb{Z}/p\mathbb{Z}$ in which two distinct vertices are adjacent if and only if their distance mod $p$ is strictly less than $q$. We obtain the limit via the group-theoretic approach. In particular, the independent sets we construct in powers of fraction graphs are subgroups (and, in fact, lattices). Our approach circumvents known barriers for structured ("linear") constructions of independent sets of Calderbank-Frankl-Graham-Li-Shepp (1993) and Guruswami-Riazanov (2021).