A criterion for generating full matrix algebras

Let M_n(F) be the algebra of n×n matrices over a field F, and let A∈M_n(F) have characteristic polynomial c(x)=p₁(x)p₂(x)?p_r(x) where p₁(x),…,p_r(x) are distinct and irreducible in F[x]. Let X be a subalgebra of M_n(F) containing A. Under a mild hypothesis on the p_i(x), we find a necessary and sufficient condition for X to be M_n(F).     

On the span of Hadamard products of vectors

Let A₁, … , A_k be positive semidefinite matrices and B₁, … , B_k arbitrary complex matrices of order n. We show that

span{(A₁x)°(A₂x)°?°(A_kx)|x∈Cⁿ}=range(A₁°A₂°?°A_k)     

Asymptotic estimates of sums involving the Moebius function

Let p(n) denote the smallest prime factor of an integer n>1 and let p(1)=∞. We study the asymptotic behavior of the sum M(x,y)=Σ_{1≤n≤x,p(n)>y}μ(n) and use this to estimate the size of A(x)=max_|f|≤1|Σ_2≤n<xμ(n)f(p(n))|, where μ(n) is the Moebius function. Applications of bounds for A(x), M(x,y) and similar quantities are discussed.     

The zeros of a quadratic form at square-free points

Let F(x₁,…,xn) be a nonsingular indefinite quadratic form, n=3 or 4. For n=4, suppose the determinant of F is a square. Results are obtained on the number of solutions of

F(x₁,…,xn)=0     

Determination of means by invariance

If M is a mean on and M(f(x₁),f(x₂),…,f(xn))=f(M(x₁,x₂,…,xn)) then we say that M is invariant under f. The problem is to find a class of functions that by invariance determines a mean uniquely. We focus on the geometric mean, which can be transformed to obtain results for other means.     

On injective Jordan semi-triple maps of matrix algebras

