Hostname: page-component-8448b6f56d-dnltx Total loading time: 0 Render date: 2024-04-19T21:35:01.610Z Has data issue: false hasContentIssue false
  • English
  • Français

Trace, Symmetry and Orthogonality

Published online by Cambridge University Press:  20 November 2018

R. Craigen
R. Craigen*
Affiliation:
Department of Mathematics and Computer Science, University of Lethbridge Lethbridge, Alberta T1K 3M4 email:, craigen@cs.uleth.ca
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Does there exist a circulant conference matrix of order > 2? When is there a symmetric Hadamard matrix with constant diagonal? How many pairwise disjoint, amicable weighing matrices of order n can there be? These are questions concerning which the trace function gives a great deal of insight. We offer easy proofs of the known solutions to the first two, the first being new, and develop new results regarding the latter question. It is shown that there are 2t disjoint amicable weighing matrices of order 2tp, where p is odd, and that this is an upper bound for t ≤ 1. An even stronger bound is obtained for certain cases.

Keywords

Primary: 05B20secondary: 15A1505C50
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 37 , Issue 4 , 01 December 1994 , pp. 461 - 467
Copyright
Copyright © Canadian Mathematical Society 1994

References

1. Brualdi, R. and Ryser, H., Combinatorial Matrix Theory, Encyclopedia of Mathematics and its Applications 39, Cambridge University Press, Cambridge and New York, 1991.Google Scholar
2. Cameron, P. J., Delsarte, P. and J.-M. Goethals, Hemisystems, orthogonal configurations and dissipative conference matrices, Philips J. Res. 34(1979), 147–162.Google Scholar
3. Craigen, R., Constructions for Orthogonal Matrices, Ph.D thesis, University of Waterloo, March 1991.Google Scholar
4. Craigen, R., A new class of weighing matrices with square weights, Bull. Inform. Cybernet. 3(1991), 33–42.Google Scholar
5. Craigen, R., Constructing Hadamard matrices with orthogonal pairs, Ars Combin. (92) 33, 57–64.Google Scholar
6. Delsarte, P., Goethals, J. M. and Seidel, J. J., Orthogonal matrices with zero diagonal, II, Canad. J. Math. 23(1971),816–832.Google Scholar
7. Geramita, A. and Seberry, J., Quadratic Forms, Orthogonal Designs, and Hadamard Matrices, Lecture Notes in Pure and Applied Mathematics 45, Marcel Dekker Inc., New York and Basel, 1979.Google Scholar
8. Goethals, J. M. and Seidel, J. J., Orthogonal matrices with zero diagonal, Canad. J. Math. 19(1967), 1001–1010.Google Scholar
9. Goethals, J. M. and Seidel, J. J., Strongly regular graphs derived from combinatorial designs, Canad. J. Math. 22(1970), 579– 614.Google Scholar
10. Radon, J., Lineare scharen orthogonalen matrizen, Abh. Math. Sem. Univ. Hamburg 1(1922), 1–14.Google Scholar
11. Seidel, J. J., A survey of two-graphs. In: Colloquio Internazionale sulle Théorie Combinatorie, 1973, 482-511.Google Scholar
12. Seidel, J. J., Blokhuis, A. and Wilbrink, H. A., Graphs and association schemes, algebra and geometry, Tech. Rep. EUT 83-WSK-02, Eindhoven University of Technology, 1983.Google Scholar
13. Stanton, R. G. and Mullin, R. C., On the nonexistence of a class of circulant balanced weighing matrices, SIAM J. Appl. Math. 30(1976), 98–102.Google Scholar
14. Wallis, W. D., Certain graphs arising from Hadamard matrices, Bull. Austral. Math. Soc. 1(1969), pp. 325–331.Google Scholar
15. Wallis, W. D., On the relationship between graphs and partially balanced incomplete block designs, Bull. Austral. Math. Soc. 1(1969), 425–430.Google Scholar