Difference sets and doubly transitive actions on Hadamard matrices
نویسنده
چکیده
Non-affine groups acting doubly transitively on a Hadamard matrix have been classified by Ito. Implicit in this work is a list of Hadamard matrices with non-affine doubly transitive automorphism group. We give this list explicitly, in the process settling an old research problem of Ito and Leon. We then use our classification to show that the only cocyclic Hadamard matrices developed form a difference set with non-affine automorphism group are those that arise from the Paley Hadamard matrices. If H is a cocyclic Hadamard matrix developed from a difference set then the automorphism group of H is doubly transitive. We classify all difference sets which give rise to Hadamard matrices with non-affine doubly transitive automorphism group. A key component of this is a complete list of difference sets corresponding to the Paley Hadamard matrices. As part of our classification we uncover a new triply infinite family of skewHadamard difference sets. To our knowledge, these are the first skewHadamard difference sets to be discovered in non-abelian p-groups with no exponent restriction. As one more application of our main classification, we show that Hall’s sextic residue difference sets give rise to precisely one cocyclic Hadamard matrix. ∗E-mail: [email protected]
منابع مشابه
Extremal doubly even (56, 28, 12) codes and Hadamard matrices of order 28
In [2] Bussemaker and Tonchev constructed six doubly even (56,28, 12) codes from two Hadamard matrices of order 28. But two of them were not distinguished. In [11] and [12] we characterized Hadamard matrices of order 28 and there are exactly 487 Hadamard matrices, up to equivalence. In this paper we show that only two of the above 487 matrices produce six doubly even (56,28,12) codes and that t...
متن کاملThe cocyclic Hadamard matrices of order less than 40
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. This represents a significant extension and completion of work by de Launey and Ito. The theory of cocyclic development is discussed, and an algorithm for determining whether a given Hadamard matrix is cocyclic is describe...
متن کاملThe 2-transitive complex Hadamard matrices
We determine all possibilities for a complex Hadamard matrix H admitting an automorphism group which permutes 2-transitively the rows of H. Our proof of this result relies on the classification theorem for finite 2-transitive permutation groups, and thereby also on the classification of finite simple groups.
متن کاملOn transitive soft sets over semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملm at h . C O ] 1 4 M ay 2 01 3 Some new orders of Hadamard and Skew - Hadamard matrices
We construct Hadamard matrices of orders 4 · 251 = 1004 and 4 · 631 = 2524, and skewHadamard matrices of orders 4 · 213 = 852 and 4 · 631 = 2524. As far as we know, such matrices have not been constructed previously. The constructions use the GoethalsSeidel array, suitable supplementary difference sets on a cyclic group and a new efficient matching algorithm based on hashing techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 119 شماره
صفحات -
تاریخ انتشار 2012