The Leverrier-Faddeev algorithm, as modified by Gower (1980), is little-known but is useful for deriving the algebraic, rather than numerical, spectral structure of matrices occurring in statistical methodology. An example is given of deriving explicit forms for the singular value decomposition of any block-circulant matrix and the spectral decomposition of any symmetric block-circulant matrix....

In this paper we obtain [60,30,12], [64,32,12], [68,34,12], [72,36,12] doubly even self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two add to the one of the encoder outputs and this row will replace the first row in the double circulant matrix. The pure double circulant construction with K=10 is also ...

Given an odd prime p we show a way to construct large families of polynomials Pq(x) ∈ Q[x], q ∈ C, where C is a set of primes of the form q ≡ 1 mod p and Pq(x) is the irreducible polynomial of the Gaussian periods of degree p in Q(ζq). Examples of these families when p = 7 are worked in detail. We also show, given an integer n ≥ 2 and a prime q ≡ 1 mod 2n, how to represent by matrices the Gauss...

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...

In this paper, we give upper and lower bounds for the spectral norms of circulant matrices A n = Circ(F n−1) and B n = Circ(L (k,h) n and L (k,h) n are the (k, h)-Fibonacci and (k, h)-Lucas numbers, then we obtain some bounds for the spectral norms of Kronecker and Hadamard products of these matrices.

We compute the cohomology H∗(H, k) = ExtH(k, k) where H = H(n, q) is the Hecke algebra of the symmetric group Sn at a primitive `th root of unity q, and k is a field of characteristic zero. The answer is particularly interesting when ` = 2, which is the only case where it is not graded commutative. We also carry out the corresponding computation for Hecke algebras of type Bn and Dn when ` is odd.

We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix have at most one unit in the same position. In terms of Design Theory, such a matrix is an incidence matrix of a symmetric configuration. Also, it gives rise to an n-regular bipartite graphs without 4-cycles, which can be used for c...

We consider the Newton iteration for computing the principal matrix pth root, which is rarely used in the application for the bad convergence and the poor stability. We analyze the convergence conditions. In particular it is proved that the method converges for any matrix A having eigenvalues with modulus less than 1 and with positive real part. Based on these results we provide a general algor...

Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...