Proof of the circulant Hadamard conjecture
Ronald Orozco Lopez
Abstract
In this paper the circulant Hadamard conjecture is proved.
Keywords: Schur ring, decimation, circulant Hadamard matrices
Mathematics Subject Classification: 05B20, 05E15,94B25
1 Introduction
An Hadamard matrix H is an n by n matrix all of whose entries are +1 or
−1 which satisfies HHt=nIn, where Ht is the transpose of H
and In is the unit matrix of order n. It is also known that, if an
Hadamard matrix of order n>1 exists, n must have the value 2 or be
divisible by 4. There are several conjectures associated with Hadamard matrices.
The main conjecture concerns its existence. This states that an Hadamard matrix exists for
all multiple order of 4. Another very important conjecture is the following
Conjecture 1**.**
There is no circulant Hadamard matrix with order 4n, n>1.
This conjecture is known as Ryser conjecture[1]. The only circulant Hadamard matrix known is
[TABLE]
On the circulant Hadamard conjecture the first significant result was made by R.J. Turyn [2]
using arguments from algebraic number theory. He prove that if a circulant Hadamard matrix of
order n exists then n must be of the form n=4m2 for some odd integer m which is not a
prime-power. Another important result was obtained by Brualdi in [4]. He shown that no circulant
Hadamard matrix is symmetric. Many other important results about this conjecture can be found in [5],
[6],[7],[8] and [9].
The author considers that to reach the proof of the conjectures related to Hadamard matrices and
in general those related with binary sequences it is important to understand the structure of
the binary cube Z24n. For this reason was shown in [10],[11],[12] the
relationship between Hadamard matrices and Schur ring on the group Z24n. Some concepts
that we will use in this paper will be given. We start with the definition of Schur ring.
Let G be a finite group with
identity element e and C[G] the group algebra of all formal sums
∑g∈Gagg, ag∈C, g∈G. For T⊂G, the element ∑g∈Tg will
be denoted by T. Such an element is also called a simple quantity.
The transpose of T=∑g∈Gagg is defined as T⊤=∑g∈Gag(g−1). Let {T0,T1,...,Tr} be a partition of G and let S be the subspace
of C[G] spanned by T1,T2,...,Tr. We say that S is
a Schur ring (S-ring, for short) over G if:
-
T0={e},
2. 2.
for each i, there is a j such that Ti⊤=Tj,
3. 3.
for each i and j, we have Ti Tj=∑k=1rλi,j,kTk, for constants λi,j,k∈C.
The numbers λi,j,k are the structure constants of S with respect to the linear base
{T0,T1,...,Tr}. The sets Ti are called the
basic sets of the S-ring S. Any union of them is called an S-sets. Thus,
X⊆G is an S-set if and only if X∈S. The set of all S-set is closed
with respect to taking inverse and product. Any subgroup of G that is an S-set, is called an
S-subgroup of G or S-group (For details, see [14],[15]). A partition
{T0,...,Tr} of G is called Schur partition or S-partition
if T0={e} and if for each i there is some j such that
Ti−1={g−1:g∈Ti}=Tj. It is known that there is a 1-1 correspondence between
S-ring over G and S-partition of G. By using this correspondence, in this paper we will
refer to an S-ring by mean of its S-partition.
Let G be a permutation automorphic subgroup of Aut(Z2n) and let
S(Z2n,G) denote an S-ring on Z2n. Some S-ring importants
in Z2n are:
-
S(Z2n,Sn).
Let ω(X) denote the Hamming weight of X∈Z2n. Thus, ω(X) is the number of
+ in any binary sequences X of Z2n. Now let Gn(k) denote the subset of
Z2n such that ω(X)=k for all X∈Gn(k), where 0≤k≤n.
We let Ti=Gn(n−i). It is straightforward to prove that the partition
S(Z2n,Sn)={Gn(0),...,Gn(n)} induces an S-partition over
Z2n, where Sn≤Aut(Z2n) is the permutation group on n objects.
2. 2.
S(Z2n,Cn).
Let C denote the cyclic permutation on the components + and − of X in
Z2n such that
[TABLE]
that is, C(xi)=x(i+1)(modn). The permutation C is a generator of cyclic group
Cn=⟨C⟩ of order n. Let
XC=OrbCnX={Ci(X):Ci∈Cn}. Therefore, Cn defines a partition in
equivalent class on Z2n which is an S-partition.
3. 3.
S(Z2n,Δn).
Let δa∈Sn act on X∈Z2n by decimation, that is,
δa(xi)=xai(modn) for all xi in X, (a,n)=1 and let Δn denote
the set of this δa. The set Δn is a group of order ϕ(n) isomorphic to
Zn∗, the group the units of Zn, where ϕ is called the Euler totient function.
Clearly S(Z2n,Δn) is an S-partition of Z2n.
4. 4.
S(Z2n,Hn).
We note by RY the reversed sequence RY=(yn−1,...,y1,y0) of Y and let Hn
denote the permutation automorphic subgroup Hn={1,R}≤Sn≤Aut(Z2n).
Hence Hn defines a partition on Z2n and S(Z2n,Hn) is a
Schur ring.
In [11] was shown that if there is a circulant Hadamard matrix, then must be contained in
G4m2(2m2−m). Let Sym(Z24n) denote the S-subgroup of all symmetric binary
sequences in Z24n. By the result of Brualdi, no circulant Hadamard matrix exists in
Sym(Z24n). As we want circulant matrices, then the search must be do in
S(Z2n,Cn). Finally, in the following section the relationship
between of the Schur ring S(Z24n,Δ4n) and the circulant Hadamard matrices
will be shown.
Let A be a alphabet and let A∗ denote all finite words defined
on A. Any subsequence of consequtive letters of a word is a subword.
Given a word w=s1s2⋯sn, the number n is called the length of w and we denoted
this by ∣w∣. A subset
X⊆A∗ is a code if it satisfies the following condiction:
For all n,m≥1 and x1,...,xn,y1,...,ym∈X
[TABLE]
In [13] was shown the relationship between S-ring on Z2n and binary codes. In particular
were used codes for to construct S-subgroups over Z2n. An important result obtained is
that X={X,CX,C2X,...,Cn−1X} is a base for all Z2n, with X=−+++⋯+++.
Then we will use this base to construct words that could be circulant Hadamard matrices.
Let YG denote the orbit of some Y in Z2n under the action of G. If for a code
X it is true that X=YG for some Y in Z2n, then we will say that X
is a G-code.
This paper is organized as follows. In section 2 some results about S-subgroups of decimation
In(a) in S(Z2n,Δn) are obtained. In particular will
be shown that if ⟨a⟩≤⟨b⟩, then
In(b)≤In(a). This theorem is the great importance because say us
that we must search circulant Hadamard matrices in In(x) only if x has order a
prime number module n. In the section 3 the conjecture is proved. First, it is shown that
if HC is a circulant Hadamard matrix, then its orbit under the action of
Δ4n has order 2, where HC is fixed o reversed by all decimation in Δ4n.
Then we take H in I4n(x) with xp≡1(mod4n), p a prime, and we
suppose that H either is fixed or is reversed under the action of δ2n+x. The idea is
to show that H seen as a word has length an even number in contradiction with the result obtain
by Turyn.
2 Schur ring In(a)
In this section, we will construct Δn-codes for S-subgroups of
S(Z2n,Δn). We will use the commutation relation
Ciδa=δaCia for to prove all of results.
Let
[TABLE]
denote the autocorrelation vector of Y in Z2n, where
[TABLE]
is the periodic autocorrelation function at shift k of Y.
Let A(Z2n)
denote the set of all autocorrelation vectors and let
θ:Z2n→A(Z2n) be the map defined by
θ(Y)=(PY(0),PY(1),…,PY(n−1)).
The decimation group Δn do not alter the set of values which PX(k) takes
on, but merely the order in which they appear, i.e., if Y=δaX then
PY(k)=PX(ka). Therefore, we have the commutative diagram
[TABLE]
and θ∘δr=δr∘θ.
Let Y∈Z2n such that θ(Y)=(n,d,d,...,d). Such a binary sequence is known as
binary sequence with 2-levels autocorrelation value and are important by its applications on
telecommunication. We want to construct a Δn-code for some S-subgroup H of
S(Z2n,Δn) containing such Y. From (2.1) is followed that
θ(Y)=δaθ(Y)=θ(δaY), for all δa∈Δn. Hence Y
and δaY have the same autocorrelation vector. For Y fulfilling δaY=Y for some
δa in Δn we have the following definition
Definition 1**.**
Let a be a unit in Zn∗. A word Y in Z2n is δa-invariant
if δaY=Y. Denote by In(a) the set of these Y.
If Y is in In(a), then δrY is in In(a), too. Also
δa(YZ)=δaYδaZ=YZ for all Y,Z in In(a). Then
In(a) is an S-subgroup of S(Z2n,Δn). Now, we shall see
that all factorization of words in In(a) is relationated with cyclotomic coset
of a module n. First, we have the following definition
Definition 2**.**
Let a relative prime to n. The cyclotomic coset of a module n is defined by
[TABLE]
where sat≡s(modn). A subset {s1,s2,…,sr} of
Zn is called complete set of representatives of cyclotomic coset of a modulo n if
Cs1,Cs2,…, Csr are distinct and are a
partition of Zn.
Take Y=Ci1XCi2X⋯CirX in In(a) with X=−++⋯++.
We want δaY=Y. Then
[TABLE]
since δaX=X. As must be δaY=Y, then ik≡a−1ij(modn) or
ij≡aik(modn) for
1≤k,j≤r. Let CsX denote the word CsXCsaX⋯Csats−1X.
Then all Y in In(a) has the form
Y=Cs1ϵ1XCs2ϵ2X⋯CsrϵrX, with ϵi=0,1 and s1,s2,...,sr is a complete set of
representative of cyclotomic coset of a module n. As In(a) is an S-subgroup in
S(Z2n,Δn), δrCsiX=CsjX and
[TABLE]
is a Δn-code for In(a). Hence XI(a)∗
has order 2r+1, where r is the number of cyclotomic cosets of a module n
The following theorem is fundamental for the proof of the circulant Hadamard conjecture. This
show us the relationship between S-subgroups In(a) and In(b)
when ⟨a⟩ and ⟨b⟩ are subgroups from the other.
Firstly, we obtain the following
Lemma 1**.**
Take a codeword CsX in XIn(a).
Then δrCsX=Csr−1X for all δr in Δn.
Proof.
We have
[TABLE]
∎
Theorem 1**.**
If ⟨b⟩ is a subgroup of ⟨a⟩, then
In(a)⊆In(b).
Proof.
Let C1a and C1b denote the classes {1,a,a2,...,at−1}
and {1,b,b2,...,bs−1}. By hypothesis
⟨b⟩≤⟨a⟩, then C1b⊆C1a. Hence there exists yi in ⟨a⟩ such that
[TABLE]
and k=[⟨a⟩:⟨b⟩]. As clearly
yiC1b=Cyib, then
[TABLE]
and C1aX∈In(b). Now, take δr in Δn.
Then
[TABLE]
From Lemma 1 is followed that Cr−1aX is in
In(b) for all r∈Zn∗. Accordingly
In(a)⊆In(b).
∎
We will use the above theorem to obtain the following corollaries
Corollary 1**.**
Let a be an unity in Z4n∗ of order 2k. Then I4n(a)⊂I4n(ak).
Proof.
It is enough with to note that {1,ak} is a subgroup of ⟨a⟩.
∎
Corollary 2**.**
Let
[TABLE]
a serie of cyclic subgroups of ⟨b⟩. Then
[TABLE]
Proof.
A consequence trivial of Theorem 1.
∎
Finally, we will use the previous results to show some lattice of S-subgroups I4n(a)
in Z24n ordered by inclusion.
2.1 Some Example
S-subgroups I4n(a) in Z24n was obtained by using sage. It was taken
into account that I4n(a)=I4n(a−1). Lattice of S-subgroups
I4n(a) in Z24n ordered by inclusion will be shown for 4n=24,36,60,196,668.
2.1.1 4n=24
The cyclic subgroups of Z24∗ are ⟨5⟩,⟨7⟩
,⟨11⟩, ⟨13⟩, ⟨17⟩,
⟨19⟩ and ⟨23⟩, all of order 2. Then the lattice of
S-subgroups I24(a) in Z224 is
\mathbb{I}_{24}(5)$$\mathbb{I}_{24}(7)$$\mathbb{I}_{24}(11)$$\mathbb{I}_{24}(13)$$\mathbb{I}_{24}(17)$$\mathbb{I}_{24}(19)$$\mathbb{I}_{24}(23)$$\mathbb{I}_{24}(1)=\mathbb{Z}_{2}^{24}
2.1.2 4n=36
The cyclic subgroups of Z36∗ are ⟨5⟩, ⟨7⟩,
⟨11⟩, ⟨13⟩, ⟨17⟩,
⟨19⟩ and ⟨35⟩. Then the lattice of
S-subgroups I36(a) in Z236 is
\mathbb{I}_{36}(5)$$\mathbb{I}_{36}(17)$$\mathbb{I}_{36}(7)$$\mathbb{I}_{36}(19)$$\mathbb{I}_{36}(11)$$\mathbb{I}_{36}(35)$$\mathbb{I}_{36}(13)$$\mathbb{I}_{36}(1)=\mathbb{Z}_{2}^{36}
The subgroups ⟨17⟩, ⟨19⟩ and
⟨35⟩ have order 2 and the subgroup ⟨13⟩ has
order 3.
2.1.3 4n=60
The cyclic subgroups of Z60∗ are ⟨7⟩,
⟨11⟩, ⟨13⟩, ⟨17⟩,
⟨19⟩, ⟨23⟩, ⟨29⟩,
⟨31⟩, ⟨41⟩, ⟨49⟩ and
⟨59⟩. Then the lattice of S-subgroups I60(a) in
Z260 is
\mathbb{I}_{60}(11)$$\mathbb{I}_{60}(19)$$\mathbb{I}_{60}(29)$$\mathbb{I}_{60}(49)$$\mathbb{I}_{60}(7)$$\mathbb{I}_{60}(13)$$\mathbb{I}_{60}(17)$$\mathbb{I}_{60}(23)$$\mathbb{I}_{60}(31)$$\mathbb{I}_{60}(41)$$\mathbb{I}_{60}(59)$$\mathbb{I}_{60}(1)=\mathbb{Z}_{2}^{60}
where the subgroups ⟨11⟩, ⟨19⟩,
⟨29⟩, ⟨49⟩, ⟨31⟩,
⟨41⟩ and ⟨59⟩ have order 2.
2.1.4 4n=196
The cyclic subgroups of Z196∗ are ⟨3⟩,
⟨5⟩, ⟨9⟩, ⟨11⟩,
⟨13⟩, ⟨15⟩, ⟨19⟩,
⟨27⟩, ⟨29⟩, ⟨67⟩,
⟨97⟩, ⟨99⟩, ⟨117⟩,
⟨165⟩ and ⟨195⟩. Then the lattice of
S-subgroups I196(a) in Z2196 is
\mathbb{I}_{196}(29)$$\mathbb{I}_{196}(3)$$\mathbb{I}_{196}(9)$$\mathbb{I}_{196}(13)$$\mathbb{I}_{196}(15)$$\mathbb{I}_{196}(97)$$\mathbb{I}_{196}(5)$$\mathbb{I}_{196}(99)$$\mathbb{I}_{196}(11)$$\mathbb{I}_{196}(67)$$\mathbb{I}_{196}(165)$$\mathbb{I}_{196}(117)$$\mathbb{I}_{196}(195)$$\mathbb{I}_{196}(19)$$\mathbb{I}_{196}(27)$$\mathbb{I}_{196}(1)=\mathbb{Z}_{2}^{196}
where the subgroups ⟨97⟩, ⟨99⟩ and
⟨195⟩ have order 2 and the subgroups ⟨29⟩ and
⟨165⟩ have order 7 and 3, respectively.
2.1.5 4n=668
The cyclic subgroups of Z668∗ are ⟨3⟩,
⟨5⟩, ⟨9⟩, ⟨15⟩,
⟨333⟩, ⟨335⟩,
and ⟨667⟩. Then the lattice of S-subgroups I668(a) in
Z2668 is
\mathbb{I}_{668}(9)$$\mathbb{I}_{668}(333)$$\mathbb{I}_{668}(5)$$\mathbb{I}_{668}(335)$$\mathbb{I}_{668}(3)$$\mathbb{I}_{668}(667)$$\mathbb{I}_{668}(15)$$\mathbb{I}_{668}(1)=\mathbb{Z}_{2}^{668}
where the subgroups ⟨333⟩, ⟨335⟩ and
⟨667⟩ have order 2 and the subgroup
⟨9⟩ has order 83.
As noted, it is sufficient to search for circulant Hadamard matrices in those S-subgroups
I4n(x) such that x has order a prime number.
3 There is no circulant Hadamard matrices in Z24n
In this section the conjecture is proved. Firstly, we show that the orbit of all circulant
Hadamard matrix HC has order 2 under the action of Δ4n, where HC is fixed o
reversed by all decimation in Δ4n. Then we take H in I4n(x) with
xp≡1(mod4n), p a prime, and we suppose that H either is fixed or is reversed under
the action of δ2n+x. The idea is to show that H seen as a word has length an even
number in contradiction with the result obtain by Turyn. All word in I4n(x) is
factorized in terms of some set of subwords here constructed. A very useful decimation in our
proof will be δ2n+1, since δ2n+1∈Δ4n for all n≥1. We start with
the construction of its associated S-subgroup.
Proposition 1**.**
The S-subgroup I4n(2n+1) has order 23n.
Proof.
As (2n+1)2≡1mod4n, then {1,2n+1} is a cyclotomic coset of 2n+1 module 4n,
and
[TABLE]
are all of cyclotomic cosets of 2n+1 module 4n. Hence
[TABLE]
and ∣I4n(2n+1)∣=23n as we desirable.
∎
A first useful result to show that the orbit of a circulant Hadamard matrix has order 2 is
the following. Here will be shown the relationship between the decimations δx and
δn−x and Y when this is either fixed or reversed for those.
Theorem 2**.**
If δxYC=RYC for some x∈Zn∗, x=1,n−1, then Y∈In(n−x).
Proof.
Obviously the hypothesis δ1YC=RYC is never holded. On the other hand, if
δ2n−1YC=RYC, then Y∈/I2n(2n−1). In this case
Y∈I2n(1)=Z22n trivially. The condiction δ2nYC=RYC is holds
even when Y is contained in I2n+1(2n) since
I2n+1(2n)=Sym(Z22n+1) (see [13], Theorem 14). Then
Y∈I2n+1(1) trivially. Now suppose x=1,n−1 with
Y=Ci1XCi2X⋯CirX. As we want δxYC=RYC,
then
[TABLE]
and
[TABLE]
implies that ikx−1≡n−il(modn) or ik≡n−ilx≡(n−x)il(modn).
Hence Y∈In(n−x).
∎
Brualdi[3] proved that if there is a circulant Hadamard matrix, then this is nonsymmetric. We
will use this for to show that a circulant Hadamard matrix never is fixed by all decimation in
Δ4n.
Theorem 3**.**
Suppose H in ⋂x∈Z4n∗I4n(x), then HC is no Hadamard.
Proof.
Suppose that HC is Hadamard. Then θ(H)=θ(RH)=θ(δxH) for all
x∈Z4n∗. From the above theorem there is y∈Z4n∗ such that
δyH=RH. Therefore RH=H and H is symmetric, but there is no symmetric circulant
Hadamard matrices. Consequently, if HC is Hadamard then never is contained in
⋂x∈Z4n∗I4n(x).
∎
As was already announced we will show that the orbit of a circulant Hadamard matrix has order 2.
We take in mind the three commutation relations among δr, C and R:
[TABLE]
Theorem 4**.**
Let HC be a circulant Hadamard matrix of order 4n. Then the orbit of HC has order
2 under the action of Δ4n.
Proof.
It was already proven that no circulant Hadamard matrix is fixed under the action of
Δ4n. Hence the orbit of HC under the action of Δ4n is ≥2. Suppose
HC in I4nC(x). As δxRHC=RδxHC=RHC, then is followed
that RHC∈I4nC(x). Now, suppose p∈Z4n∗ such that
δpHC=RHC. Then
[TABLE]
Thus δpHC=RHC implies that δp−1HC=RHC. In fact, δp
and δp−1 belong to δ4n−1S(HC), where S(HC) is the stabilizer of
HC in Δ4n. Let Δ4n/S(HC) denote the set of cosets
{δxS(HC)} of S(HC) in Δ4n. We want to show that
[Δ4n:S(HC)]=2. As (δaY)Ci(δaY)=δa(YCiaY), then
(δaY)Ci(δaY) is a decimation of YCiaY. From the commutation relations
above δxH=H implies δ4n−xH=C4n−1RH for δx∈S(HC). Hence
δx(HCixH)=HCiH and δ4n−x(HC4n−ixH)=RC(HC4n−iH) implies
δx(HCixH)C=(HCiH)C and
δ4n−x(HC4n−ixH)C=R(HC4n−iH)C, respectively, for δx∈S(HC).
Let YC2 denote the vector
[TABLE]
for any Y∈Z2n.
As (YCiY)C=(YCn−iY)C, then YC2 is in correspondence with the autocorrelation
vector
[TABLE]
where PY(k)=n−2∣YCkY∣. Then
δaθ(H)=θ(δaH)=θ(H)=θ(RH),
for HC being Hadamard and all δa in Δ4n, implies that either
[TABLE]
or δaHC2=RHC2. Thus either δaH=H or δaH=C4n−1RH.
Hence Δ4n/S(HC) has only two cosets, since δa
is arbitrary. Hence the orbit of HC under Δ4n is {HC,RHC}.
∎
Remark 1**.**
In the proof above neither the length nor orthogonality of HC were considered, but
the autocorrelation vector (4n,0,...,0). By changing that vector for (n,d,...,d) we will
obtain the following result: Let Y be a binary sequence with 2-level autocorrelation values. Then
the orbit of YC has order ≤2 under the action of Δn.
On the other hand, it was already established that In(a) is an S-subgroup in
S(Z2n,Δn). Now we will show that CnY is in I2n(a)
for all Y in I2n(a). Thus the action of Cn determines a partition on
I2n(a). This it is important because we can obtain the structure of all
word Y in I4n(a) such that YC2nY has length 2n. If we can prove that such
Y is not Hadamard, then we will have reached the proof of the conjecture.
Lemma 2**.**
CnCsX=Cs+nX* with CsX a codeword in
XI2n(a) for all a∈Z2n∗.*
Proof.
This is easily seen by noting that all x in Z2n∗ is an odd number and from
nx≡n(mod2n). Hence
[TABLE]
∎
Now we have the following
Definition 3**.**
We will call to CsX and Cs+2nX codewords
C2n-complementary in XI4n(a). If CsX=Cs+2nX,
then CsX is a codeword C2n-invariant.
In the following lemmas we will write all word in
I4n(x), xp≡1(mod4n), p prime in term of
C2n-complementary and C2n-invariant subwords.
Lemma 3**.**
Take x in Z4n∗ such that x2≡1(mod4n). Then each word in I4n(x)
can contain the following subwords
[TABLE]
such that ArX and DtX contain no any C2n-complementary pairs and
C2n(BsX)=BsX, C2n(EuX)=EuX and C2n(FvX)=FvX.
Proof.
All cyclotomic cosets of x have order either 1 or 2. Thus the subwords ArX and BsX are
formed by cosets of order 1 and the subwords DtX, EuX and FvX are formed by
cosets of order 2. The properties of the subwords follow of its definition.
∎
Lemma 4**.**
Let xp≡1mod4n, p prime. All word in I4n(x) contains some of the
following subwords:
[TABLE]
Proof.
As xi2n≡2nmod4n, then no codeword in XI4n(x) is C2n-invariant.
Hence ArX,BsX,DtX and EuX are the only subwords forming all word in
I4n(x).
∎
The following lemma allows us to note the decimation δp preserves the structure of
any written word with the subwords ArX, BsX, DtX, EuX and FvX. Thus
we can to find the structure of the subwords and be able to construct the desired words
Lemma 5**.**
The action of δp conserves the structure of ArX, BsX, DtX, EuX
and FvX in I4n(x), xq≡1(mod4n), q a number prime.
Proof.
Suppose x2≡1(mod4n). We want to show that δpArX contains no
C2n-complementary pairs. We have
[TABLE]
If
[TABLE]
then p−1(ai−aj)≡2n(mod4n). But p−1∣4n and the above is not
possible for any pair (i,j). Hence δpArX contains no C2n-complementary
pairs and also C2m2δpArX=δpArX, hence
δpArX is distinct of BsX. Trivially, δpArX is distinct of DtX,
EuX and FvX. Equally is proved that
[TABLE]
As p∣4n, then
[TABLE]
for any pair (i,j). Hence C2nδpDtX=δpDtX and
δpDtX is distinct to EuX and FvX. Equally it is shown that δp
conserves the structure of BsX, EuX and FvX. The case xq≡1(mod4n),
q an odd prime is proved equally.
∎
Now we are ready for our proof. We will show that I4nC(x), where xp≡1mod4n
and p is a prime, contains no circulant Hadamard matrices by showing that neither
I4nC(2n+x) nor I4nC(x)∖I4nC(2n+x) contains
circulant Hadamard matrices. We start with the case p an odd prime
Theorem 5**.**
There is no circulant Hadamard matrices in I4nC(x) where xp≡1mod4n,
p an odd prime.
Proof.
Let μ(4n) denote the number of solution of
[TABLE]
with n=2m−2∏idpihi. If exist solution to the equation xp≡1mod4n
with p an odd prime, then μ(4n)<2ϕ(n). Thus XI4n(x) contains codewords
of lenght 1 or p. From Theorem 1,
I4n(xy)⊂I4n(x) for all y such that
y2≡1mod4n, particularly for y=2n+1. Thus z=xy=2n+x.
Now take a word Y in I4n(x) such that is not fixed by Δ4n.
From Theorem 4, if YC is Hadamard, then either δpYC=YC or
δpYC=RYC for all p∈Z4n∗. We will use this and the Lemma
4 and we will show that YC is no Hadamard. We will keep in mind that
C4n−1RY, Cn−1RY, C2n−1RY and C3n−1RY are in I4n(x).
case δzYC=YC.
This case implies that δ4n−zYC=δ2n−xYC=RYC. We have four cases.
-
δ2n−x(ArX)C=R(ArX)C.
On the one hand
[TABLE]
On the other hand, as (4n−ai)x≡(4n−ai)(mod4n), (n−ai)x≡(n−ai)(mod4n),
(2n−ai)x≡(2n−ai)(mod4n) and (3n−ai)x≡(3n−ai)(mod4n), then
[TABLE]
Thus must be holded some of following condictions
[TABLE]
Then we have respectively
[TABLE]
Hence the only possible cases for the definition of ArX are
[TABLE]
and ∣ArX∣=2r.
2. 2.
δ2n−x(BsX)C=R(BsX)C.
On the one hand
[TABLE]
On the other hand, as (4n−bi)x≡(4n−bi)(mod4n), (n−bi)x≡(n−bi)(mod4n),
(2n−bi)x≡(2n−bi)(mod4n) and (3n−bi)x≡(3n−bi)(mod4n), then
[TABLE]
Thus must be holded some of following condictions
[TABLE]
Then we have respectively
[TABLE]
Hence the only possible cases for definition of BsX are
[TABLE]
or BsX containing either the subwords CbiXCbi+2nXCbi+nXCbi+3nX
or the subwords CbiXCbi+2nXCbi−3nXCbi−nX. In any case
∣BsX∣=4s.
3. 3.
δ2n−x(DtX)C=R(DtX)C.
On the one hand, from Lemma
[TABLE]
On the other hand, as Cn−d1X⋯Cn−dtX,
C2n−d1X⋯C2n−dtX,
C3n−d1X⋯C3n−dtX and
C4n−d1X⋯C4n−dtX is in R(DtX)C, then
[TABLE]
Thus must be holded some of following condictions
[TABLE]
Then we have respectively
[TABLE]
Hence the only possible cases for definition of DtX are
[TABLE]
and ∣DtX∣=2pt.
4. 4.
δ2n−x(EuX)C=R(EuX)C.
On the one hand
[TABLE]
On the other hand, as
[TABLE]
and
[TABLE]
is in R(EuX)C, then
[TABLE]
Thus must be holded some of following condictions
[TABLE]
Then we have respectively
[TABLE]
Hence the only possible cases for definition of EuX are
[TABLE]
or EuX contains either the subwords
CeiXCei+2nXCei+nXCei+3nX
or the subwords
CeiXCei+2nXCei−3nXCei−nX.
In any case ∣EuX∣=4pu.
Therefore if Y contains the subwords ArX, BsX, DtX, EuX, then has length an
even number. If YC is Hadamard, then Y must be in G4m2(2m2−m) with m an
odd number. But this is no possible since Y has even length.
case δzYC=RYC.
We have four case.
-
δ2n+x(ArX)C=R(ArX)C, then
[TABLE]
as (4n−ai)x≡(4n−ai)(mod4n), (n−ai)x≡(n−ai)(mod4n),
(2n−ai)x≡(2n−ai)(mod4n) and (3n−ai)x≡(3n−ai)(mod4n), then
[TABLE]
Thus must be holded some of following condictions
[TABLE]
Then we have respectively
[TABLE]
Hence ArX has the form
[TABLE]
and ∣ArX∣=2r. But in the case i=j we have ai=n, 2ai=3n, ai=2n
or 2ai=n. If n is an odd number, the cases 2 and 4 are not hold. Then
∣ArX∣=2r+1 in this case.
2. 2.
δ2n+x(BsX)C=R(BsX)C.
Following the above proof, then must be holded some of following condictions
[TABLE]
Then we have respectively
[TABLE]
Hence the only possible cases for definition of BsX are
[TABLE]
with bi=0,2n or BsX containing the subwords
CbiXCbi+2nXC3n−biXCn−biX. In any case ∣BsX∣=4s. If
i=j, then for n an odd number we have bi=n for
some i. Then BsX contains the subword CnXC3nX and ∣BsX∣=4s+2.
3. 3.
δ2n+x(DtX)C=R(DtX)C.
For this case must be holded some of following condictions
[TABLE]
Then we have respectively
[TABLE]
Hence the only possible cases for definition of DtX are
[TABLE]
and ∣DtX∣=2pt. In the special case i=j we have di=n for n an odd number and
for some i. But nx≡n(mod4n) and the cyclotomic coset Cn has order 1 and
not p as we wish. Then we always have ∣DtX∣=2pt.
4. 4.
δ2n+x(EuX)C=R(EuX)C.
For this case must be holded some of following condictions
[TABLE]
Then we have respectively
[TABLE]
Hence the only possible cases for definition of EuX are
[TABLE]
or EuX contains the subwords
CeiXCei+2nXC3n−eiXCn−eiX
In any case ∣EuX∣=4pu. In the special case i=j we have ei=n for n an odd
number and some i. For the same reasons given above we always have ∣EuX∣=4pu.
Therefore if the subwords ArX, BsX, DtX and EuX have length an even number,
then YC is no Hadamard. Then we must research the case when Y contain ArX with
∣ArX∣=2r+1. The words containing ArX are
[TABLE]
The relation δ2n+xYC=RYC implies δ2n+1YC=RYC. Thus if we want
δ2n+1(ArX)C=R(ArX)C, δ2n+1(BsX)C=R(BsX)C,
δ2n+1(DtX)C=R(DtX)C and δ2n+1(EuX)C=R(EuX)C with
the structure of the subwords already constructed, then the ai, bi, di and ei
can not be even number since
2k(2n+1)≡2k(mod4n). If Y is some word in (3), then
∣Y∣=2m2+m. But the latter is not possible because there are exactly 2m2 odd
number in Z4m2. Hence YC is no Hadamard. Hence there is no circulant Hadamard
matrices in I4nC(x).
∎
Now we will do the proof for the case x having order 2, x=2n+1
Theorem 6**.**
There is no circulant Hadamard matrices in I4nC(x) where x2≡1(mod4n) and
x=2n+1.
Proof.
Let μ be as the previous theorem. By the Sun Ze Theorem
[TABLE]
When we compare μ(4n) and ϕ(4n) we have two cases.
case μ(4n)=ϕ(4n).
If n=∏i=1dpihi, pi>2, then μ(4n)=ϕ(4n)=2g+1 and
[TABLE]
Therefore pih1−1(pi−1)=2 for all i. Hence for pi>2 there is not solution.
Now let n=2m−2. Then by the Sun Ze Theorem μ(2m)=4 and as ϕ(2m)=2m−1,
then m=3 and the solution corresponds to 4n=8. Now let n=2m−2∏idpihi,
m≥3. Then μ(4n)=2g+2 and ϕ(4n)=2m−1∏i=1dpihi−1(pi−1). So
∏i=1dpihi−1(pi−1)=2g−m+3. Thus hi=1 and pi=2ki+1 for
all i, hence 2∑i=1dki=2g−m+3. As must be m≥3, then
g−∑i=1dki+3≥3. It holds that ∑i=1dki≥1. Therefore the only
solution is g=1, k1=1 and m=3 and corresponds to 4n=24. By exhaustive search in
I8(3), I8(5), I8(7), I24(5),
I24(7), I24(11), I24(13), I24(17),
I24(19) and I24(23), there is no circulant Hadamard matrices in
Z28 and Z224.
case μ(4n)<ϕ(4n).
Take y=2n+1 in Z4n∗. Let z=2n+x. If YC in I4nC(x) is Hadamard,
then either δzYC=YC or δzYC=RYC.
case δzYC=YC.
This case implies that δ2n−xYC=RYC.
From Lemma 3, Y has the subwords ArX, BsX, DtX,
EuX and FvX. By using a similar argument to previous theorem it is shown that the length
of previous subwords is an even number.
case δzYC=RYC.
Equally is obtained that ArX, BsX, DtX, EuX and FvX have length an
even number. If some subwords have odd length, then the decimation δ2n+1
guarantees us that all word Y is formed by subwords CgX with g an odd number and
again YC is no Hadamard. Hence there is no circulant Hadamard matrices in
I4nC(x) and x=2n+1.
∎
Finally, we proof for the case x=2n+1
Theorem 7**.**
There is no circulant Hadamard matrices in I4nC(2n+1).
Proof.
The proof is done with δ2n+x and xp≡1mod4n. From Proposition 1 we consider
the subwords
[TABLE]
From Theorem 5 there is no circulant
Hadamard matrices YC with δ2n+xYC=YC. So we only have the case
δ2n+xYC=RYC. This implies that δxYC=RYC. Thus we have
-
δx(ArX)C=R(ArX)C. Then
[TABLE]
and
[TABLE]
Suppose that the 2ai are not fixed by x. Thus if the first condiction is fulfilled, then
[TABLE]
and ArX contains subwords of the form C2aiXC4n−2aiX where
[TABLE]
and
[TABLE]
But this last implies that δxArX=ArX. If the third condiction is fulfilled, then
[TABLE]
and ArX contains subwords of the form C2aiXC2n−2aiX where
[TABLE]
And again δxArX=ArX. The second and fourth cases are not fulfilled if n is an
odd number.
On the other hand, suppose that some 2ai is fixed by x. Then ArX contains either the
subwords C2aiXC4n−2aiX or the subwords C2aiXC2n−2aiX. If all 2ai
in ArX is fixed by x, then δxArX=ArX. Conversely, if all no 2ai is
fixed by x, then δxArX=ArX too. If in 2ai≡(4n−2aj)(mod4n) we have
i=j, then 2ai=2n. Thus if ArX contains C2nX and some of the subwords
C2aiXC4n−2aiX, C2aiXC2n−2aiX,
C2aiXC4n−2aiX, C2aiXC2n−2aiX, then
δxArX=ArX. Therefore, the only ArX fulfilled
δx(ArX)C=R(ArX)C is ArX=C2nX.
2. 2.
δx(BsX)C=R(BsX)C. For this cases is proved that BsX contain
the subwords
[TABLE]
[TABLE]
[TABLE]
Hence ∣BsX∣ is an even number.
3. 3.
δx(FvX)C=R(FvX)C. Equally is proved that FvX contain
the subwords
[TABLE]
[TABLE]
Hence ∣FvX∣ is an even number.
Therefore the only words that can be Hadamard are
[TABLE]
As ∣ArXBsX∣<2m2+m and ∣ArXFvX∣<2m2+m, then the first
possibilities are ruled out. If Y=ArXBsXFvX , then
[TABLE]
for m>1. Hence there is no circulant Hadamard matrices in I4n(2n+1), n>1.
∎
Finally we will obtain the desired theorem
Theorem 8**.**
There is no circulant Hadamard matrices in Z24n.
Proof.
We can subdivide Z24n in three subsets, namely, the subset of symmetric sequences,
the subset the sequences of order 8n and the subset of sequences of order 8n+4. Already
was shown that there are no circulant Hadamard matrices in the first two subsets. From
Theorems 5, 6 and 7 there is
no circulant Hadamard matrices in I(8n+4)C(x) with xp≡1(mod(8n+4)),
p a prime. The Theorem 1 guarantees us that a circulant Hadamard matrix must
be searched in I4nC(x) with xp≡1(mod4n), p a prime. Hence there is
no circulant Hadamard matrices in Z24n, for n>1.
∎
4 Barker conjecture
Take A=(a0,a1,...,an−1) in Z2n. Define the aperiodic autocorrelation at shift
k of A to be
[TABLE]
If ∣C(k)∣≤1 for k=1,...,n−1, then A is called a Barker sequence of length n.
(For details see [2],[16]) The Barker conjecture asserts that
Conjecture 2**.**
There are no Barker sequences of length n>13 .
It is known that the circulant Hadamard matrix conjecture implies the Barker conjecture. Then
Theorem 9**.**
There are no Barker sequences of length n>13 .