scholarly journals Some classes of Hadamard matrices with constant diagonal

1972 ◽  
Vol 7 (2) ◽  
pp. 233-249 ◽  
Author(s):  
Jennifer Wallis ◽  
Albert Leon Whiteman

The concepts of circulant and backcirculant matrices are generalized to obtain incidence matrices of subsets of finite additive abelian groups. These results are then used to show the existence of skew-Hadamard matrices of order 8(4f+1) when f is odd and 8f + 1 is a prime power. This shows the existence of skew-Hadamard matrices of orders 296, 592, 1184, 1640, 2280, 2368 which were previously unknown.A construction is given for regular symmetric Hadamard matrices with constant diagonal of order 4(2m + 1)2 when a symmetric conference matrix of order 4m + 2 exists and there are Szekeres difference sets, X and Y, of size m satisfying x є X ⇒ −xє X, y є Y ⇒ −y єY.

10.37236/8753 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Venkata Raghu Tej Pantangi

In this paper we investigate the structure of the critical groups of doubly-regular tournaments (DRTs) associated with skew Hadamard difference families (SDFs) with one, two, or four blocks. Brown and Ried found that the existence of a skew Hadamard matrix of order $n+1$ is equivalent to the existence of a DRT on $n$ vertices. A well known construction of a skew Hadamard matrix order $n$ is by constructing skew Hadamard difference sets in abelian groups of order $n-1$. The Paley skew Hadamard matrix is an example of one such construction. Szekeres and Whiteman constructed skew Hadamard matrices from skew Hadamard difference families with two blocks. Wallis and Whiteman constructed skew Hadamard matrices from skew Hadamard difference families with four blocks. In this paper we consider the critical groups of DRTs associated with skew Hadamard matrices constructed from skew Hadamard difference families with one, two or four blocks. We compute the critical groups of DRTs associated with skew Hadamard difference families with two or four blocks. We also compute the critical group of the Paley tournament and show that this tournament is inequivalent to the other DRTs we considered. Consequently we prove that the associated skew Hadamard matrices are not equivalent.   


1975 ◽  
Vol 27 (3) ◽  
pp. 555-560 ◽  
Author(s):  
Edward Spence

1. Introduction. We prove, using a theorem of M. Hall on cyclic projective planes, that if g is a prime power such that either 1 + q + q2 is a prime congruent to 3, 5 or 7 (mod 8) or 3 + 2q + 2q2 is a prime power, then there exists a skew-Hadamard matrix of the Goethals-Seidel type of order 4(1 + q + q2). (A Hadamard matrix H is said to be of skew type if one of H + I, H — lis skew symmetric. ) If 1 + q + q2 is a prime congruent to 1 (mod 8), then a Hadamard matrix, not necessarily of skew type, of order 4(1 + q + q2) is constructed. The smallest new Hadamard matrix obtained has order 292.


1979 ◽  
Vol 22 (1) ◽  
pp. 17-21 ◽  
Author(s):  
A. D. Sands

Keller (6) considered a generalisation of a problem of Minkowski (7) concerning the filling of Rn by congruent cubes. Hajós (4) reduced Minkowski's conjecture to a problem concerning the factorization of finite abelian groups and then solved this problem. In a similar manner Hajós (5) reduced Keller's conjecture to a problem in the factorization of finite abelian groups, but this problem remains unsolved, in general. It occurs also as Problem 80 in Fuchs (3). Seitz (10) has obtained a solution for cyclic groups of prime power order. In this paper we present a solution for cyclic groups whose order is the product of two prime powers.


2000 ◽  
Vol 102 (1-2) ◽  
pp. 47-61 ◽  
Author(s):  
Warwick de Launey ◽  
D.L. Flannery ◽  
K.J. Horadam

2003 ◽  
Vol 14 (05) ◽  
pp. 871-888 ◽  
Author(s):  
ALBERTO BERTONI ◽  
CARLO MEREGHETTI ◽  
BEATRICE PALANO

Given a function p : N → [0,1] of period n, we study the minimal size (number of states) of a one-way quantum finite automaton (Iqfa) inducing the stochastic event ap + b, for real constants a>0, b≥0, a+b≤1. First of all, we relate the estimation of the minimal size to the problem of finding a minimal difference cover for a suitable subset of Zn. Then, by observing that the cardinality of a difference cover Δ for a set A ⊆ Zn, must satisfy [Formula: see text], we investigate the class of sets A admitting difference covers of cardinality exactly [Formula: see text]. We relate this problem with the efficient construction of Golomb rulers and difference sets. We design an algorithm which outputs each of the Golomb rulers (if any) of a given set in pseudo-polynomial time. As a consequence, we obtain an efficient algorithm that construct minimal difference covers for a non-trivial class of sets. Moreover, by using projective geometry arguments, we give an algorithm that, for any n=q2+q+1 with q prime power, constructs difference sets for Zn in quadratic time.


Sign in / Sign up

Export Citation Format

Share Document