A note on k-potence preserving maps

Let M_n be the algebra of all n×n complex matrices and Γ_n the set of all k-potent matrices in M_n. Suppose ?:M_n→M_n is a map satisfying A-λB∈Γ_n implies ?(A)-λ?(B)∈Γ_n, where A, B∈M_n, λ∈C. Then either ? is of the form ?(A)=cTAT^-1, A∈M_n, or ? is of the form ?(A)=cTA^tT^-1, A∈M_n, where T∈M_n is an invertible matrix, c∈C satisfies c^k=c.     

On the existence of an arrow and a Bergson-Samuelson social welfare function

Let Σ be the set of all possible preferences over a given set of alternatives A. Let Ω be a proper subset of Σ and let P?Ωⁿ be a fixed profile of preferences. P is heterogeneous in Ω if for all a,b,c?A and Q?Ωⁿ, there exist three alternatives x,y,z?A such that Q(a,b,c)=P(x,y,z) where Q(B) denotes the subprofile over a set of alternatives B?A. An Arrow SWF ? is a function ?:Ωⁿ→Σ satisfying the conditions Pareto and IIA. A Bergson-Samuelson SWF is a function ?:P→Σ satisfying Pareto and Independence+Neutrality. The paper shows that (a) there exist a neutral nondictatorial Arrow SWF on Ω if and only if there exist a neutral nondictatorial Bergson-Samuelson SWF on P. (b) There exist a nondictatorial n person Bergson-Samuelson SWF on P if and only if there exists a 3 person Bergson-Samuelson SWF on P. (c) There exists a nondictatorial Arrow SWF on Ω if and only if there exists a nondictatorial Bergson-Samuelson SWF on P.     

Small divisors of Bernoulli sums

Let ?= {?_i,i ≥1} be a sequence of independent Bernoulli random variables (P{?_i = 0} = P{?_i = 1 } = 1/2) with basic probability space (Ω, A, P). Consider the sequence of partial sums B_n=?₁+...+?_n, n=1,2..... We obtain an asymptotic estimate for the probability P{P^-(B_n) > >} for >≤n^{e/log log n}, c a positive constant.     

k-Potence preserving maps without the linearity and surjectivity assumptions

Let M_n be the space of all n × n complex matrices, and let Γ_n be the subset of M_n consisting of all n × n k-potent matrices. We denote by Ψ_n the set of all maps on M_n satisfying A − λB ∈ Γ_n if and only if ?(A) − λ?(B) ∈ Γ_n for every A,B ∈ M_n and λ ∈ C. It was shown that ? ∈ Ψ_n if and only if there exist an invertible matrix P ∈ M_n and c ∈ C with c^k−1 = 1 such that either ?(A) = cPAP⁻¹ for every A ∈ M_n, or ?(A) = cPA^TP⁻¹ for every A ∈ M_n.     

On regular graphs,V

Let Γ₃ be an infinite regular tree of valence 3. There exist subgroups B of Aut (Γ₃) which are 5-regular on Γ₃, i.e., sharply transitive on the set of 5-arcs of Γ₃. We prove that any two such subgroups are conjugate in Aut (Γ₃). The pair (Γ₃, B) is a universal 5-regular action in the sense that if (G, A) is a pair consisting of a cubical graph G and a 5-regular subgroup A of automorphisms of G then (G, A) can be “covered” by (Γ₃, B) in a certain natural way.     

Vanishing viscosity in the plane for vorticity in borderline spaces of Besov type

The existence and uniqueness of solutions to the Euler equations for initial vorticity in BΓ∩Lp₀∩Lp₁ was proved by Misha Vishik, where BΓ is a borderline Besov space parameterized by the function Γ and 1<p₀<2<p₁. Vishik established short time existence and uniqueness when Γ(n)=O(logn) and global existence and uniqueness when . For initial vorticity in BΓ∩L², we establish the vanishing viscosity limit in L²(R²) of solutions of the Navier-Stokes equations to a solution of the Euler equations in the plane, convergence being uniform over short time when Γ(n)=O(logn) and uniform over any finite time when Γ(n)=O(logκn), 0?κ<1, and we give a bound on the rate of convergence. This allows us to extend the class of initial vorticities for which both global existence and uniqueness of solutions to the Euler equations can be established to include BΓ∩L² when Γ(n)=O(logκn) for 0<κ<1.     

