On commuting varieties of upper triangular matrices

It is known that the variety of the pairs of n×n commuting upper triangular matrices is not a complete intersection for infinitely many values of n; we show that there exists m such that this happens if and only if n>m. We also show that m<18 and that m could be found by determining the dimension of the variety of the pairs of commuting strictly upper triangular matrices. Then, we define an embedding of any commuting variety into a grassmannian of subspaces of codimension 2.     

Commuting Derivations and Automorphisms of Certain Nilpotent Lie Algebras Over Commutative Rings

Let L be a finite-dimensional complex simple Lie algebra, L _? be the ?-span of a Chevalley basis of L, and L _R  = R ?_? L _? be a Chevalley algebra of type L over a commutative ring R. Let 𝒩(R) be the nilpotent subalgebra of L _R spanned by the root vectors associated with positive roots. A map ? of 𝒩(R) is called commuting if [?(x), x] = 0 for all x ∈ 𝒩(R). In this article, we prove that under some conditions for R, if Φ is not of type A ₂, then a derivation (resp., an automorphism) of 𝒩(R) is commuting if and only if it is a central derivation (resp., automorphism), and if Φ is of type A ₂, then a derivation (resp., an automorphism) of 𝒩(R) is commuting if and only if it is a sum (resp., a product) of a graded diagonal derivation (resp., automorphism) and a central derivation (resp., automorphism).     

On the number of disjoint pairs of S-permutation matrices

In [R. Fontana, Fraction of permutations, an application to Sudoku, Journal of Statistical Planning and Inference 141 (2011) 3697–3704], Roberto Fontana offers an algorithm for obtaining Sudoku matrices. Introduced by Geir Dahl concept disjoint pairs of S-permutation matrices [G. Dahl, Permutation matrices related to Sudoku, Linear Algebra and its Applications (430) (2009) 2457–2463] is used in this algorithm. Analyzing the works of G. Dahl and R. Fontana, the question of finding a general formula for counting disjoint pairs of n²×n²$n^2\times n^2$ S-permutation matrices as a function of the integer n$n$ naturally arises. This is an interesting combinatorial problem that deserves its consideration. The present work solves this problem. To do that, the graph theory techniques have been used. It has been shown that to count the number of disjoint pairs of n²×n²$n^2\times n^2$ S-permutation matrices, it is sufficient to obtain some numerical characteristics of the set of all bipartite graphs of the type g=〈_Rg∪_Cg,_Eg〉$g=〈R_g\cup C_g,E_g〉$, where V=_Rg∪_Cg$V=R_g\cup C_g$ is the set of vertices, and _Eg$E_g$ is the set of edges of the graph g$g$, _Rg∩_Cg=0?$R_g\cap C_g=0?$, |_Rg|=|_Cg|=n$\left|R_g\right|=\left|C_g\right|=n$.     

Commuting graphs of groups and related numerical parameters

Given a finite group G, we denote by Δ(G) the commuting graph of G which is defined as follows: the vertex set is G and two distinct vertices x and y are joined by an edge if and only if xy = yx. Clearly, Δ(G) is always connected for any group G. We denote by κ(G) the number of spanning trees of Δ(G). In the present paper, among other results, we first obtain the value κ(G) for some specific groups G, such as Frobenius groups, Dihedral groups, AC-groups, etc. Next, we characterize the alternating group A₅, in the class of nonsolvable groups through its tree-number κ(A₅). Finally, we classify the finite groups for which the power graph and the commuting graph coincide.     

Combinatorial structures and Lie algebras of upper triangular matrices

This work shows how to associate the Lie algebra h_n, of upper triangular matrices, with a specific combinatorial structure of dimension 2, for n∈N. The properties of this structure are analyzed and characterized. Additionally, the results obtained here are applied to obtain faithful representations of solvable Lie algebras.     

Universal similarity factorization equalities for commutative quaternions and their matrices

In this work, we have established universal similarity factorization equalities over the commutative quaternions and their matrices. Based on these equalities, real matrix representations of commutative quaternions and their matrices have been derived, and their algebraic properties and fundamental equations have been determined. Moreover, illustrative examples are provided to support our results.     

