Hadamard product submultiplicativity of certain induced norms

In this paper we ask which norms on M_d induced by an absolute vector norm are sub-multiplicative with respect to the Hadamard product. We provide a simple necessary condition for submultiplicativity. We demonstrate that each norm on M_d induced by an l_p norm Hadamard submultiplicative and that the norms induced by certain polyhedral norms are Hadamard submultiplicative. We also consider some related inequalities.     

Matrix semigroups determined by unitarily invariant norms

The purpose of this paper is to study the structure of the matrix semigroups defined by unitarily invariant norms and, equivalently, those defined by arbitrary ellipsoidal norms. Among other things it is found that when an element of such a semigroup has a semi-inverse, the semi-inverse is unique, and, in the case of unitarily invariant norms, this is the Moore-Penrose generalized inverse. The symmetric gauge functions that determine submultiplicative matrix norms are characterized, and these norms are related to the spectral norm.     

Linear circulant matricesover a finite field

Rings of polynomials R_N = Z_p[x]/x^N − 1 which are isomorphic to Z_P^N are studied, where p is prime and N is an integer. If I is an ideal in R_N, the code K whose vectors constitute the isomorphic image of I is a linear cyclic code. If I is a principle ideal and K contains only the trivial cycle 0 and one nontrivial cycle of maximal least period N, then the code words of K/ 0 obtained by removing the zero vector can be arranged in an order which constitutes a linear circulant matrix, C. The distribution of the elements of C is such that it forms the cyclic core of a generalized Hadamard matrix over the additive group of Z_Pp. A necessary condition that C = K/ 0 be linear circulant is that for each row vector v of C, the periodic infinite sequence a(v) produced by cycling the elements of v be period invariant under an arbitrary permutation of the elements of the first period. The necessary and sufficient condition that C be linear circulant is that the dual ideal generated by the parity check polynomial h(χ) of K be maximal (a nontrivial, prime ideal of R_N), with N = p^k − 1 and k = deg (h(χ)).     

Facial structures of schatten p-Norms

In this note, we study the facial structure of the closed unit ball B_n of a unitarily invariant norm on n-by-n matrices In particular, we characterize all the extreme points of B_n Furthermore, if the unitarily invariant norm is indeed a Schatten p-norm. then all the proper closed faces of B_n will be described explicitly.     

Equivalence constants for certain matrix norms II

We give an almost complete solution of a problem posed by Klaus and Li [A.-L. Klaus, C.-K. Li, Isometries for the vector (p, q) norm and the induced (p, q) norm, Linear and Multilinear Algebra 38 (1995) 315–332]. Klaus and Li’s problem, which arose during their investigations of isometries, was to relate the Frobenius (or Hilbert–Schmidt) norm of a matrix to various operator norms of that matrix. Our methods are based on earlier work of Feng [B.Q. Feng, Equivalence constants for certain matrix norms, Linear Algebra Appl. 374 (2003) 247–253] and Tonge [A. Tonge, Equivalence constants for matrix norms: a problem of Goldberg, Linear Algebra Appl. 306 (2000) 1–13], but introduce as a new ingredient some techniques developed by Hardy and Littlewood [G.H. Hardy, J.E. Littlewood, Bilinear forms bounded in space [p, q], Quart. J. Math. (Oxford) 5 (1934) 241–254].     

Inequalities for unitarily invariant norms and bilinear matrix products

We give several criteria that are equivalent to the basic singular value majorization inequality (1.1) that is common to both the usual and Hadamard products. We then use these criteria to give a unified proof of the basic majorization inequality for both products. Finally, we introduce natural generalizations of the usual and Hadamard products and show that although these generalizations do not satisfy the majorization inequality, they do satisfy an important weaker inequality that plays a role in establishing their submultiplicativity with respect to every unitarily invariant norm.     

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.     

Maximal IM-unextendable graphs

A graph G is maximal IM-unextendable if G is not induced matching extendable and, for every two nonadjacent vertices x and y, G+xy is induced matching extendable. We show in this paper that a graph G is maximal IM-unextendable if and only if G is isomorphic to M_r(K_s(K_n1K_n2K_nt)), where M_r is an induced matching of size r, r1, t=s+2, and each n_i is odd.     

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_nin Euclidean norm, where J_nis 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.     

