zbMATH — the first resource for mathematics

On linear shift representations. (English) Zbl 1346.20071
From the text: We introduce and develop the concept of (linear) shift representation. This derives from a certain action on 2-cocycle groups that preserves both cohomological equivalence and orthogonality for cocyclic designs, discovered by K. J. Horadam. Detailed information about fixed point spaces and reducibility is given. We also discuss results of computational experiments, including the calculation of shift orbit structure and searching for orthogonal cocycles.
We now summarize the content of the paper. In Section 2 we prove elementary facts about shift representations. The main results of Section 3 are a determination of fixed points under shift action in the full cocycle space, and a bound on the dimension of the fixed coboundary space. We thereby solve most of Research Problem 55 (1) in [K. J. Horadam, Hadamard matrices and their applications. Princeton: Princeton University Press (2007; Zbl 1145.05014)]. Some relevant linear group theory is then given in Section 4. This serves as background for Section 5, where we establish that a shift representation is hardly ever completely reducible. In fact, we provide criteria for deciding irreducibility and complete reducibility. As an illustration of the practical nature of our approach, in the final section we describe new results obtained from our Magma [W. Bosma et al., J. Symb. Comput. 24, No. 3-4, 235-265 (1997; Zbl 0898.68039)] implementation of procedures to compute with shift representations. Open questions arising from the computational work are posed.

20J05 Homological methods in group theory
05B20 Combinatorial aspects of matrices (incidence, Hadamard, etc.)
20C15 Ordinary representations and characters
20H30 Other matrix groups over finite fields
Full Text: DOI
[1] Bosma, W.; Cannon, J.; Playoust, C., The magma algebra system. I. the user language, J. Symb. Comput., 24, 3-4, 235-265, (1997) · Zbl 0898.68039
[2] de Launey, W.; Flannery, D. L., Algebraic design theory, Mathematical Surveys and Monographs, vol. 175, (2011), American Mathematical Society Providence, RI · Zbl 1235.05001
[3] de Launey, W.; Flannery, D. L.; Horadam, K. J., Cocyclic Hadamard matrices and difference sets, Discrete Appl. Math., 102, 1-2, 47-61, (2000) · Zbl 0956.05026
[4] Dixon, J. D., The structure of linear groups, (1971), Van Nostrand Reinhold New York · Zbl 0213.03301
[5] R. Egan, D.L. Flannery, P. Ó Catháin, Classifying cocyclic Butson Hadamard matrices, 2014, submitted for publication. · Zbl 1329.05040
[6] Flannery, D. L., Calculation of cocyclic matrices, J. Pure Appl. Algebra, 112, 2, 181-190, (1996) · Zbl 0867.20043
[7] Flannery, D. L., Cocyclic Hadamard matrices and Hadamard groups are equivalent, J. Algebra, 192, 749-779, (1997) · Zbl 0889.05032
[8] Flannery, D. L.; O’Brien, E. A., Computing 2-cocycles for central extensions and relative difference sets, Commun. Algebra, 28, 1939-1955, (2000) · Zbl 0999.20047
[9] Horadam, K. J., Hadamard matrices and their applications, (2007), Princeton University Press Princeton, NJ · Zbl 1198.15001
[10] Horadam, K. J., The shift action on 2-cocycles, J. Pure Appl. Algebra, 188, 1-3, 127-143, (2004) · Zbl 1043.20026
[11] Ito, N., On Hadamard groups, J. Algebra, 168, 3, 981-987, (1994) · Zbl 0906.05012
[12] LeBel, A.; Flannery, D. L.; Horadam, K. J., Group algebra series and coboundary modules, J. Pure Appl. Algebra, 214, 7, 1291-1300, (2010) · Zbl 1201.20003
[13] LeBel, A.; Horadam, K. J., Direct sums of balanced functions, perfect nonlinear functions, and orthogonal cocycles, J. Comb. Des., 16, 3, 173-181, (2008) · Zbl 1136.94006
[14] Catháin, P. Ó; Röder, M., The cocyclic Hadamard matrices of order less than 40, Des. Codes Cryptogr., 58, 1, 73-88, (2011) · Zbl 1246.05033
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.