Generalized Hadamard matrices

DOI10.1023/A:1008245910019MaRDI QIDQ1364211zbMATH OpenOpenAlexFDO

Publication date 2 February 1998

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008245910019

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of finite geometries (05B25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Finite affine and projective planes (geometric aspects) (51E15)

Review text

Let \(\pi\) be a projective plane of order \(n\) such that \(\pi\) admits a group \(G\) of \(n\) elations each with axis \(L\) and center \(P\in L\). The existence of the elation group \(G\) is equivalent to the existence of a matrix \(H=(g_{ij})\) of order \(n\) with entries \(g_{ij}\) from \(G\) such that whenever \(m\not= k\) the set \(\{g_{mi}g_{ki}^{-1}\mid i=1,\dots,n\}\) contains each element of \(G\) once and only once. The author adds two conditions: (ii) \(g_{1i}=g_{i1}=1\) for each \(i\) and (iii) \(g_{ij}=g_{ji}^{-1}\) for all \(i,j\), and proves that \(G\) is a \(2\)-group and \(n=2^r\), and that if \(G\) is abelian or \(n\) is non-square \(G\) is elementary abelian. The proof uses character theory, in particular the Frobenius reciprocity theorem, quite ingeniously.

Recommendations

Cited in

(15)

This page was built for publication: Generalized Hadamard matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364211)