Products of two involutions with prescribed eigenvalues and some applications

Let F be a field. In [Djokovic, Product of two involutions, Arch. Math. 18 (1967) 582-584] it was proved that a matrix A∈F^n×n can be written as A=BC, for some involutions B,C∈F^n×n, if and only if A is similar to A^-1. In this paper we describe the possible eigenvalues of the matrices B and C.As a consequence, in case charF≠2, we describe the possible similarity classes of (P₁₁⊕P₂₂)P^-1, when the nonsingular matrix P=[P_ij]∈F^n×n, i,j∈{1,2} and P₁₁∈F^s×s, varies.When F is an algebraically closed field and charF≠2, we also describe the possible similarity classes of [A_ij]∈F^n×n, i,j∈{1,2}, when A₁₁ and A₂₂ are square zero matrices and A₁₂ and A₂₁ vary.     

Representations for the weighted Drazin inverse of a sum of matrices

Three representations for the W-weighted Drazin inverse of a matrix A?CWB have been developed under some conditions where A,B,C∈? ^m×n , and W∈? ^n×m . The results of this paper not only extend the earlier works about the Drazin inverse and group inverse, but also weaken the assumed condition of a result of the Drazin inverse to the case where Γ _d ZZ _g =ZZ _g Γ _d is substituted with C(Γ _d ZZ _g ?ZZ _g Γ _d )B=0. Numerical examples are given to illustrate some new results.     

Lower bound inequalities for norms of symmetrized tensor powers

Let V be a complex inner product space of positive dimension m with inner product 〈·,·〉, and let T_n(V) denote the set of all n-linear complex-valued functions defined on V×V×?×V (n-copies). By S_n(V) we mean the set of all symmetric members of T_n(V). We extend the inner product, 〈·,·〉, on V to T_n(V) in the usual way, and we define multiple tensor products A₁⊗A₂⊗?⊗A_n and symmetric products A₁·A₂?A_n, where q₁,q₂,…,q_n are positive integers and A_i∈T_qi(V) for each i, as expected. If A∈S_n(V), then A^k denotes the symmetric product A·A?A where there are k copies of A. We are concerned with producing the best lower bounds for ‖A^k‖², particularly when n=2. In this case we are able to show that ‖A^k‖² is a symmetric polynomial in the eigenvalues of a positive semi-definite Hermitian matrix, M_A, that is closely related to A. From this we are able to obtain many lower bounds for ‖A^k‖². In particular, we are able to show that if ω denotes 1/r where r is the rank of M_A, and , then

     

The E-theoretic descent functor for groupoids

The paper establishes, for a wide class of locally compact groupoids Γ, the E-theoretic descent functor at the C^∗-algebra level, in a way parallel to that established for locally compact groups by Guentner, Higson and Trout. Section 2 shows that Γ-actions on a C₀(X)-algebra B, where X is the unit space of Γ, can be usefully formulated in terms of an action on the associated bundle B^?. Section 3 shows that the functor B→C^∗(Γ,B) is continuous and exact, and uses the disintegration theory of J. Renault. Section 4 establishes the existence of the descent functor under a very mild condition on Γ, the main technical difficulty involved being that of finding a Γ-algebra that plays the role of Cbcont(T,B) in the group case.     

On orthogonal systems of matrix algebras

In this work it is shown that certain interesting types of orthogonal system of subalgebras (whose existence cannot be ruled out by the trivial necessary conditions) cannot exist. In particular, it is proved that there is no orthogonal decomposition of M_n(C)⊗M_n(C)≡M_n²(C) into a number of maximal abelian subalgebras and factors isomorphic to M_n(C) in which the number of factors would be 1 or 3.In addition, some new tools are introduced, too: for example, a quantity c(A,B), which measures “how close” the subalgebras A,B⊂M_n(C) are to being orthogonal. It is shown that in the main cases of interest, c(A^′,B^′) - where A^′ and B^′ are the commutants of A and B, respectively - can be determined by c(A,B) and the dimensions of A and B. The corresponding formula is used to find some further obstructions regarding orthogonal systems.     

