Regular Hadamard Matrices Generating Infinite Families of Symmetric Designs

If H is a regular Hadamard matrix with row sum 2h, m is a positive integer, and q = (2h ? 1)², then (4h ²(q ^{m + 1} ? 1)/(q ?1),(2h ² ? h)q ^m ,(h ²-h)q ^m ) are feasible parameters of a symmetric designs. If q is a prime power, then a balanced generalized weighing matrix BGW((q ^{m +1} ? 1)/(q?1),q ^m ,q ^m ?q ^{m ?1}) can be applied to construct such a design if H satisfies certain structural conditions. We describe such conditions and show that if H satisfies these conditions and B is a regular Hadamard matrix of Bush type, then B×H satisfies these structural conditions. This allows us to construct parametrically new infinite families of symmetric designs.     

Hadamard matrices of order 28m, 36m and 44m

We show that if four suitable matrices of order m exist then there are Hadamard matrices of order 28m, 36m, and 44m. In particular we show that Hadamard matrices of orders 14(q + 1), 18(q + 1), and 22(q + 1) exist when q is a prime power and q ≡ 1 (mod 4).Also we show that if n is the order of a conference matrix there is an Hadamard matrix of order 4mn.As a consequence there are Hadamard matrices of the following orders less than 4000: 476, 532, 836, 1036, 1012, 1100, 1148, 1276, 1364, 1372, 1476, 1672, 1836, 2024, 2052, 2156, 2212, 2380, 2484, 2508, 2548, 2716, 3036, 3476, 3892.All these orders seem to be new.     

Construction of Williamson type matrices

Recent advances in the construction of Hadamard matrices have depeaded on the existence of Baumert-Hall arrays and four (1, ?1) matrices A B C Dof order m which are of Williamson type, that is they pair-wise satisfy

i) MN^T = NM^T , ∈ {A B C D} and

ii) AA^T + BB^T + CC^T + DD^T = 4mI_m .

It is shown that Williamson type matrices exist for the orders m = s(4 ? 1)m = s(4s + 3) for s∈ {1, 3, 5, …, 25} and also for m = 93. This gives Williamson matrices for several new orders including 33, 95,189.

These results mean there are Hadamard matrices of order

i) 4s(4s ?1)t, 20s(4s ? 1)t,s ∈ {1, 3, 5, …, 25};

ii) 4s(4:s + 3)t, 20s(4s + 3)t s ∈ {1, 3, 5, …, 25};

iii) 4.93t, 20.93t

for

t ∈ {1, 3, 5, … , 61} ∪ {1 + 2 ^a 10 ^b 26 ^c a b c nonnegative integers}, which are new infinite families.

Also, it is shown by considering eight-Williamson-type matrices, that there exist Hadamard matrices of order 4(p + 1)(2p + l)r and 4(p + l)(2p + 5)r when p ≡ 1 (mod 4) is a prime power, 8ris the order of a Plotkin array, and, in the second case 2p + 6 is the order of a symmetric Hadamard matrix. These classes are new.     

Hadamard matrices of order 4(2p + 1)

It is shown in this paper that if p is a prime and q = 2p ? 1 is a prime power, then there exists an Hadamard matrix of order 4(2p + 1).     

An infinite class of Williamson matrices

Only a finite number of Hadamard matrices of Williamson type are known so far; it has been conjectured that one such exists of any order 4t. An infinite family is constructed here, and as a corollary it is shown that an Hadamard matrix of order 6(q + 1) exists if q is a prime power ≡ 1 (mod 4).     

On the asymptotic existence of Hadamard matrices

It is conjectured that Hadamard matrices exist for all orders 4t (t>0). However, despite a sustained effort over more than five decades, the strongest overall existence results are asymptotic results of the form: for all odd natural numbers k, there is a Hadamard matrix of order k²[a+blog₂k], where a and b are fixed non-negative constants. To prove the Hadamard Conjecture, it is sufficient to show that we may take a=2 and b=0. Since Seberry's ground-breaking result, which showed that we may take a=0 and b=2, there have been several improvements where b has been by stages reduced to 3/8. In this paper, we show that for all ?>0, the set of odd numbers k for which there is a Hadamard matrix of order k²2+[?log₂k] has positive density in the set of natural numbers. The proof adapts a number-theoretic argument of Erdos and Odlyzko to show that there are enough Paley Hadamard matrices to give the result.     

PBIB designs with m associate classes induced by full rank matrices modulo pm