Generalized equivalence of pairs of matrices

Pairs (A₁B₁) and (A₂B₂) of matrices over a principal ideal domain R are called the generalized equivalent pairs if A₂=UA₁V₁B₂=UB₁V₂ for some invertible matrices UV₁V₂ over R. A special form is established to which a pair of matrices can be reduced by means of generalized equivalent transformations. Besides necessary and sufficient conditions are found, under which a pair of matrices is generalized equivalent to a pair of diagonal matrices. Applications are made to study the divisibility of matrices and multiplicative property of the Smith normal form.     

Generalized equivalence of pairs of matrices

Pairs (A ₁ B ₁) and (A ₂ B ₂) of matrices over a principal ideal domain R are called the generalized equivalent pairs if A ₂=UA ₁ V ₁ B ₂=UB ₁ V ₂ for some invertible matrices U V ₁ V ₂ over R. A special form is established to which a pair of matrices can be reduced by means of generalized equivalent transformations. Besides necessary and sufficient conditions are found, under which a pair of matrices is generalized equivalent to a pair of diagonal matrices. Applications are made to study the divisibility of matrices and multiplicative property of the Smith normal form.     

All Reg-solid varieties of commutative semigroups

We determine all regular solid varieties of commutative semigroups. Each of them is contained in the Reg-hyperequational class V _RC defined by the associative law and the commutative law, and every subvariety of V _RC is regular solid. In the present paper, the subvariety lattice of V _RC will be characterized.     

Sets of Commuting Derivations and Simplicity

A ring R is simple under a set D of derivations if no nontrivial ideal of R is preserved by all derivations in D. Continuing previous joint work with C. J. Maxson, the author provides a computational test for the simplicity of k[x ₁,…,x _n ]/〈 x ₁ ^p ,…, x _n ^p 〉 (k a field of characteristic p > 0) under a set of commuting k-derivations. Specific rings are then examined for sets of commuting derivations, especially those under which the ring is simple. The possible sizes and minimality of such sets are also determined in particular cases.     

可换对合阵组合的可逆性

先讨论两个可换对合阵P,Q线性组合aP+bQ可逆的充分必要条件及可逆时逆矩阵计算公式,再利用矩阵分解,以两种形式讨论两个可换对合阵P,Q组合aI+bP+cQ+dPQ及三个两两可换对合阵P,Q,R组合aI+bP+cQ+dPQ+eR+fPR+gQR+hPQR可逆的充分必要条件及可逆时分别给出逆矩阵计算公式.     

Perron-Frobenius operators and representations of the Cuntz-Krieger algebras for infinite matrices

In this paper we extend the work of Kawamura, see [K. Kawamura, The Perron-Frobenius operators, invariant measures and representations of the Cuntz-Krieger algebras, J. Math. Phys. 46 (2005)], for Cuntz-Krieger algebras OA for infinite matrices A. We generalize the definition of branching systems, prove their existence for any given matrix A and show how they induce some very concrete representations of OA. We use these representations to describe the Perron-Frobenius operator, associated to a nonsingular transformation, as an infinite sum and under some hypothesis we find a matrix representation for the operator. We finish the paper with a few examples.     

Finitely generated relatively universal varieties of Heyting algebras

Given distinct varieties and of the same type, we say that is relatively -universal if there exists an embedding :K from a universal categoryK such that for every pairA, B ofK-objects, a homomorphismf:A B has the formf=_g for someK-morphismg:A B if and only if Im(f) . Finitely generated relatively -universal varieties of Heyting algebras are described for the variety of Boolean algebras, the variety generated by a three element chain, and for the variety generated by the four element Boolean algebra with an added greatest element.Dedicated to the memory of Alan DayPresented by J. Sichler.The support of the NSERC is gratefully acknowledged.     

Inversion and canonization of block matrices

The paper is concerned with the problem of inverting block matrices to which the well-known Frobenius— Schur formulas are not applicable. These can be square matrices with four noninvertible square or rectangular blocks as well as square or rectangular matrices with two blocks. With regard to rectangular matrices, the results obtained are a further step in the development of the canonization method, which is used for solving arbitrary matrix equations.