Row-ordering schemes for sparse givens transformations. I. bipartite graph model

Let A be an m-by-n matrix, m?n, and let P_r and P_c be permutation matrices of order m and n respectively. Suppose P_rAP_c is reduced to upper trapezoidal form $\text{(}\text{R}\text{O}\text{)}$ using Givens rotations, where R is n by n and upper triangular. The sparsity structure of R depends only on P_c. For a fixed P_c, the number of arithmetic operations required to compute R depends on P_r. In this paper, we consider row-ordering strategies which are appropriate when P_c is obtained from nested-dissection orderings of A^TA. Recently, it was shown that so-called “width-2” nested-dissection orderings of A^TA could be used to simultaneously obtain good row and column orderings for A. In this series of papers, we show that the conventional (width-1) nested-dissection orderings can also be used to induce good row orderings. In this first paper, we analyze the application of Givens rotations to a sparse matrix A using a bipartite-graph model.     

On the extendability of Bi-Cayley graphs of finite abelian groups

Let G be a finite group and A a nonempty subset (possibly containing the identity element) of G. The Bi-Cayley graph X=BC(G,A) of G with respect to A is defined as the bipartite graph with vertex set G×{0,1} and edge set {{(g,0),(sg,1)}∣g∈G,s∈A}. A graph Γ admitting a perfect matching is called n-extendable if ∣V(Γ)∣≥2n+2 and every matching of size n in Γ can be extended to a perfect matching of Γ. In this paper, the extendability of Bi-Cayley graphs of finite abelian groups is explored. In particular, 2-extendable and 3-extendable Bi-Cayley graphs of finite abelian groups are characterized.     

A Grothendieck-type theorem for the space of totally measurable functions

Let Σ be a σ-algebra of subsets of a non-empty set Ω. Let X be a real Banach space and let X^* stand for the Banach dual of X. Let B(Σ, X) be the Banach space of Σ-totally measurable functions f: Ω → X, and let B(Σ, X)^* and B(Σ, X)^** denote the Banach dual and the Banach bidual of B(Σ, X) respectively. Let bvca(Σ, X^*) denote the Banach space of all countably additive vector measures ν: Σ → X^* of bounded variation. We prove a form of generalized Vitali-Hahn-Saks theorem saying that relative σ(bvca(Σ, X^*), B(Σ, X))-sequential compactness in bvca(Σ, X^*) implies uniform countable additivity. We derive that if X reflexive, then every relatively σ(B(Σ, X)^*, B(Σ, X))-sequentially compact subset of B(Σ, X)_c^~ (= the σ-order continuous dual of B(Σ, X)) is relatively σ(B(Σ, X)^*, B(Σ, X)^**)-sequentially compact. As a consequence, we obtain a Grothendieck type theorem saying that σ(B(Σ, X)^*, B(Σ, X))-convergent sequences in B(Σ, X)_c^~ are σ(B(Σ, X)^*, B(Σ, X)^**)-convergent.     

The Terwilliger algebra of a distance-regular graph of negative type

Let Γ denote a distance-regular graph with diameter D?3. Assume Γ has classical parameters (D,b,α,β) with b<-1. Let X denote the vertex set of Γ and let A∈Mat_X(C) denote the adjacency matrix of Γ. Fix x∈X and let A^∗∈Mat_X(C) denote the corresponding dual adjacency matrix. Let T denote the subalgebra of Mat_X(C) generated by A,A^∗. We call T the Terwilliger algebra of Γ with respect to x. We show that up to isomorphism there exist exactly two irreducible T-modules with endpoint 1; their dimensions are D and 2D-2. For these T-modules we display a basis consisting of eigenvectors for A^∗, and for each basis we give the action of A.     

Doubly stochastic matrices with some equal diagonal sums

