Skip to main content
Top
Published in: Designs, Codes and Cryptography 10/2020

31-07-2020

Relative t-designs in Johnson association schemes for P-polynomial structure

Authors: Yan Zhu, Naoki Watamura

Published in: Designs, Codes and Cryptography | Issue 10/2020

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Relative t-designs are defined in both P- and Q-polynomial association schemes. In this paper, we investigate relative t-designs in Johnson association schemes J(vk) for P-polynomial structure. It is known that each nontrivial shell of J(vk) is identified with the product of two smaller Johnson association schemes. We prove that relative t-designs in J(vk) supported by one shell are equivalent to weighted \(\mathcal T\)-designs in the shell (as product of association schemes) for \(\mathcal T=\{(t_1,t_2) \mid 0\le t_1,t_2\le t\}\). We study the existence problem of tight relative t-designs on one shell of J(vk) for \(t=2,3\). We propose an algorithm to explicitly construct a family of non-trivial tight relative 2-designs. In addition, we obtain tight relative 3-designs for some special parameters.
Appendix
Available only for authorised users
Literature
1.
go back to reference Bannai E., Bannai E., Bannai H.: On the existence of tight relative 2-designs on binary Hamming association schemes. Discret. Math. 314(1), 17–37 (2014).MathSciNetCrossRef Bannai E., Bannai E., Bannai H.: On the existence of tight relative 2-designs on binary Hamming association schemes. Discret. Math. 314(1), 17–37 (2014).MathSciNetCrossRef
2.
go back to reference Bannai E., Bannai E., Suda S., Tanaka H.: On relative \(t\)-designs in polynomial association schemes. Electron. J. Combin. 22(4), 4–47 (2015).MathSciNetCrossRef Bannai E., Bannai E., Suda S., Tanaka H.: On relative \(t\)-designs in polynomial association schemes. Electron. J. Combin. 22(4), 4–47 (2015).MathSciNetCrossRef
3.
go back to reference Bannai E., Bannai E., Tanaka H., Zhu Y.: Design theory from the viewpoint of algebraic combinatorics. Graphs Combin. 33(1), 1–41 (2017).MathSciNetCrossRef Bannai E., Bannai E., Tanaka H., Zhu Y.: Design theory from the viewpoint of algebraic combinatorics. Graphs Combin. 33(1), 1–41 (2017).MathSciNetCrossRef
4.
go back to reference Bannai E., Bannai E., Zhu Y.: Relative \(t\)-designs in binary Hamming association scheme \({H}(n, 2)\). Des. Codes Cryptogr. 84, 23–53 (2017).MathSciNetCrossRef Bannai E., Bannai E., Zhu Y.: Relative \(t\)-designs in binary Hamming association scheme \({H}(n, 2)\). Des. Codes Cryptogr. 84, 23–53 (2017).MathSciNetCrossRef
5.
go back to reference Bannai E., Ito T.: Algebraic Combinatorics. Benjamin/Cummings, Menlo Park (1984).MATH Bannai E., Ito T.: Algebraic Combinatorics. Benjamin/Cummings, Menlo Park (1984).MATH
6.
go back to reference Bannai E., Zhu Y.: Tight \(t\)-designs on one shell of Johnson association schemes. Eur. J. Combin. 80, 23–36 (2019).MathSciNetCrossRef Bannai E., Zhu Y.: Tight \(t\)-designs on one shell of Johnson association schemes. Eur. J. Combin. 80, 23–36 (2019).MathSciNetCrossRef
7.
go back to reference Delsarte P.: An algebraic approach to the association schemes of coding theory. PhD thesis, Universite Catholique de Louvain (1973). Delsarte P.: An algebraic approach to the association schemes of coding theory. PhD thesis, Universite Catholique de Louvain (1973).
8.
go back to reference Delsarte P.: Pairs of vectors in the space of an association scheme. Philips Res. Rep. 32(5–6), 373–411 (1977).MathSciNet Delsarte P.: Pairs of vectors in the space of an association scheme. Philips Res. Rep. 32(5–6), 373–411 (1977).MathSciNet
9.
go back to reference Delsarte Ph, Seidel J.J.: Fisher type inequalities for Euclidean \(t\)-designs. Linear Algebra Its Appl. 114, 213–230 (1989).MathSciNetCrossRef Delsarte Ph, Seidel J.J.: Fisher type inequalities for Euclidean \(t\)-designs. Linear Algebra Its Appl. 114, 213–230 (1989).MathSciNetCrossRef
10.
go back to reference Li Z., Bannai E., Bannai E.: Tight relative 2-and 4-designs on binary Hamming association schemes. Graphs Combin. 30(1), 203–227 (2014).MathSciNetCrossRef Li Z., Bannai E., Bannai E.: Tight relative 2-and 4-designs on binary Hamming association schemes. Graphs Combin. 30(1), 203–227 (2014).MathSciNetCrossRef
14.
go back to reference Yue H., Hou B., Gao S.: Note on the tight relative 2-designs on \({H} (n, 2)\). Discret. Math. 338(2), 196–208 (2015).MathSciNetCrossRef Yue H., Hou B., Gao S.: Note on the tight relative 2-designs on \({H} (n, 2)\). Discret. Math. 338(2), 196–208 (2015).MathSciNetCrossRef
15.
go back to reference Zhu Y., Bannai E., Bannai E.: Tight relative 2-designs on two shells in Johnson association schemes. Discret. Math. 339(2), 957–973 (2016).MathSciNetCrossRef Zhu Y., Bannai E., Bannai E.: Tight relative 2-designs on two shells in Johnson association schemes. Discret. Math. 339(2), 957–973 (2016).MathSciNetCrossRef
Metadata
Title
Relative t-designs in Johnson association schemes for P-polynomial structure
Authors
Yan Zhu
Naoki Watamura
Publication date
31-07-2020
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 10/2020
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-020-00766-3

Other articles of this Issue 10/2020

Designs, Codes and Cryptography 10/2020 Go to the issue

Premium Partner