CC BY
25
ТЕОРЕТИЧЕСКАЯ И ПРИКЛАДНАЯ МАТЕМАТИКА /
UDC 004.438
doi:10.15217/issn1684-8853.2015.2.2
THREE-LEVEL CRETAN MATRICES OF ORDER 37
N. A. Balonina, Dr. Sc., Tech., Professor, korbendfs@mail.ru
Jennifer Seberryb, PhD, Professor of Computer Science, jennifer_seberry@uow.edu.au
M. B. Sergeeva, Dr. Sc., Tech., Professor, mbse@mail.ru
aSaint-Petersburg State University of Aerospace Instrumentation, 67, B. Morskaia St., 190000,
Saint-Petersburg, Russian Federation
bSchool of Computer Science and Software Engineering, Faculty of Engineering and Information Science,
University of Wollongong, NSW, 2522, Australia
Purpose: This note discusses three-level orthogonal matrices which were first highlighted by J. J. Sylvester. Hadamard matrices, symmetric conference matrices, and weighing matrices are the best known of these matrices with entries from the unit disk. The goal of this note is to develop a theory of such matrices based on preliminary research results. Methods: Extreme solutions (using the determinant) have been established by minimization of the maximum of the absolute values of the elements of the matrices followed by their subsequent classification. Results: We give a three-level Cretan(37). This is new and the first time such a matrix has been found whose order is other than a 2k, k is an even integer. The methods given in this note may be used to construct many more Cretan matrices based on regular Hadamard matrices. Practical relevance: The over-riding aim is to seek Cretan(n) with absolute or relative (local) maximal determinants as they have many applications in image processing and masking. Web addresses are given for other illustrations and other matrices with similar properties. Algorithms to construct Cretan matrices have been implemented in developing software of the research program-complex.
Keywords — Hadamard Matrices, Regular Hadamard Matrices, Orthogonal Matrices, Cretan Matrices.
AMS Subject Classification: 05B20; 20B20.
Introduction
In this and further papers we use some names, definitions, notation differently than we have in the past [1]. This, we hope, will cause less confusion, bring our nomenclature closer to common usage and conform for mathematical purists. We have chosen the use of the word level, instead of value for the entries of a matrix, to conform to earlier writings. We note that the strict definition of an orthogonal matrix, X, of order n, is that XTX = XXT = raIn, where In is the identity matrix of order n. In this paper we consider STS = SST = raIn where ra is a constant. We call these orthogonal matrices [2, 3]. We refer to [2, 4, 5] for definitions not given below.
Definitions
Definition 1. A Cretan(n) (CM) matrix, S, is a orthogonal matrix of order n with entries with moduli < 1, where there must be at least one 1 per row and column. The inner product of a row of CM(n) with itself is the weight ra. STS = SST = ra In. The inner product of distinct rows of CM(n) is zero. A p-level Cretan(n; p; ra) matrix, CM(n; p; ra), has p levels or values for its entries.
Cretan(n), or CM(n) orthogonal matrices are studied in [2, 4]. In more general notation these are can be CM(order), CM(order; number of levels = x), CM(order; number of levels = x; occurrences of
levels = L1, L2, ..., Lx), CM(order; number of levels = x; weight = ra), and CM(order; number of levels = x; weight; occurrences of levels in whole matrix), etc. etc. etc.
The definition of Cretan is not that each variable occurs some number of times per row and column but L1, L 2, ..., Lx times in the whole matrix. So we have CM(n; x; ra; L1, L 2, ..., Lx) so
-0.5 1 1 1 -0.5 1 1 1 -0.5
is a CM(3), a CM(3;2), a CM(3;2;2,1), a CM(3;2;2.25), a CM(3;2;2.25;6,3) depending on which numbers (in brackets) are currently of interest. We call them Cretan matrices because they were first discussed in this generality at a conference in Crete in July, 2014.
The over-riding aim is to seek CM(n) with absolute or relative (local) maximal determinants as they have many applications in image processing and masking [1, 2].
The matrix orthogonality equation STS = = SST = raIn, is a set of n2 scalar equations, giving two kinds of formulae: g(a, b, s) = ra, there are n such equations, and f(a, b, s) = 0, there are n2 - n such equations. We concentrate on two of them: g(a, b, s) = ra, f(a, b, s) = 0.
The entries in raIn which are on the diagonal, are given by the radius equation ra = g(a, b, s), they
ИНФОРМАЦИОННО-УПРАВЛЯЮЩИЕ СИСТЕМЫ
№ 2, 2015
^ TEOPETMHECKAS M nPMKAAAHAI MATEMATMKA
depend on the choice of a, b, s. At least one of the levels has value 1.
The maximal weight ra = n arises from Hadamard matrices, and for symmetric conference matrices ra = n - 1. Orthogonal matrices can have also irrational values for the weight.
The second equation f(a, b, s) = 0 we call the characteristic equation, as it allows us to find a formulae for levels b < s < a.
Definition 2. A regular Hadamard matrix, H, of order 4t, has elements plus one and minus one only. It satisfies the orthogonality equation HTH = HHT = 4tI. The sum of the entries in any row or column is 2-Jt.
We first note that a computer search undertaken recently in Iran found over 31 million inequivalent regular Hadamard matrices of order 36. We use [5] to give our example, H, for this note.
A new Cretan(37, 3)
Construction. Let G(a, b) be the 36x36 regular Hadamard matrix [5] with more ones than minus ones in each row and column, and then the ones replaced by "a" and minus ones replaced by "-b". Let F be the 37x37 matrix
as ...
s
F =
G(a,b)
Then if the radius equations are a2 + 36s2 = ra, 15 a2 + 21b2 + s2 = ra; and the characteristic equations are 16a - 21b = 0, 6a2 -18ab + 12b2 + s2 = 0: F is a Cretan(37;3;27.9388;541,756,72) using the definition (Figure, a and b).
References
1. Balonin N. A., Mironovsky L. A. Hadamard Matrices of Odd Order. Informatsionno-upravliaiushchie siste-my [Information and Control Systems], 2006, no. 3, pp. 46-50 (In Russian).
2. Balonin N. A., Sergeev M. B. Local Maximum Determinant Matrices. Informatsionno-upravliaiushchie sistemy [Information and Control Systems], 2014, no. 1(68), pp. 2-15 (In Russian).
3. Balonin N. A., Seberry Jennifer. Remarks on Extremal and Maximum Determinant Matrices with Moduli of Real Entries < 1. Informatsionno-upravliaiush-
■ Orthogonal matrices: the regular Hadamard matrix H(36) (a) and Cretan(37; 3) (&)
In the Figure the white square is for element "a", black and red (core) square is for element "-b", and blue square is for border "s".
Acknowledgements
The authors also wish to sincerely thank Tamara Balonina for converting this paper into printing format. We acknowledge the use of the http://www.math-scinet.ru and http://www.wolframalpha.com sites for the number and symbol calculations in this paper.
Conclusion
The methods given in this note may be used to construct many more Cretan matrices based on regular Hadamard matrices. The matrices G and F both give completely new Cretan matrices CM(4t, 2) and CM(4t + 1,3). They will be studied in depth in paper of J. Seberry, in preparation and add new members to the set of Cretan matrices constructed with one core and one border, observed in [2, 3, 6]. This strongly suggests we have discovered a new branch of Cretan matrices.
chie sistemy [Information and Control Systems], 2014, no. 5(72), pp. 2-4.
4. Hadamard J. Resolution d'une Question Relative aux Determinants. Bulletin des Sciences Mathématiques, 1893, vol. 17, pp. 240-246 (In French).
5. Seberry Jennifer. Regular Hadamard Matrices of Order 36. Available at: http://www.uow.edu.au/jennie/ matrices/H36/36R.html (accessed 5 February 2015).
6. Balonin N. A., Seberry Jennifer. Two Level Cretan Matrices Constructed via Singer Difference Sets. In-formatsionno-upravliaiushchie sistemy [Information and Control Systems], 2014, no. 6(73), pp. 2-5.
№ 2, 2015 ^
MHOOPMAIiMOHHO-ynPABAfiroWME CMCTEMbl 3
