Interlacing properties of roots of certain biorthogonal polynomials

In this paper we consider the biorthogonal polynomials with respect to the measure e^-x4-y2+2τxydxdy, and show that their roots interlace. The proof involves showing total nonnegativity of matrices related to Jacobi type matrices.     

Gaps in the base set of primitive nonpowerful sign patterns

For a primitive nonpowerful square sign pattern A, the base of A, denoted by l(A), is the least positive integer l such that every entry of A ^l is #. In this article, we consider the base set of the primitive nonpowerful sign pattern matrices. Some useful results about the bases for the sign pattern matrices are presented there. Some special sign pattern matrices with given bases are characterized and more ‘gaps’ in the base set are shown.     

On the Geometry of Hermitian Matrices of Order Three Over Finite Fields

Some geometry of Hermitian matrices of order three over GF(q²) is studied. The variety coming from rank 2 matrices is a cubic hypersurface M₇³of PG(8,q ) whose singular points form a variety H corresponding to all rank 1 Hermitian matrices. BesideM₇³ turns out to be the secant variety of H. We also define the Hermitian embedding of the point-set of PG(2, q²) whose image is exactly the variety H. It is a cap and it is proved that PGL(3, q²) is a subgroup of all linear automorphisms of H. Further, the Hermitian lifting of a collineation of PG(2, q²) is defined. By looking at the point orbits of such lifting of a Singer cycle of PG(2, q²) new mixed partitions of PG(8,q ) into caps and linear subspaces are given.     

Properties of Hadamard product of inverse M‐matrices

This paper concerns with the properties of Hadamard product of inverse M‐matrices. Structures of tridiagonal inverse M‐matrices and Hessenberg inverse M‐matrices are analysed. It is proved that the product A ○ A^T satisfies Willoughby's necessary conditions for being an inverse M‐matrix when A is an irreducible inverse M‐matrix. It is also proved that when A is either a Hessenberg inverse M‐matrix or a tridiagonal inverse M‐matrix then A ○ A^T is an inverse M‐matrix. Based on these results, the conjecture that A ○ A^T is an inverse M‐matrix when A is an inverse M‐matrix is made. Unfortunately, the conjecture is not true. Copyright © 2004 John Wiley Sons, Ltd.     

The modified bordering method to evaluate eigenvalues and eigenvectors of normal matrices

A bordering procedure is here proposed to evaluate the eigensystem of hermitian matrices, and more in general of normal matrices, when the spectral decomposition is known of then–1×n–1 principal minor. The procedure is also applicable to special real and nonsymmetric matrices here named quasi-symmetric. The computational cost to write the characteristic polynomial isO(n ²), using a new set of recursive formulas. A modified Brent algorithm is used to find the roots of the polynomial. The eigenvectors are evaluated in a direct way with a computational cost ofO(n ²) for each one. Some numerical considerations indicate where numerical difficulties may occur. Numerical results are given comparing this method with the Givens-Householder one.     

Minimum permanents of doubly stochastic matrices with at least one zero entry †

It is shown that the minimum value of the permanent on the n× ndoubly stochastic matrices which contain at least one zero entry is achieved at those matrices nearest to J_n in Euclidean norm, where J_n is the n× nmatrix each of whose entries is n^-1 . In case n ≠ 3 the minimum permanent is achieved only at those matrices nearest J_n ; for n= 3 it is achieved at other matrices containing one or more zero entries as well.     

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.     

Perimeter preserver of matrices over semifields

For a rank-1 matrix A = ab ^t, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over semifields. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices over semifields if and only if it has the form T(A) = U AV, or T(A) = U A ^t V with some invertible matrices U and V. This work was supported by the research grant of the Cheju National University in 2006.     

Constructing a sequence of discrete Hessian matrices of an SC 1 function uniformly convergent to the generalized Hessian matrix

