English

New lower bound on the Shannon capacity of C7 from circular graphs

Combinatorics 2019-06-12 v2 Information Theory math.IT

Abstract

We give an independent set of size 367367 in the fifth strong product power of C7C_7, where C7C_7 is the cycle on 77 vertices. This leads to an improved lower bound on the Shannon capacity of C7C_7: Θ(C7)3671/5>3.2578\Theta(C_7)\geq 367^{1/5} > 3.2578. The independent set is found by computer, using the fact that the set {t(1,7,72,73,74)tZ382}Z3825\{t \cdot (1,7,7^2,7^3,7^4) \,\, | \,\, t \in \mathbb{Z}_{382}\} \subseteq \mathbb{Z}_{382}^5 is independent in the fifth strong product power of the circular graph C108,382C_{108,382}. Here the circular graph Ck,nC_{k,n} is the graph with vertex set Zn\mathbb{Z}_{n}, the cyclic group of order nn, in which two distinct vertices are adjacent if and only if their distance (mod nn) is strictly less than kk.

Keywords

Cite

@article{arxiv.1808.07438,
  title  = {New lower bound on the Shannon capacity of C7 from circular graphs},
  author = {Sven Polak and Alexander Schrijver},
  journal= {arXiv preprint arXiv:1808.07438},
  year   = {2019}
}

Comments

5 pages. Some changes have been made based on comments of the referees. Accepted for publication in Information Processing Letters