This paper presents series of PBIB designs with m associate classes in which the treatment set is a subset of the Z(p^m)-module of n × 1 vectors over the ring of integers modulo p^m, p any prime. The association scheme of this series of designs is determined by the Fuller canonical form under row equivalence of n × 2 matrices [a,b] for vectors a and b in the treatment set. The blocking procedure utilizes full rank s × n matrices over Z(p^m), 1 ? s ? n ? 2, n ? 3. For m = 2, n = 3, s =1 and for each prime p, each PBIB is regular divisible and yields a finite proper uniform projective Hjelmslev plane with parameters j = p and k = p(p + 1).     

A new construction for Williamson-type matrices

It is shown that ifq is a prime power then there are Williamson-type matrices of order

1. 1/2q ²(q + 1) whenq ≡ 1 (mod 4).
2. 1/4q ²(q + 1) whenq ≡ 3 (mod 4) and there are Williamson-type matrices of order 1/4(q + 1).

This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an Hadamard matrix of the new order 33396 = 4 ? 8349.     

Patterns of power residues

This paper examines the question of whether a given pattern

$\text{x,x+a}{}_1\text{,…,x+a}{}_{\mathrm{m?1}}$

of kth power residues of length m can be postponed indefinitely. This is the case when there exists a prime q, called a delay prime, which does not contain this pattern even if q itself is considered as a kth power residue. It is conjectured that if there exists no delay prime then there exists a finite limit