Let A be doubly stochastic, and let τ₁,…,τ_m be m mutually disjoint zero diagonals in A, 1?m?n-1. E. T. H. Wang conjectured that if every diagonal in A disjoint from each τ_k (k=1,…,m) has a constant sum, then all entries in A off the m zero diagonals τ_k are equal to (n?m)^-1. Sinkhorn showed the conjecture to be correct. In this paper we generalize this result for arbitrary doubly stochastic zero patterns.     

A common property of R(E, F) and B(ℝ n , ℝ m ) and a new method for seeking a path to connect two operators

Given two Banach spaces E, F, let B(E, F) be the set of all bounded linear operators from E into F, and R(E, F) the set of all operators in B(E, F) with finite rank. It is well-known that B(? ⁿ ) is a Banach space as well as an algebra, while B(? ⁿ , ? ^m ) for m ≠ n, is a Banach space but not an algebra; meanwhile, it is clear that R(E, F) is neither a Banach space nor an algebra. However, in this paper, it is proved that all of them have a common property in geometry and topology, i.e., they are all a union of mutual disjoint path-connected and smooth submanifolds (or hypersurfaces). Let Σ _r be the set of all operators of finite rank r in B(E, F) (or B(? ⁿ , ? ^m )). In fact, we have that 1) suppose Σ _r ∈ B(? ⁿ , ? ^m ), and then Σ _r is a smooth and path-connected submanifold of B(? ⁿ , ? ^m ) and dimΣ _r = (n + m)r ? r ², for each r ∈ [0, min{n,m}; if m ≠ n, the same conclusion for Σ _r and its dimension is valid for each r ∈ [0, min{n, m}]; 2) suppose Σ _r ∈ B(E, F), and dimF = ∞, and then Σ _r is a smooth and path-connected submanifold of B(E, F) with the tangent space T _A Σ _r = {B ∈ B(E, F): BN(A) ? R(A)} at each A ∈ Σ _r for 0 ? r ? ∞. The routine methods for seeking a path to connect two operators can hardly apply here. A new method and some fundamental theorems are introduced in this paper, which is development of elementary transformation of matrices in B(? ⁿ ), and more adapted and simple than the elementary transformation method. In addition to tensor analysis and application of Thom’s famous result for transversility, these will benefit the study of infinite geometry.     

On numerical ranges of the compressions of normal matrices

For an n × n normal matrix A, whose numerical range NR[A] is a k-polygon (k ? n), an n × (k − 1) isometry matrix P is constructed by a unit vector υ∈Cⁿ, and NR[P∗AP] is inscribed to NR[A]. In this paper, using the notations of NR[P∗AP] and some properties from projective geometry, an n × n diagonal matrix B and an n × (k − 2) isometry matrix Q are proposed such that NR[P∗AP] and NR[Q∗BQ] have as common support lines the edges of the k-polygon and share the same boundary points with the polygon. It is proved that the boundary of NR[P∗AP] is a differentiable curve and the boundary of the numerical range of a 3 × 3 matrix P∗AP is an ellipse, when the polygon is a quadrilateral.     

A note on a conjecture on permanents

Let Kn denote the set of all n × n nonnegative matrices whose entries have sum n, and let ϕ be a real function on K_n defined by ϕ (X) = Πⁿ_i=1Σⁿ_j=1x_ij + Πⁿ_j=1Σⁿ_i=1x_ij − per X for X = [x_ij] ϵ K_n. A matrix A ϵ K_n is called a ϕ -maximizing matrix on K_n if ϕ (A) ⩾ ϕ (X) for all X ϵ K_n. It is conjectured that J_n = [1/n]_{n × n} is the unique ϕ-maximizing matrix on K_n. In this note, the following are proved: (i) If A is a positive ϕ-maximizing matrix, then A = J_n. (ii) If A is a row stochastic ϕ-maximizing matrix, then A = J_n. (iii) Every row sum and every column sum of a ϕ-maximizing matrix lies between 1 − √2·n!/nⁿ and 1 + (n − 1)√2·n!/nⁿ. (iv) For any p.s.d. symmetric A ϵ K_n, ϕ (A) ⩽ 2 − n!/nⁿ with equality iff A = J_n. (v) ϕ attains a strict local maximum on K_n at J_n.