We construct a uniform approximation for generalized Hessian matrix of an SC ¹ function. Using the discrete gradient and the extended second order derivative, we define the discrete Hessian matrix. We construct a sequence of sets, where each set is composed of discrete Hessian matrices. We first show some new properties of SC ¹ functions. Then, we prove that for SC ¹ functions the sequence of the set of discrete Hessian matrices is uniformly convergent to the generalized Hessian matrix.      

On a series of Hadamard matrices of order 2 t and the maximal excess of Hadamard matrices of order 22t

In this paper we give a new series of Hadamard matrices of order 2 ^t . When the order is 16, Hadamard matrices obtained here belong to class II, class V or to class IV of Hall's classification [3]. By combining our matrices with the matrices belonging to class I, class II or class III obtained before, we can say that we have direct construction, namely without resorting to block designs, for all classes of Hadamard matrices of order 16.Furthermore we show that the maximal excess of Hadamard matrices of order 2^2t is 2^3t , which was proved by J. Hammer, R. Levingston and J. Seberry [4]. We believe that our matrices are inequivalent to the matrices used by the above authors. More generally, if there is an Hadamard matrix of order 4n ² with the maximal excess 8n ³, then there exist more than one inequivalent Hadamard matrices of order 2^2t n ² with the maximal excess 2^3t n ³ for anyt 2.     

Linear preservers of matrices of rank-2

Let T be a linear operator on the space of all m×n matrices over any field. we prove that if T maps rank-2 matrices to rank-2 matrices then there exist nonsingular matrices U and V such that either T(X)=UXV for all matrices X, or m=n and T(X)=UX^tV for all matrices X where X^t denotes the transpose of X.     

On reduction of block matrices in a Hilbert space

We study the problem of the reduction of self-adjoint block matrices B = (B _ij ) with given graph by a group of unitary block diagonal matrices. Under the condition that the matrices B ² and B ⁴ are orthoscalar, we describe the graphs of block matrices for which this problem is a problem of *-finite, *-tame, or *-wild representation type.     

Automorphisms of higher‐dimensional Hadamard matrices

This article derives from first principles a definition of equivalence for higher‐dimensional Hadamard matrices and thereby a definition of the automorphism group for higher‐dimensional Hadamard matrices. Our procedure is quite general and could be applied to other kinds of designs for which there are no established definitions for equivalence or automorphism. Given a two‐dimensional Hadamard matrix H of order ν, there is a Product Construction which gives an order ν proper n‐dimensional Hadamard matrix P⁽ⁿ⁾(H). We apply our ideas to the matrices P⁽ⁿ⁾(H). We prove that there is a constant c > 1 such that any Hadamard matrix H of order ν > 2 gives rise via the Product Construction to cν inequivalent proper three‐dimensional Hadamard matrices of order ν. This corrects an erroneous assertion made in the literature that ”P⁽ⁿ⁾(H) is equivalent to “P⁽ⁿ⁾(H′) whenever H is equivalent to H′.” We also show how the automorphism group of P⁽ⁿ⁾(H) depends on the structure of the automorphism group of H. As an application of the above ideas, we determine the automorphism group of P⁽ⁿ⁾(Hk) when Hk is a Sylvester Hadamard matrix of order 2^k. For ν = 4, we exhibit three distinct families of inequivalent Product Construction matrices P⁽ⁿ⁾(H) where H is equivalent to H₂. These matrices each have large but non‐isomorphic automorphism groups. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 507–544, 2008     

The structure of irreducible matrix groups with submultiplicative spectrum

We describe the structure of irreducible matrix groups with submultiplicative spectrum. Since all such groups are nilpotent, the study is focused on p-groups. We obtain a block-monomial structure of matrices in irreducible p-groups and build polycyclic series arising from that structure. We give an upper bound to the exponent of these groups. We determine all minimal irreducible groups of p× p matrices with submultiplicative spectrum and discuss the case of p ²× p ² matrices if p is an odd prime.     

Suprema of Chaos Processes and the Restricted Isometry Property