We show that every injective Jordan semi-triple map on the algebra M_n(F) of all n × n matrices with entries in a field F (i.e. a map Φ:M_n(F)→M_n(F) satisfying

Φ(ABA)=Φ(A)Φ(B)Φ(A)     

A multiply intersecting Erd?s-Ko-Rado theorem — The principal case

Let m(n,k,r,t) be the maximum size of satisfying |F₁∩?∩F_r|≥t for all F₁,…,F_r∈F. We prove that for every p∈(0,1) there is some r₀ such that, for all r>r₀ and all t with 1≤t≤⌊(p^1−r−p)/(1−p)⌋−r, there exists n₀ so that if n>n₀ and p=k/n, then . The upper bound for t is tight for fixed p and r.     

A new characterization of dual bases in finite fields and its applications

We propose a new characterization of dual bases in finite fields. Let A=(α₁,…,α_n) be a basis of F over F_q and its dual basis B=(β₁,…,β_n) with the transition matrix C∈GL_n(F_q) such that (β₁,…,β_n)=(α₁,…,α_n)C. We show that holds for all 1?k?n, where T_k∈M_n(F_q) satisfies α_k(α₁,…,α_n)=(α₁,…,α_n)T_k. Conversely, suppose F=F_q(α_k^′) and for some 1?k^′?n and G∈GL_n(F_q), then B is equivalent to (α₁,…,α_n)G. As applications, we can construct the dual basis of a given basis A or determine whether the dual basis of A satisfies the desired conditions from T_k. This generalizes the results obtained by Liao and Sun for normal bases. Furthermore, we give a simple proof of the theorem of Gollmann, Wang and Blake for polynomial bases.     

On the bounds for the norms of r-circulant matrices with the Fibonacci and Lucas numbers

In this paper, we have found upper and lower bounds for the spectral norms of r-circulant matrices in the forms A = C_r(F₀, F₁, …, F_n−1), B = C_r(L₀, L₁, …, L_n−1), and we have obtained some bounds for the spectral norms of Kronecker and Hadamard products of A and B matrices.     

An extension of Birkhoff’s theorem with an application to determinants

Let M_n(F) denote the algebra of n×n matrices over the field F of complex, or real, numbers. Given a self-adjoint involution J∈M_n(C), that is, J=J^*,J²=I, let us consider Cⁿ endowed with the indefinite inner product [,] induced by J and defined by [x,y]?〈Jx,y〉,x,y∈Cⁿ. Assuming that (r,n-r), 0?r?n, is the inertia of J, without loss of generality we may assume J=diag(j₁,?,j_n)=I_r⊕-I_n-r. For T=(|t_ik|²)∈M_n(R), the matrices of the form T=(|t_ik|²j_ij_k), with all line sums equal to 1, are called J-doubly stochastic matrices. In the particular case r∈{0,n}, these matrices reduce to doubly stochastic matrices, that is, non-negative real matrices with all line sums equal to 1. A generalization of Birkhoff’s theorem on doubly stochastic matrices is obtained for J-doubly stochastic matrices and an application to determinants is presented.     

Isomorphisms between unital C-algebras

It is shown that every almost linear bijection of a unital C^∗-algebra A onto a unital C^∗-algebra B is a C^∗-algebra isomorphism when h(n²uy)=h(n²u)h(y) for all unitaries u∈A, all y∈A, and n=0,1,2,…, and that almost linear continuous bijection of a unital C^∗-algebra A of real rank zero onto a unital C^∗-algebra B is a C^∗-algebra isomorphism when h(n²uy)=h(n²u)h(y) for all , all y∈A, and n=0,1,2,…. Assume that X and Y are left normed modules over a unital C^∗-algebra A. It is shown that every surjective isometry , satisfying T(0)=0 and T(ux)=uT(x) for all x∈X and all unitaries u∈A, is an A-linear isomorphism. This is applied to investigate C^∗-algebra isomorphisms between unital C^∗-algebras.     

Grandes valeurs et nombres champions de la fonction arithmétique de Kalmár

The Kalmár function K(n) counts the factorizations n=x₁x₂…xr with xi?2(1?i?r). Its Dirichlet series is where ζ(s) denotes the Riemann ζ function. Let ρ=1.728… be the root greater than 1 of the equation ζ(s)=2. Improving on preceding results of Kalmár, Hille, Erd?s, Evans, and Klazar and Luca, we show that there exist two constants C₅ and C₆ such that, for all n, holds, while, for infinitely many n's, .An integer N is called a K-champion number if M<N⇒K(M)<K(N). Several properties of K-champion numbers are given, mainly about the size of the exponents and the number of prime factors in the standard factorization into primes of a large enough K-champion number.The proof of these results is based on the asymptotic formula of K(n) given by Evans, and on the solution of a problem of optimization.     

The algebraic structure of the set of solutions to the Thue equation

Let Fn be a binary form with integral coefficients of degree n?2, let d denote the greatest common divisor of all non-zero coefficients of Fn, and let h?2 be an integer. We prove that if d=1 then the Thue equation (T) Fn(x,y)=h has relatively few solutions: if A is a subset of the set T(Fn,h) of all solutions to (T), with r:=card(A)?n+1, then

(#)

h divides the numberΔ(A):=_∏1?k<l?rδ(ξk,ξl),

where ξk=〈xk,yk〉∈A, 1?k?r, and δ(ξk,ξl)=xkyl−xlyk. As a corollary we obtain that if h is a prime number then, under weak assumptions on Fn, there is a partition of T(Fn,h) into at most n subsets maximal with respect to condition (#).     

An Erd?s-Ko-Rado theorem for partial permutations

Let [n] denote the set of positive integers {1,2,…,n}. An r-partial permutation of [n] is a pair (A,f) where A⊆[n], |A|=r and f:A→[n] is an injective map. A set A of r-partial permutations is intersecting if for any (A,f), (B,g)∈A, there exists x∈A∩B such that f(x)=g(x). We prove that for any intersecting family A of r-partial permutations, we have .It seems rather hard to characterize the case of equality. For 8?r?n-3, we show that equality holds if and only if there exist x₀ and ε₀ such that A consists of all (A,f) for which x₀∈A and f(x₀)=ε₀.     

Davenport constant with weights and some related questions, II

Let G be a finite abelian group of order n and let A⊆Z be non-empty. Generalizing a well-known constant, we define the Davenport constant of G with weight A, denoted by DA(G), to be the least natural number k such that for any sequence (x₁,…,xk) with xi∈G, there exists a non-empty subsequence (xj₁,…,xjl) and a₁,…,al∈A such that . Similarly, for any such set A, EA(G) is defined to be the least t∈N such that for all sequences (x₁,…,xt) with xi∈G, there exist indices j₁,…,jn∈N,1?j₁<?<jn?t, and ?₁,…,?n∈A with . In the present paper, we establish a relation between the constants DA(G) and EA(G) under certain conditions. Our definitions are compatible with the previous generalizations for the particular group G=Z/nZ and the relation we establish had been conjectured in that particular case.     

Strong linear preservers of rank reverse permutability on triangular matrices

Let F be a field with ∣F∣ > 2 and T_n(F) be the set of all n × n upper triangular matrices, where n ? 2. Let k ? 2 be a given integer. A k-tuple of matrices A₁, …, A_k ∈ T_n(F) is called rank reverse permutable if rank(A₁ A₂ ? A_k) = rank(A_k A_k−1 ? A₁). We characterize the linear maps on T_n(F) that strongly preserve the set of rank reverse permutable matrix k-tuples.