$\text{Λ=Λ (k,m;a}{}_1\text{,…,a}{}_{\mathrm{m?1}}$

for which the corresponding pattern will occur before Λ in every sufficiently large prime of the form kn + 1.     

Involutory functions and Moore-Penrose inverses of matrices in an arbitrary field

Let F be a field, and M be the set of all matrices over F. A function ? from M into M, which we write ?(A) = A^s for A∈M, is involutory if (1) (AB)^s = B^sA^s for all A, B in M whenever the product AB is defined, and (2) (A^s)^s = A for all A∈M. If ? is an involutory function on M, then A^s is n×m if A is m×n; furthermore, Rank A = Rank A^s, the restriction of ? to F is an involutory automorphism of F, and (aA + bB)^s = a^sA^s + b^sB^s for all m×n matrices A and B and all scalars a and b. For an A∈M, an Ã∈M is called a Moore-Penrose inverse of A relative to ? if (i) AÃA = A, ÃAÃ = Ã and (ii) (AÃ)^s = AÃ, (ÃA)^s = ÃA. A necessary and sufficient condition for A to have a Moore-Penrose inverse relative to ? is that Rank A = Rank AA^s = Rank A^sA. Furthermore, if an involutory function ? preserves circulant matrices, then the Moore-Penrose inverse of any circulant matrix relative to ? is also circulant, if it exists.     

Complex Hadamard matrices

R. J. Turyn introduced complex Hadamard matrices and showed that if there is a complex Hadamard matrix of order c and a real Hadamard matrix of order h> > 1, then there is a real Hadamard matrix of order he. Previously, complex Hadamard matrices were only known for a few small orders and the orders for which symmetric conference matrices were known. These latter are known only to exist for orders which can be written as 1+a² +b² where a, b are integers. We give many constructions for new infinite classes of complex Hadamard matrices and show that they exist for orders 306,650, 870,1406,2450 and 3782: for the orders 650, 870, 2450 and 3782, a symmetric conference matrix cannot exist.     

Note on primitive permutation groups and a diophantine equation

It is shown that there are no transitive rank 3 extensions of the projective linear groups H, PSL(m,q) ? H ? PFL(m,q), for any prime power q and integer m ? 3. In the course of the proof the diophantine equation 5^m + 11 = x^p2, where m, x are positive integers, arose. As such equations can now be solved completely we had the choice of using number theory or geometry to complete the proof.     

An infinite family of Hadamard matrices of Williamson type

In this paper a new proof is given of the following theorem of Turyn: Let q = 2n ? 1 be a prime power ≡1 (mod 4); then there exists an Hadamard matrix of order 4n that is of the Williamson type.     

Hypercube orientations with only two in-degrees

We consider the problem of orienting the edges of the n-dimensional hypercube so only two different in-degrees a and b occur. We show that this can be done, for two specified in-degrees, if and only if obvious necessary conditions hold. Namely, we need 0?a,b?n and also there exist non-negative integers s and t so that s+t=n² and as+bt=n²n−1. This is connected to a question arising from constructing a strategy for a “hat puzzle”.     

On a problem of Sierpiński,Ⅱ

For any integer s≥ 2, let μsbe the least integer so that every integer l μs is the sum of exactly s integers which are pairwise relatively prime. In 1964, Sierpi′nski asked for the determination of μs. Let pibe the i-th prime and let μs= p2 + p3 + + ps+1+ cs. Recently, the authors solved this problem. In particular,we have(1) cs=-2 if and only if s = 2;(2) the set of integers s with cs= 1100 has asymptotic density one;(3) cs∈ A for all s ≥ 3, where A is an explicit set with A ■[2, 1100] and |A| = 125. In this paper, we prove that,(1) for every a ∈ A, there exists an index s with cs= a;(2) under Dickson's conjecture, for every a ∈ A,there are infinitely many s with cs= a. We also point out that recent progress on small gaps between primes can be applied to this problem.     

On a comparison theorem

This paper gives a generalization of the Sturm comparison theorem for differential equations (p): y″ = p(t)y, (q): y″ = q(t)y under the assumption that the function p ? q changes its sign exactly once on [a, b] or ∝_t^bp ? q, ∝_a^tp ? q maintain the sign on [a, b]. The results are used for investigating the distributions of zeros of solutions and the derivative of solutions of (p), (q).     

Heilbronn's conjecture on Waring's number (mod p)

Let p be a prime k|p−1, t=(p−1)/k and γ(k,p) be the minimal value of s such that every number is a sum of s kth powers . We prove Heilbronn's conjecture that γ(k,p)?k1/2 for t>2. More generally we show that for any positive integer q, γ(k,p)?C(q)k1/q for ?(t)?q. A comparable lower bound is also given. We also establish exact values for γ(k,p) when ?(t)=2. For instance, when t=3, γ(k,p)=a+b−1 where a>b>0 are the unique integers with a²+b²+ab=p, and when t=4, γ(k,p)=a−1 where a>b>0 are the unique integers with a²+b²=p.     

A family of difference sets in non-cyclic groups

A construction is given for difference sets in certain non-cyclic groups with the parameters $\text{v = q}{}^{\mathrm{s+1}}\text{{[}\text{(q}{}^{\mathrm{s+1}}\text{? 1)}\text{(q ? 1)}\text{] + 1}}$, $\text{k = q}{}^{\mathrm{s}}\text{(q}{}^{\mathrm{s+1}}\text{? 1)}\text{(q ? 1)}$, $\text{λ = q}{}^{\mathrm{s}}\text{(q}{}^{\mathrm{s}}\text{? 1)}\text{(q ? 1)}$, n = q^2s for every prime power q and every positive integer s. If q^s is odd, the construction yields at least $\text{1}\text{2}\text{(q}{}^{\mathrm{s}}\text{+ 1)}$ inequivalent difference sets in the same group. For q = 5, s = 2 a difference set is obtained with the parameters (v, k, λ, n) = (4000, 775, 150, 625), which has minus one as a multiplier.     

Regular sets of matrices and applications

SupposeA ₁,...,A _s are (1, - 1) matrices of order m satisfying 1 $$A_i A_j = J, i,j \in \left\{ {1,...s} \right\}$$ 2 $$A_i^T A_j = A_j^T A_i = J, i \ne j, i,j \in \left\{ {1,...,s} \right\}$$ 3 $$\sum\limits_{i = 1}^s {(A_i A_i^T = A_i^T A_i ) = 2smI_m } $$ 4 $$JA_i = A_i J = aJ, i \in \left\{ {1,...,s} \right\}, a constant$$ Call A₁,…,A _s ,a regular s- set of matrices of order m if Eq. 1-3 are satisfied and a regular s-set of regular matrices if Eq. 4 is also satisfied, these matrices were first discovered by J. Seberry and A.L. Whiteman in “New Hadamard matrices and conference matrices obtained via Mathon’s construction”, Graphs and Combinatorics, 4(1988), 355-377. In this paper, we prove that

1. if there exist a regular s-set of order m and a regulart-set of order n there exists a regulars-set of ordermn whent =sm
2. if there exist a regular s-set of order m and a regulart-set of order n there exists a regulars-set of ordermn when 2t = sm (m is odd)
3. if there exist a regulars-set of order m and a regulart-set of ordern there exists a regular 2s-set of ordermn whent = 2sm As applications, we prove that if there exist a regulars-set of order m there exists
4. an Hadamard matrices of order4hm whenever there exists an Hadamard matrix of order4h ands =2h
5. Williamson type matrices of ordernm whenever there exists Williamson type matrices of ordern and s = 2n
6. anOD(4mp;ms₁,…,ms_u whenever anOD (4p;s₁,…,s_u)exists and s = 2p
7. a complex Hadamard matrix of order 2cm whenever there exists a complex Hadamard matrix of order 2c ands = 2c

This paper extends and improves results of Seberry and Whiteman giving new classes of Hadamard matrices, Williamson type matrices, orthogonal designs and complex Hadamard matrices.