We present a new bound for suprema of a special type of chaos process indexed by a set of matrices, which is based on a chaining method. As applications we show significantly improved estimates for the restricted isometry constants of partial random circulant matrices and time‐frequency structured random matrices. In both cases the required condition on the number m of rows in terms of the sparsity s and the vector length n is m ? s log² s log² n. © 2014 Wiley Periodicals, Inc.     

Symmetric Weighing Matrices Constructed using Group Matrices

A weighing matrix of order n and weight m² is a square matrix M of order n with entries from {-1,0,+1} such that MM^T=m²I where I is the identity matrix of order n. If M is a group matrix constructed using a group of order n, M is called a group weighing matrix. Recently, group weighing matrices were studied intensively, especially when the groups are cyclic and abelian. In this paper, we study the abelian group weighing matrices that are symmetric, i.e.M^T=M. Some new examples are found. Also we obtain a few exponent bounds on abelian groups that admit symmetric group weighing matrices. In particular, we prove that there is no symmetric abelian group weighing matrices of order 2p^r and weight p² where p is a prime and p≥ 5.Communicated by: K.T. Arasu     

Convergence Analysis of the Finite Section Method and Banach Algebras of Matrices

The finite section method is a classical scheme to approximate the solution of an infinite system of linear equations. Based on an axiomatic framework we present a convergence analysis of the finite section method for unstructured matrices on weighted ℓ ^p -spaces. In particular, the stability of the finite section method on ℓ ² implies its stability on weighted ℓ ^p -spaces. Our approach uses recent results from the theory of Banach algebras of matrices with off-diagonal decay. Furthermore, we demonstrate that Banach algebra theory provides a natural framework for deriving a finite section method that is applicable to large classes of unstructured non-hermitian matrices as well as to least squares problems.     

Efficient generation of random nonsingular matrices

We present an efficient algorithm for generating an n × n nonsingular matrix uniformly over a finite field. This algorithm is useful for several cryptographic and checking applications. Over GF[2] our algorithm runs in expected time M(n) + O(n²), where M(n) is the time needed to multiply two n × n matrices, and the expected number of random bits it uses is n² + 3. (Over other finite fields we use n² + O(1) random field elements on average.) This is more efficient than the standard method for solving this problem, both in terms of expected running time and the expected number of random bits used. The standard method is to generate random n × n matrices until we produce one with nonzero determinant. In contrast, our technique directly produces a random matrix guaranteed to have nonzero determinant. We also introduce efficient algorithms for related problems such as uniformly generating singular matrices or matrices with fixed determinant. © 1993 John Wiley & Sons, Inc.     

Tournament matrices and their generalizations,I.

If M is any complex matrix with rank (M + M ^* + I) = 1, we show that any eigenvalue of M that is not geometrically simple has 1/2 for its real part. This generalizes a recent finding of de Caen and Hoffman: the rank of any n × n tournament matrix is at least n ? 1. We extend several spectral properties of tournament matrices to this and related types of matrices. For example, we characterize the singular real matrices M with 0 diagonal for which rank (M + M^T + I) = 1 and we characterize the vectors that can be in the kernels of such matrices. We show that singular, irreducible n × n tournament matrices exist if and only n? {2,3,4,5} and exhibit many infinite families of such matrices. Connections with signed digraphs are explored and several open problems are presented.     

Some examples of orthogonal matrix polynomials satisfying odd order differential equations

It is well known that if a finite order linear differential operator with polynomial coefficients has as eigenfunctions a sequence of orthogonal polynomials with respect to a positive measure (with support in the real line), then its order has to be even. This property no longer holds in the case of orthogonal matrix polynomials. The aim of this paper is to present examples of weight matrices such that the corresponding sequences of matrix orthogonal polynomials are eigenfunctions of certain linear differential operators of odd order. The weight matrices are of the form

W(t)=t^αe^-te^Att^Bt^B*e^A*t,