International Journal of Mathematics Trends and Technology
Volume 11 | Number 2 | Year 2014 | Article Id. IJMTT-V11P516 | DOI : https://doi.org/10.14445/22315373/IJMTT-V11P516
We have all possible parameter of 2-class association schemes having the property that suitable (1, -1)- linear combinations of their association matrices yield the blocks of a Hadamard matrix (H-matrix) of certain classical form of Paley and Williamson. Some 2-class association schemes with the above parameters are identified. The known Hadamard Coherent Configurations or 2-Class Association Schemes (CC’s or 2-AS’s) listed in Table 2 do not yield H-matrices of new order. However we have forwarded new methods of constructing H-matrices of the forms II and III. The developed technique gives several easy constructions of H-matrix from any 2-AS, whose parameters are given.
[1] P. P. Alejandro, R. A. Bailey and, P. J. Cameron, Association schemes and permutation Groups, Discrete Mathematics, Vol. 266, pp. 47-67, 2003.
[2] A. Bonato, W. H. Holzmann and H. Kharaghani, Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property, Electronic Jr. of Combinatorics, Vol. 8(1), Pdf. , 2001.
[3] A. E. Brouwer, Strongly regular graphs in: The CRC handbook of Combinatorial Designs, (ed. C. J. Colbourn and J. H. Dinitz), pp. 667-685, 1996.
[4] W. H. Clatworthy, et al., Tables of Two-associate class Partially Balanced Designs, National Bureau of Standards, Applied Mathematics, Series No. 63, Washington D.C., pp. 151-184, 1973.
[5] M. Hall, Jr., Combinatorial Theory, Blaisdell Publishing co., Toronto, Ontario, 1967.
[6] A. Hanaki and I. Miyamoto, Classification of association schemes with small vertices, http: // kissme.shindu-u.ac.jp/as/
[7] A. Hedayat and W. D. Wallis, Hadamard matrices and their applications, Annals of Statistics, Vol. 6, pp. 1184-1238, 1978.
[8] Z. Janko, H. Kharaghani, and V. D. Tonchev, Bush-type Hadamard matrices and symmetric designs, Journal of Combinatorial Designs, Vol. 9(1), pp. 72-78, 2001.
[9] R. Mathon and A. Rosa, Tables of parameters of BIBDs with r≤ 41 Including Existence, Enumeration and Resolvability Results: An Update, Ars Combinatoria, Vol. 32, pp. 65-96, 1992.
[10] B. D. Mckay and E. Spence, The classification of regular two graphs on 36 and 38 vertices, Australas. Jr. Combinatorics, Vol.24, pp. 293-300, 2001.
[11] M. Muzychuk and Q. Xiang, Symmetric Bush-type Hadamard Matrices of order 4m4 Exists for All Odd m, Proceedings of American Mathematical Society, Vol. 134, pp. 2197-2204, 2006.
[12] D. Raghavarao, Construction and Combinatorial Problems in Design of Experiments, Dover, New York, 1988.
[13] J. Seberry, Library of Hadamard matrices, http://www.uow.edu.au/~jennie/hadamard.html, 2001.
[14] M. K. Singh, K. Sinha and Sanpei Kageyama, A construction of Hadamard matrices from BIBD (2k2-2k+1, k, 1), Australas Journal of Combinatorics, Vol. 26, pp. 93-97, 2002.
[15] M. K. Singh and S. N. Singh, Hadamard Matrices from two-class association schemes, International Jr. of Mathematical Modeling, Simulation and Applications, Vol. 02 (02), pp. 198-209, 2009.
[16] E. Spence, Regular Two-Graphs on 36 Vertices, Linear Algebra and its Application, pp. 226-228, 1995.
[17] E. Spence, Strongly Regular Graphs on at most 64 vertices, http://www.maths.gla.ac.uk/ es/srgraphs.html.
S. N. Singh, Om Prakash Dubey, "On the Parameters of 2- Class Hadamard Association Schemes," International Journal of Mathematics Trends and Technology (IJMTT), vol. 11, no. 2, pp. 112-116, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V11P516
PDF 
Abstract 
Keywords 
References 
Citation