<Emphasis Type="Italic">k</Emphasis>-Idempotency of linear combinations of an idempotent matrix and a tripotent matrix that commute

A complete solution is established to the problem of characterizing all situations in which a linear combination C = c ₁ A+c ₂ B of an idempotent matrix A and a tripotent matrix B is k-idempotent. As a special case of this, a set of necessary and sufficient conditions for a linear combination C = c ₁ A+c ₂ B to be k-idempotent when A and B are idempotent matrices, is also studied in this paper.     

Minkowski spaces with extremal distance from the Euclidean space

It is proved that if the Banach-Mazur distance between ann-dimensional Minkowski spaceB andl ₂ ⁿ satisfiesd (B ₁ l ₂ ⁿ ) ≧c √n (for some constantc>0 and for bign) thenB contains anA(c)-isomorphic copy ofl ₁ ^k (fork ∼ log log logn). In the special cased (B ₁ l ₂ ⁿ ) = √n,B contains an isometric copy ofl ₁ ^k fork ∼ logn.     

Distributions of eigenvalues and inertias of some block Hermitian matrices consisting of orthogonal projectors

A complex square matrix A is called an orthogonal projector if A ²?=?A?=?A*, where A* is the conjugate transpose of A. In this article, we first give some formulas for calculating the distributions of real eigenvalues of a linear combination of two orthogonal projectors. Then, we establish various expansion formulas for calculating the inertias, ranks and signatures of some 2?×?2 and 3?×?3, as well as k?×?k block Hermitian matrices consisting of two orthogonal projectors. Many applications of the formulas are presented in characterizing interval distributions of numbers of eigenvalues, and nonsingularity of these block Hermitian matrices. In addition, necessary and sufficient conditions are given for various equalities and inequalities of these block Hermitian matrices to hold.     

Idempotency of linear combinations of an idempotent matrix and a t -potent matrix that do not commute

The problem of characterizing all situations in which aA?+?bB is an idempotent matrix when A ²?=?A, B ^k?+?1?=?B, AB?≠?BA, and a, b are nonzero complex numbers is studied.     

Nonsingularity and group invertibility of linear combinations of two k-potent matrices

An n × n complex matrix A is said to be k-potent if A ^k = A. Let T ₁ and T ₂ be k-potent and c ₁ and c ₂ be two nonzero complex numbers. We study the range space, null space, nonsingularity and group invertibility of linear combinations T = c ₁ T ₁ + c ₂ T ₂ of two k-potent matrices T ₁ and T ₂.     

Polynomial projectors preserving homogeneous partial differential equations

A polynomial projector Π of degree d on is said to preserve homogeneous partial differential equations (HPDE) of degree k if for every and every homogeneous polynomial of degree k, q(z)=∑_|α|=ka_αz^α, there holds the implication: q(D)f=0q(D)Π(f)=0. We prove that a polynomial projector Π preserves HPDE of degree if and only if there are analytic functionals with such that Π is represented in the following form

with some , where u_α(z)z^α/α!. Moreover, we give an example of polynomial projectors preserving HPDE of degree k (k1) without preserving HPDE of smaller degree. We also give a characterization of Abel–Gontcharoff projectors as the only Birkhoff polynomial projectors that preserve all HPDE.     

Spectral decomposition and Gelfand’s theorem

We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set $\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\}We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set s(A)={il_k;k ? \mathbb\mathbbZ^*}\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\} is discrete and satisfies ?\frac1|l_k|^ld_kⁿ < ￥\sum \frac{1}{|\lambda_{k}|^{\ell}\delta_{k}^{n}}<\infty , where ℓ is a nonnegative integer and d_k=min(\frac|l_k+1-l_k|2,\frac|l_k-1-l_k|2)\delta _{k}=\min(\frac{|\lambda_{k+1}-\lambda _{k}|}{2},\frac{|\lambda _{k-1}-\lambda _{k}|}{2}) . In this case, Theorem 3, we show by using Gelfand’s Theorem that there exists a family of projectors (P_k)_{k ? \mathbb\mathbbZ^*}(P_{k})_{k\in\mathbb{\mathbb{Z}}^{*}} such that, for any x∈D(A ^n+ℓ ), the decomposition ∑P _k x=x holds.     

Construction of nonnegative matrices and the inverse eigenvalue problem

