Related papers: Cyclic Difference Sets And Cyclic Hadamard Matrice…
Arising from the classification of the matrix-roots of a nonnegative imprimitive irreducible matrix, we present results concerning the Jordan chains of an $h$-cyclic matrix. We also present ancillary results applicable to nonnegative…
It is shown that a hamiltonian $n/2$-regular bipartite graph $G$ of order $2n>8$ contains a cycle of length $2n-2$. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then $G$ is bipancyclic.
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…
In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…
The four Hagge circles of the triangles BCD, ACD, ABD, ABC of a cyclic quadrilateral ABCD with respect to an appropriate common axis of inverse similarity share many features which are analysed.
A classification of Hadamard matrices of order $2p+2$ with an automorphism of order $p$ is given for $p=29$ and $31$. The ternary self-dual codes spanned by the newly found Hadamard matrices of order $60$ with an automorphism of order $29$…
A trade in a complex Hadamard matrix is a set of entries which can be changed to obtain a different complex Hadamard matrix. We show that in a real Hadamard matrix of order $n$ all trades contain at least $n$ entries. We call a trade…
We construct several difference families on cyclic groups of orders 47 and 97, and use them to construct skew-Hadamard matrices of orders 188 and 388. Such difference families and matrices are constructed here for the first time. The…
Let $H$ be a permutation group on a set $\Lambda$, which is permutationally isomorphic to a finite alternating or symmetric group $A_n$ or $S_n$ acting on the $k$-element subsets of points from $\{1,\ldots,n\}$, for some arbitrary but fixed…
If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…
Let $S$ be a subset of the cyclic group $\Z_n$. The cyclic Haar graph $H(\Z_n,S)$ is the bipartite graph with color classes $\Z_n^+$ and $\Z_n^-,$ and edges $\{x^+,y^-\},$ where $x,y \in \Z_n$ and $y - x \in S$. In this paper we give…
We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…
Two submatrices $A,D$ of a Hadamard matrix $H$ are called complementary if, up to a permutation of rows and columns, $H=[^A_C{\ }^B_D]$. We find here an explicit formula for the polar decomposition of $D$. As an application, we show that…
Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…
A partial Hadamard matrix $H\in M_{M\times N}(\mathbb C)$ is called of "classical type" if the associated quantum semigroup $G\subset\widetilde{S}_M^+$ is classical. In combinatorial terms, if $H_1,\ldots,H_M\in\mathbb T^N$ are the rows of…
The normal sequences NS(n) and near-normal sequences NN(n) play an important role in the construction of orthogonal designs and Hadamard matrices. They can be identified with certain base sequences (A;B;C;D), where A and B have length n+1…
The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adjacent in every cycle in which they appear together. An…
It is known that every matrix of order n over the maximal order in an algebraic number eld is a sum of k-th powers in various cases if a discriminant condition is satis ed. It has been proved by Wadikar and Katre that for every matrix of…
A complex Hadamard matrix is a square matrix H with complex entries of absolute value 1 satisfying $HH^*= nI$, where $*$ stands for the Hermitian transpose and I is the identity matrix of order $n$. In this paper, we first determine the…
A $Cretan(4t+1)$ matrix, of order $4t+1$, is an orthogonal matrix whose elements have moduli $\leq 1$. The only $Cretan(4t+1)$ matrices previously published are for orders 5, 9, 13, 17 and 37. This paper gives infinitely many new…