×

Tight relative \(t\)-designs on two shells in hypercubes, and Hahn and Hermite polynomials. (English) Zbl 1518.05029

Summary: Relative \(t\)-designs in the \(n\)-dimensional hypercube \(\mathcal{Q}_n\) are equivalent to weighted regular \(t\)-wise balanced designs, which generalize combinatorial \(t\)-\((n, k, \lambda)\) designs by allowing multiple block sizes as well as weights. Partly motivated by the recent study on tight Euclidean \(t\)-designs on two concentric spheres, in this paper we discuss tight relative \(t\)-designs in \(\mathcal{Q}_n\) supported on two shells. We show under a mild condition that such a relative \(t\)-design induces the structure of a coherent configuration with two fibers. Moreover, from this structure we deduce that a polynomial from the family of the Hahn hypergeometric orthogonal polynomials must have only integral simple zeros. The Terwilliger algebra is the main tool to establish these results. By explicitly evaluating the behavior of the zeros of the Hahn polynomials when they degenerate to the Hermite polynomials under an appropriate limit process, we prove a theorem which gives a partial evidence that the non-trivial tight relative \(t\)-designs in \(\mathcal{Q}_n\) supported on two shells are rare for large \(t\).

MSC:

05B30 Other designs, configurations
05E30 Association schemes, strongly regular graphs
33C45 Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.)
42C05 Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] E. Bannai, On tight designs,Q. J. Math. Oxford Ser. (2)28(1977), 433-448, doi:10.1093/ qmath/28.4.433. · Zbl 0391.05005
[2] E. Bannai and E. Bannai, Euclidean designs and coherent configurations, in:Combinatorics and Graphs, Amer. Math. Soc., Providence, RI, volume 531 ofContemp. Math., pp. 59-93, 2010, doi:10.1090/conm/531/10457. · Zbl 1231.05019
[3] E. Bannai and E. Bannai, Remarks on the concepts oft-designs,J. Appl. Math. Comput.40 (2012), 195-207, doi:10.1007/s12190-012-0544-1. · Zbl 1296.05017
[4] E. Bannai and E. Bannai, Tightt-designs on two concentric spheres,Mosc. J. Comb. Number Theory4(2014), 52-77,http://mjcnt.phystech.edu/en/article.php?id=78. · Zbl 1314.05230
[5] E. Bannai, E. Bannai and H. Bannai, On the existence of tight relative 2-designs on binary Hamming association schemes,Discrete Math.314(2014), 17-37, doi:10.1016/j.disc.2013.09. 013. · Zbl 1277.05031
[6] E. Bannai, E. Bannai, S. Suda and H. Tanaka, On relativet-designs in polynomial association schemes,Electron. J. Comb.22(2015), Paper 4.47, 17, doi:10.37236/4889. · Zbl 1329.05307
[7] E. Bannai, E. Bannai, H. Tanaka and Y. Zhu, Design theory from the viewpoint of algebraic combinatorics,Graphs Comb.33(2017), 1-41, doi:10.1007/s00373-016-1739-2. · Zbl 1365.05301
[8] E. Bannai, E. Bannai and Y. Zhu, A survey on tight Euclideant-designs and tight relative t-designs in certain association schemes,Proc. Steklov Inst. Math.288(2015), 189-202, doi: 10.1134/s0081543815010149. · Zbl 1319.05025
[9] E. Bannai, E. Bannai and Y. Zhu, Relativet-designs in binary Hamming association scheme H(n,2),Des. Codes Cryptogr.84(2017), 23-53, doi:10.1007/s10623-016-0200-0. · Zbl 1367.05027
[10] E. Bannai and T. Ito,Algebraic Combinatorics. I: Association Schemes, The Benjamin/Cummings Publishing Co., Inc., Menlo Park, CA, 1984. · Zbl 0555.05019
[11] E. Bannai and Y. Zhu, Tightt-designs on one shell of Johnson association schemes,Eur. J. Comb.80(2019), 23-36, doi:10.1016/j.ejc.2018.02.024. · Zbl 1415.05183
[12] A. E. Brouwer, A. M. Cohen and A. Neumaier,Distance-Regular Graphs, volume 18 ofErgebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)], Springer-Verlag, Berlin, 1989, doi:10.1007/978-3-642-74341-2. · Zbl 0747.05073
[13] C. J. Colbourn and J. H. Dinitz (eds.),Handbook of Combinatorial Designs, Discrete Mathematics and its Applications (Boca Raton), Chapman & Hall/CRC, Boca Raton, FL, 2nd edition, 2007, doi:10.1201/9781420010541. · Zbl 1101.05001
[14] C. W. Curtis and I. Reiner,Methods of Representation Theory. Vol. I, Wiley Classics Library, John Wiley & Sons, Inc., New York, 1990, with applications to finite groups and orders, Reprint of the 1981 original, A Wiley-Interscience Publication,https://books.google.si/ books?id=HWm_QgAACAAJ.
[15] E. R. van Dam, J. H. Koolen and H. Tanaka, Distance-regular graphs,Electron. J. Comb.DS22 (2016), Paper No. DS22, 156, doi:10.37236/4925. · Zbl 1335.05062
[16] P. Delsarte, An algebraic approach to the association schemes of coding theory,Philips Res. Rep. Suppl.(1973), vi+97,https://users.wpi.edu/˜martin/RESEARCH/. · Zbl 1075.05606
[17] P. Delsarte, Association schemes andt-designs in regular semilattices,J. Comb. Theory Ser. A 20(1976), 230-243, doi:10.1016/0097-3165(76)90017-0. · Zbl 0342.05020
[18] P. Delsarte, Pairs of vectors in the space of an association scheme,Philips Res. Rep.32(1977), 373-411.
[19] P. Delsarte, Hahn polynomials, discrete harmonics, andt-designs,SIAM J. Appl. Math.34 (1978), 157-166, doi:10.1137/0134012. · Zbl 0429.05031
[20] P. Delsarte, J. M. Goethals and J. J. Seidel, Spherical codes and designs,Geom. Dedicata6 (1977), 363-388, doi:10.1007/bf03187604. · Zbl 0376.05015
[21] P. Delsarte and J. J. Seidel, Fisher type inequalities for Euclideant-designs,Linear Algebra Its Appl.114/115(1989), 213-230, doi:10.1016/0024-3795(89)90462-x. · Zbl 0671.05014
[22] P. Dukes and J. Short-Gershman, Nonexistence results for tight block designs,J. Algebraic Comb.38(2013), 103-119, doi:10.1007/s10801-012-0395-8. · Zbl 1268.05028
[23] A. L. Gavrilyuk, J. Vidali and J. S. Williford, On few-classQ-polynomial association schemes: feasible parameters and nonexistence results,Ars Math. Contemp.20(2021), 103-127, doi: 10.26493/1855-3974.2101.b76. · Zbl 1483.05203
[24] D. Gijswijt, Matrix algebras and semidefinite programming techniques for codes, 2005, arXiv:1007.0906[math.CO]. · Zbl 1113.90101
[25] D. Gijswijt, A. Schrijver and H. Tanaka, New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming,J. Comb. Theory Ser. A113(2006), 1719- 1731, doi:10.1016/j.jcta.2006.03.010. · Zbl 1105.94027
[26] J. T. Go, The Terwilliger algebra of the hypercube,Eur. J. Comb.23(2002), 399-429, doi: 10.1006/eujc.2000.0514. · Zbl 0997.05097
[27] C. D. Godsil,Algebraic Combinatorics, Chapman and Hall Mathematics Series, Chapman & Hall, New York, 1993,https://books.google.si/books?id=eADtlNCkkIMC. · Zbl 0784.05001
[28] S. Kageyama, A property ofT-wise balanced designs,Ars Comb.31(1991), 237-238. · Zbl 0768.05008
[29] B. G. Kodalen, Cometric association schemes, 2019,arXiv:1905.06959[math.CO].
[30] R. Koekoek, P. A. Lesky and R. F. Swarttouw,Hypergeometric Orthogonal Polynomials and Theirq-Analogues, Springer Monographs in Mathematics, Springer-Verlag, Berlin, 2010, doi: 10.1007/978-3-642-05014-5. · Zbl 1200.33012
[31] R. Koekoek and R. F. Swarttouw,The Askey scheme of hypergeometric orthogonal polynomials and itsq-analog, Delft University of Technology, 1998,http://aw.twi.tudelft.nl/ ˜koekoek/askey.html.
[32] Z. Li, E. Bannai and E. Bannai, Tight relative 2- and 4-designs on binary Hamming association schemes,Graphs Comb.30(2014), 203-227, doi:10.1007/s00373-012-1252-1. · Zbl 1295.05275
[33] W. J. Martin and H. Tanaka, Commutative association schemes,Eur. J. Comb.30(2009), 1497- 1525, doi:10.1016/j.ejc.2008.11.001. · Zbl 1228.05317
[34] A. Munemasa, An analogue oft-designs in the association schemes of alternating bilinear forms,Graphs Comb.2(1986), 259-267, doi:10.1007/bf01788100. · Zbl 0652.05009
[35] A. Neumaier and J. J. Seidel, Discrete measures for spherical designs, eutactic stars and lattices,Nederl. Akad. Wetensch. Indag. Math.50(1988), 321-334, doi:10.1016/s1385-7258(88) 80011-8. · Zbl 0657.10033
[36] C. Peterson, On tight6-designs,Osaka Math. J.14(1977), 417-435, doi:10.18910/3990. · Zbl 0381.05016
[37] J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math.6(1962), 64-94, doi:10.1215/ijm/1255631807. · Zbl 0122.05001
[38] M. Sawa, M. Hirao and S. Kageyama,Euclidean Design Theory, SpringerBriefs in Statistics, Springer, Singapore, 2019, doi:10.1007/978-981-13-8075-4. · Zbl 1418.62013
[39] A. Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming,IEEE Trans. Inform. Theory51(2005), 2859-2866, doi:10.1109/tit.2005.851748. · Zbl 1298.94152
[40] I. Schur,Einige S¨atze ¨uber Primzahlen: mit Anwendungen auf Irreduzibilit¨atsfragen, Sitzungsberichte der Preussischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse, Akademie der Wissenschaften in Kommission bei Walter de Gruyter, 1929,https:// books.google.si/books?id=wE3kAAAAMAAJ.
[41] D. Stanton,t-designs in classical association schemes,Graphs Comb.2(1986), 283-286, doi: 10.1007/bf01788103. · Zbl 0651.05016
[42] G. Szeg˝o,Orthogonal Polynomials, American Mathematical Society Colloquium Publications, Vol. XXIII, American Mathematical Society, Providence, R.I., 4th edition, 1975,https: //people.math.osu.edu/nevai.1/SZEGO/. · Zbl 0305.42011
[43] Y.-Y. Tan, Y.-Z. Fan, T. Ito and X. Liang, The Terwilliger algebra of the Johnson scheme J(N, D)revisited from the viewpoint of group representations,Eur. J. Comb.80(2019), 157- 171, doi:10.1016/j.ejc.2018.02.029. · Zbl 1415.05181
[44] H. Tanaka, New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra,Eur. J. Comb.30(2009), 736-746, doi:10.1016/j.ejc.2008.07.018. · Zbl 1220.94052
[45] H. Tanaka, A note on the span of hadamard products of vectors,Linear Algebra Its Appl.430 (2009), 865-867, doi:10.1016/j.laa.2008.09.010. · Zbl 1157.15032
[46] P. Terwilliger, The subconstituent algebra of an association scheme. I,J. Algebr. Comb.1 (1992), 363-388, doi:10.1023/a:1022494701663. · Zbl 0785.05089
[47] P. Terwilliger, The subconstituent algebra of an association scheme. II,J. Algebr. Comb.2 (1993), 73-103, doi:10.1023/a:1022480715311. · Zbl 0785.05090
[48] P. Terwilliger, The subconstituent algebra of an association scheme. III,J. Algebr. Comb.2 (1993), 177-210, doi:10.1023/a:1022415825656. · Zbl 0785.05091
[49] F. Vallentin, Symmetry in semidefinite programs,Linear Algebra Appl.430(2009), 360-369, doi:10.1016/j.laa.2008.07.025. · Zbl 1165.90017
[50] D. R. Woodall, Squareλ-linked designs,Proc. London Math. Soc. (3)20(1970), 669-687, doi:10.1112/plms/s3-20.4.669. · Zbl 0194.32401
[51] Z. Xiang, A Fisher type inequality for weighted regulart-wise balanced designs,J. Comb. Theory Ser. A119(2012), 1523-1527, doi:10.1016/j.jcta.2012.04.008. · Zbl 1245.05019
[52] Z. Xiang, Nonexistence of nontrivial tight8-designs,J. Algebr. Comb.47(2018), 301-318, doi:10.1007/s10801-017-0776-0. · Zbl 1384.05060
[53] H. Yue, B. Hou and S. Gao, Note on the tight relative2-designs onH(n,2),Discrete Math. 338(2015), 196-208, doi:10.1016/j.disc.2014.09.002. · Zbl 1303.05024
[54] Y. Zhu, E. Bannai and E. Bannai, Tight relative2-designs on two shells in Johnson association schemes,Discrete Math.339(2016), 957-973, doi:10.1016/j.disc.2015.10.024 · Zbl 1327.05347
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.