This article presents a technique for combining two matrices, an n?×?n matrix M and an m?×?m matrix B, with known spectra to create an (n?+?m???p)?×?(n?+?m???p) matrix N whose spectrum consists of the spectrum of the matrix M and m???p eigenvalues of the matrix B. Conditions are given when the matrix N obtained in this construction is nonnegative. Finally, these observations are used to obtain several results on how to construct a realizable list of n?+?1 complex numbers (λ₁,λ₂,λ₃,σ) from a given realizable list of n complex numbers (c ₁,c ₂,σ), where c ₁ is the Perron eigenvalue, c ₂ is a real number and σ is a list of n???2 complex numbers.     

A note on skew differential operators on commutative rings

Let A be a commutative integral domain that is a finitely generated algebra over a field k of characteristic 0 and let ø be a k-algebra automorphism of A of finite order m. In this note we study the ring D(A;ø of differential operators introduced by A.D. Bell. We prove that if A is a free module over the fixed sub-ring A ^ø, with a basis containing 1, then D(A;ø) is isomorphic to the matrix ring M_m(D(A ^ø). It follows from Grothendieck's Generic Flatness Theorem that for an arbitrary A there is an element c?Asuch that D(A[c^-1];ø)?M _m(D(A[c^-1]^ø)). As an application, we consider the structure of D(A;ø)when A is a polynomial or Laurent polynomial ring over k and ø is a diagonalizable linear automorphism.     

On linear combinations of generalized involutive matrices

Let X ^? denotes the Moore--Penrose pseudoinverse of a matrix X. We study a number of situations when (aA?+?bB)^??=?aA?+?bB provided a,?b?∈?????{0} and A, B are n?×?n complex matrices such that A ^??=?A and B ^??=?B.     

Integrals and Banach spaces for finite order distributions

Let B _c denote the real-valued functions continuous on the extended real line and vanishing at −∞. Let B _r denote the functions that are left continuous, have a right limit at each point and vanish at −∞. Define A _c ⁿ to be the space of tempered distributions that are the nth distributional derivative of a unique function in B _c . Similarly with A _r ⁿ from B _r . A type of integral is defined on distributions in A _c ⁿ and A _r ⁿ . The multipliers are iterated integrals of functions of bounded variation. For each n ∈ ℕ, the spaces A _c ⁿ and A _r ⁿ are Banach spaces, Banach lattices and Banach algebras isometrically isomorphic to B _c and B _r , respectively. Under the ordering in this lattice, if a distribution is integrable then its absolute value is integrable. The dual space is isometrically isomorphic to the functions of bounded variation. The space A _c ¹ is the completion of the L ¹ functions in the Alexiewicz norm. The space A _r ¹ contains all finite signed Borel measures. Many of the usual properties of integrals hold: H?lder inequality, second mean value theorem, continuity in norm, linear change of variables, a convergence theorem.     

On Additive Decomposition of the Hermitian Solution of the Matrix Equation AXA* = B

The decomposition of a Hermitian solution of the linear matrix equation AXA* = B into the sum of Hermitian solutions of other two linear matrix equations A₁X₁A^*₁ = B₁{A_{1}X_{1}A^{*}_{1} = B_{1}} and A₂X₂A^*₂ = B₂{A_{2}X_{2}A^*_{2} = B_{2}} are approached. As applications, the additive decomposition of Hermitian generalized inverse C ⁻ = A ⁻ + B ⁻ for three Hermitian matrices A, B and C is also considered.     

Bounds on the k-th generalized base of a primitive sign pattern matrix

You et al. [L. You, J. Shao, and H. Shan, Bounds on the bases of irreducible generalized sign pattern matrices, Lin. Alg. Appl. 427 (2007), pp. 285–300] extended the concept of the base of a powerful sign pattern matrix to the nonpowerful, irreducible sign pattern matrices. The key to their generalization was to view the relationship A ^l =A ^l?+?p as an equality of generalized sign patterns rather than of sign patterns. You, Shao and Shan showed that for primitive generalized sign patterns, the base is the smallest positive integer k such that all entries of A ^k are ambiguous. In this paper we study the k-th generalized base for nonpowerful primitive sign pattern matrices. For a primitive, nonpowerful sign pattern A, this is the smallest positive integer h such that A^k has h rows consisting entirely of ambiguous entries. Extending the work of You, Shao and Shan, we obtain sharp upper bounds on the k-th generalized base, together with a complete characterization of the equality cases for those bounds. We also show that there exist gaps in the k-th generalized base set of the classes of such matrices.     

Spectral inverses and the row-space equations

It is shown that if the two row-space equations BA^l+1=A^l and AB^k+1=B^k hold, then A and B possess Drazin inverses. Spectral properties of this type of spectral inverse are discussed.     

Correlated equilibria of games with many players

Let G _m,n be the class of strategic games with n players, where each player has m≥2 pure strategies. We are interested in the structure of the set of correlated equilibria of games in G _m,n when n→∞. As the number of equilibrium constraints grows slower than the number of pure strategy profiles, it might be conjectured that the set of correlated equilibria becomes large. In this paper, we show that (1) the average relative measure of the set of correlated equilibria is smaller than 2⁻ⁿ; and (2) for each 1<c<m, the solution set contains c ⁿ correlated equilibria having disjoint supports with a probability going to 1 as n grows large. The proof of the second result hinges on the following inequality: Let c ₁, …, c _l be independent and symmetric random vectors in R ^k, l≥k. Then the probability that the convex hull of c ₁, …, c _l intersects R ^k ₊ is greater than or equal to . Received: December 1998/Final version: March 2000     

Almost completely decomposable groups with primary regulator quotients and their endomorphism rings

Let X be a block-rigid almost completely decomposable group of ring type with regulator A and p-primary regulator quotient X/A such that p ^l = exp X/A with natural l > 1. From the well-known fact p ^l End A ⊂ End X ⊂ End A it follows that End X = End X ∪ End A and p ^l End A = End X ∪ p ^l End A. Generalizing these, we determine the chain End X = ɛ _A ^(l) ⊂ ɛ _A ^(l−1) ⊂ ɛ _A ^(l−2) ⊂ ⋯ ⊂ ɛ _A ⁽¹⁾ ⊂ ɛ _A ⁽⁰⁾ = End A, satisfying p ^l−k ɛ _A ^(k) = End X ∪p ^l−k End A, and construct groups X _k ^′ and such that ɛ _A ^(k) = Hom , where k = 1, 2,..., l − 1. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 12, No. 2, pp. 17–38, 2006.     

Necessary and sufficient condition in Lyapunov robust control: Multi-input case

We consider a linear time-invariant finite-dimensional system x=Ax+Bu with multi-inputu, in which the matricesA andB are in canonical controller form. We assume that the system is controllable andB has rankm. We study the Lyapunov equationPA+A ^T P+Q=0, withQ>0, and investigate the properties thatP must satisfy in order that the canonical controller matrixA be Hurwitz. We show that, for the matrixA being Hurwitz, it is necessary and sufficient thatB ^T PB>0 and that the determinant ofB ^T PW be Hurwitz, whereW=block diag[w ₁,...,w _m ], with elementw _i =[s ^k _i –1,s ^k _i –2,...,s, 1] ^T ; here, the symbolsk _i ,i=1, 2, ...,m, denote the Kronecker invariants with respect to the pair {A, B}. This result has application in designing robust controllers for linear uncertain systems.     

Eigenvalues of products of matrices

Let A and B be n?×?n matrices over an algebraically closed field F. The pair ( A,?B ) is said to be spectrally complete if, for every sequence c₁,…,c_n ∈F such that det (AB)=c₁ ,…,c_n , there exist matrices A′,B,′∈F,^n×n similar to A,?B, respectively, such that A′B′ has eigenvalues c₁,…,c_n . In this article, we describe the spectrally complete pairs. Assuming that A and B are nonsingular, the possible eigenvalues of A′B′ when A′ and B′ run over the sets of the matrices similar to A and B, respectively, were described in a previous article.     

Controllability completion problems of partial upper triangular matrices ∗

The main result of this paper states sufficient conditions for the existence of a completion A_c of an n × n partial upper triangular matrix A, such that the pair (A_c B) has prescribed controllability indices, being B an n×m matrix. If A is a partial Hessenberg matrix some conditions may be dropped. An algorithm that obtains a completion A_c of A such that pair (A_c e_k ) is completely controllable, where e_k is a unit vector, is used to proof the results.