Two-level Cretan Matrices Constructed Theoretically and Computationally using SBIBD
N. A. Balonin, Jennifer Seberry

TL;DR
This paper explores the construction of Cretan matrices using both theoretical and computational methods, highlighting their properties and potential applications, especially through incidence matrices and difference sets.
Contribution
It introduces new constructions of Cretan matrices via SBIBD and Hadamard difference sets, comparing theoretical and computational approaches.
Findings
Cretan matrices can be constructed from SBIBD incidence matrices.
Hadamard difference sets enable new Cretan matrix families.
Theoretical and computational methods yield complementary results.
Abstract
Cretan matrices are orthogonal matrices with elements . These may have application in forming some new materials. There is a search for Cretan matrices, especially with high determinant, for all orders. These have been found by both mathematical and computational methods. This paper highlights the differences between theoretical and computational solutions to finding Cretan matrices. It has been shown that the incidence matrix of a symmetric balanced incomplete block design can be used to form Cretan() matrices. We give families of Cretan matrices constructed using Hadamard related difference sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Matrix Theory and Algorithms · Advanced Scientific Research Methods
