Abstract
Graphical designs are the extension of spherical designs to finite graphs from the viewpoint of quadrature formulas. In this paper, we investigate optimal graphical designs on hypercubes, especially the conjecture proposed by Babecki that the Hamming code is an optimal graphical design on the hypercube. We prove that this conjecture is not true using certain binary t-error-correcting BCH codes. We also obtain extremal graphical designs on the furthest distance graph of 13 families of distance-regular graphs with classical parameters. This generalizes the result that any 1-intersecting family achieving Erdös–Ko–Rado type bound is an extremal graphical design on the Kneser graph.
Similar content being viewed by others
Data deposition information
The manuscript has no associated data.
References
Babecki C.: Codes, cubes, and graphical designs. J. Fourier Anal. Appl. 27(5), 1–34 (2021).
Bannai E., Ito T.: Algebraic Combinatorics I: Association Schemes. Benjamin/Cummings, Menlo Park, CA (1984).
Bannai E., Bannai E., Ito T., Tanaka R.: Algebraic Combinatorics. De Gruyter Series in Discrete Mathematics and Applications 5, De Gruyter (2021).
Brouwer A.E., Cioabă S.M., Ihringer F., McGinnis M.: The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. J. Combin. Theory Ser. B 133, 88–121 (2018).
Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer, Berlin (1989).
Brouwer A.E., Godsil C.D., Koolen J.H., Martin W.J.: Width and dual width of subsets in polynomial association schemes. J. Combin. Theory Ser. A 102(2), 255–271 (2003).
Chihara L., Stanton D.: Association schemes and quadratic transformations for orthogonal polynomials. Graphs Combin. 2(1), 101–112 (1986).
Ciobua S.M., Gupta H.: On the eigenvalues of Grassmann graphs, Bilinear forms graphs and Hermitian forms graphs. Graphs Combin. 38, 30 (2022).
Delsarte P.: An Algebraic Approach to the Association Schemes of Coding Theory. PhD thesis, Universite Catholique de Louvain (1973).
Delsarte P.: Association schemes and \(t\)-designs in regular semilattices. J. Combin. Theory Ser. A 20(2), 230–243 (1976).
Delsarte P., Goethals J.M., Seidel J.J.: Spherical codes and designs. Geom. Dedicata 6(3), 363–388 (1977).
Erdös P., Ko C., Rado R.: Intersection theorems for systems of finite sets. Q. J. Math. 12, 313–320 (1961).
Golubev K.: Graphical designs and extremal combinatorics. Linear Algebra Appl. 604, 490–506 (2020).
Kasami T.: Weight distributions of Bose-Chaudhuri-Hocquenghem codes. Coordinated Science Laboratory Report no. R-317 (1966).
Luz C.J.: A characterization of Delsarte’s linear programming bound as a ratio bound. Linear Algebra Appl. 423(1), 99–108 (2007).
MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1977).
Sobolev S.L.: Cubature formulas on the sphere which are invariant under transformations of finite rotation groups. In: Doklady Akademii Nauk, Vol. 146, pp. 310–313. Russian Academy of Sciences (1962).
Steinerberger S.: Generalized designs on graphs: sampling, spectra, symmetries. J. Graph Theory 93(2), 253–267 (2020).
Tanaka H.: Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs. J. Combin. Theory Ser. A 113(5), 903–910 (2006).
Tanaka H.: Vertex subsets with minimal width and dual width in \(Q\)-polynomial distance-regular graphs. Electron. J. Combin. 18(1), Paper 167, 32 (2011).
Tanaka H.: The Erdös-Ko-Rado theorem for twisted Grassmann graphs. Combinatorica 32(6), 735–740 (2012).
Acknowledgements
The author would like to thank Eiichi Bannai and Yaokun Wu for many valuable comments and discussions. The research is supported by National Natural Science Foundation of China No. 11801353.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interest
The author declares no conflict of interest.
Additional information
Communicated by J. H. Koolen.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Zhu, Y. Optimal and extremal graphical designs on regular graphs associated with classical parameters. Des. Codes Cryptogr. 91, 2737–2754 (2023). https://doi.org/10.1007/s10623-023-01231-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-023-01231-7
Keywords
- Graphical designs
- Optimal graphical designs
- Extremal graphical designs
- Binary t-error-correcting BCH codes