Linear operators preserving unitarily invariant norms of matrices

Let F_{m × n} be the set of all m × n matrices over the field F = C or R Denote by U_n(F) the group of all n × n unitary or orthogonal matrices according as F = C or F-R. A norm N() on Fm ×n, is unitarily invariant if N(UAV) = N(A): for all A ∈ F _m×n U ∈ U_m(F). and V ∈ U_n(F). We characterize those linear operators TF_{m × n} → F_{m × n}which satisfy N (T(A)) = N(A)for all A ∈ F_{m × n}

for a given unitarily invariant norm N(). It is shown that the problem is equivalent to characterizing those operators which preserve certain subsets in F_{m × n} To develop the theory we prove some results concerning unitary operators on F_{m × n} which are of independent interest.     

Equality of higher numerical ranges of matrices and a conjecture of Kippenhahn on Hermitian pencils

Let M_n be the algebra of all n × n complex matrices. For 1 k n, the kth numerical range of A M_n is defined by W_k(A) = (1/k)∑_j^k=1x_j^*Ax_j : x₁, …, x_k is an orthonormal set in ⁿ]. It is known that tr A/n = W_n(A) W_n−1(A) W₁(A). We study the condition on A under which W_m(A) = W_k(A) for some given 1 m < k n. It turns out that this study is closely related to a conjecture of Kippenhahn on Hermitian pencils. A new class of counterexamples to the conjecture is constructed, based on the theory of the numerical range.     

Permanents of special classes of doubly stochastic matrices

We identify the doubly stochastic matrices with at least one zero entry which are closest in the Euclidean norm to J_n, the matrix with each entry equal to 1/n, and we show that at these matrices the permanent function has a relative minimum when restricted to doubly stochastic matrices having zero entries.     

Cycle type and descent set in wreath products

We express the number of elements of the hyperoctahedral group B_n, which have descent set K and such that their inverses have descent set J, as a scalar product of two representations of B_n. We also give the number of elements of B_n, which have a prescribed descent set and which are in a given conjugacy class of B_n by another scalar product of representations of B_n. For this, we first establish corresponding results for certain wreath products. We finally give, by generating series of symmetric functions, some analogs of the classical formulas which express the exponential generating series of alternating elements in the B_n's.     

Path polynomials of a circuit: a constructive approach

Let P_k denote the polynomial of the path on k vertices. We describe completely the matrix P_k (C_n), where C_n is the circuit on n vertices, using some important concepts of theory of circulant matrices. We also consider Q _k, the polynomial of the circuit on kvertices.

Using orthogonal polynomials we present constructive proofs of some results obtained recently by Bapat and Lai, Beezer and Ronghua.     

On certain classes of matrix norms

Some characterizations of certain classes oi submultiplicative and/or general matrix norms are given.     

Nonchordal positive semidefinite stochastic matrices

Let K_nbe the convex set of n×npositive semidefinite doubly stochastic matrices. If Aε k_n, the graph of A,G(A), is the graph on n vertices with (i,j) an edge if a_ij ≠ 0i≠ j. We are concerned with the extreme points in K_n. In many cases, the rank of Aand G(A) are enough to determine whether A is extreme in K_n. This is true, in particular, if G(A)is a special kind of nonchordal graph, i.e., if no two cycles in G(A)have a common edge.     

Convergence acceleration of some Gaussian quadrature formulas for analytic functions

Let (S_n) be the sequence given by the Jacobi-Gauss quadrature method when the integrand is an analytic function with a lopatilluric singularity or with a branch point on the real axis, and S its limi. We give an asymptotic representation of the errors S − S_n and of S_n+s − S_n, which leads to building other sequences which give a better approximation of the exact value of the integral than S_n. All the results are illustrated by numerical examples.     

On the exponential map of borei subgroups in a semi-simple lie group

Let G be a connected, complex, semi-simple Lie group Let g be an element in G. Let B be a Borel subgroup of G and g in B. Let m and n be the least positive integers such that the element g^m lies on a one-parameter subgroup in G and the element gⁿ lies on a one-parameter subgroup in B. We denote these integers by ind_G(g) and ind_B(g). In this note we prove the conjecture ind_G(g) = ind_B(g), if g is regular.