An improved lower bound on the Shannon capacities of complements of odd cycles
HTML articles powered by AMS MathViewer
- by Daniel G. Zhu;
- Proc. Amer. Math. Soc. 153 (2025), 1751-1759
- DOI: https://doi.org/10.1090/proc/17091
- Published electronically: February 7, 2025
- HTML | PDF
Abstract:
Improving a 2003 result of Bohman and Holzman, we show that for $n \geq 1$, the Shannon capacity of the complement of the $2n+1$-cycle is at least $(2^{r_n} + 1)^{1/r_n} = 2 + \Omega (2^{-r_n}/r_n)$, where $r_n = \exp (O((\log n)^2))$ is the number of partitions of $2(n-1)$ into powers of $2$. We also discuss a connection between this result and work by Day and Johnson in the context of graph Ramsey numbers.References
- Noga Alon and Alon Orlitsky, Repeated communication and Ramsey graphs, IEEE Trans. Inform. Theory 41 (1995), no. 5, 1276–1289. MR 1366324, DOI 10.1109/18.412676
- Tom Bohman and Ron Holzman, A nontrivial lower bound on the Shannon capacities of the complements of odd cycles, IEEE Trans. Inform. Theory 49 (2003), no. 3, 721–722. MR 1967195, DOI 10.1109/TIT.2002.808128
- Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas, The strong perfect graph theorem, Ann. of Math. (2) 164 (2006), no. 1, 51–229. MR 2233847, DOI 10.4007/annals.2006.164.51
- A. Nicholas Day and J. Robert Johnson, Multicolour Ramsey numbers of odd cycles, J. Combin. Theory Ser. B 124 (2017), 56–63. MR 3623167, DOI 10.1016/j.jctb.2016.12.005
- Paul Erdős, Robert J. McEliece, and Herbert Taylor, Ramsey bounds for graph products, Pacific J. Math. 37 (1971), 45–46. MR 304241, DOI 10.2140/pjm.1971.37.45
- László Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25 (1979), no. 1, 1–7. MR 514926, DOI 10.1109/TIT.1979.1055985
- Kurt Mahler, On a special functional equation, J. London Math. Soc. 15 (1940), 115–123. MR 2921, DOI 10.1112/jlms/s1-15.2.115
- OEIS Foundation Inc., The on-line encyclopedia of integer sequences, https://oeis.org.
- Avi Wigderson and Jeroen Zuiddam, Asymptotic spectra: theory, applications and extensions, https://staff.fnwi.uva.nl/j.zuiddam/papers/convexity.pdf, 2023.
Bibliographic Information
- Daniel G. Zhu
- Affiliation: Department of Mathematics, Princeton University, Princeton, New Jersey 08544
- MR Author ID: 1398665
- ORCID: 0000-0001-5675-8353
- Email: zhd@princeton.edu
- Received by editor(s): February 26, 2024
- Received by editor(s) in revised form: June 1, 2024, September 13, 2024, and September 30, 2024
- Published electronically: February 7, 2025
- Additional Notes: The author was supported by a Princeton First-Year Fellowship and by the NSF Graduate Research Fellowships Program (grant number: DGE-2039656).
- Communicated by: Isabella Novik
- © Copyright 2025 by the author
- Journal: Proc. Amer. Math. Soc. 153 (2025), 1751-1759
- MSC (2020): Primary 94A24; Secondary 05C38, 05C55
- DOI: https://doi.org/10.1090/proc/17091