Abstract
Two algorithmic techniques for specifying the existence of a k × k submatrix with elements 0,±1 in a skew and symmetric conference matrix of order n are described. This specification is achieved using an appropriate computer algebra system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Day, J., Peterson, B.: Growth in Gaussian elimination. Amer. Math. Monthly 95, 489–513 (1988)
Geramita, A.V., Seberry, J.: Orthogonal Designs: Quadratic Forms and Hadamard Matrices. Marcel Dekker, New York-Basel (1979)
Koukouvinos, C., Mitrouli, M., Seberry, J.: Growth in Gaussian elimination for weighing matrices, W(n,n − 1). Linear Algebra Appl. 306, 189–202 (2000)
Kravvaritis, C., Mitrouli, M., Seberry, J.: On the growth problem for skew and symmetric conference matrices. Linear Algebra Appl. 403, 183–296 (2005)
Wilkinson, J.H.: The Algebraic Eigenvalue Problem. Oxford University Press, London (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kravvaritis, C., Mitrouli, M., Seberry, J. (2005). Counting Techniques Specifying the Existence of Submatrices in Weighing Matrices. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2005. Lecture Notes in Computer Science, vol 3718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11555964_25
Download citation
DOI: https://doi.org/10.1007/11555964_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28966-1
Online ISBN: 978-3-540-32070-8
eBook Packages: Computer ScienceComputer Science (R0)