算术函数的多元扩张及其应用

定义在正整数集合上的复值函数称为算术函数．本文讨论算术函数的两种多元扩张及其对GCD函数矩阵与LCM函数矩阵的应用．     

对角占优矩阵直积的注记

将对角占优矩阵的性质与矩阵的直积结合起来,给出了两矩阵的直积是对角占优矩阵的一些充分和必要条件,推广了近期的一些结果.最后用相应的数值例子说明了所得结果的有效性.     

关于随机矩阵Kronecker积的谱半径的不等式

研究了随机矩阵的Kronecker积的数学期望的性质,得到了随机矩阵的Kronecker积的谱半径的几个不等式.     

对角占优矩阵直积的一些性质

给出了对角占优矩阵直积的一些对角占优性质以及∞-范数估计式.     

布尔矩阵的指标格

本文首先构造了由一个布尔矩阵的特定行指标和列指标对所确定的指标格,然后刻画了指标格的同态像、直积和子格所对应的布尔矩阵的性质.     

有限个互素因子链上幂GCD矩阵与幂LCM矩阵的行列式的整除性

设S={x1,x2,...,xn}是由n个不同的正整数组成的集合,并设a为正整数.如果一个n阶矩阵的第i行j列元素是S中元素xi和xj的最大公因子的a次幂(xi,xj)a,则称该矩阵为定义在S上的a次幂最大公因子(GCD)矩阵,用(Sa)表示;类似定义a次幂LCM矩阵[Sa].如果存在{1,2,...,n}上的一个置换σ使得xσ(1)|xσ(2)|···|xσ(n),则称S为一个因子链.如果存在正整数k,使得S=S1∪S2∪···∪Sk,其中每一个Si(1ik)均为一个因子链,并且对所有的1i=jk,Si中的每个元素与Sj中的每个元素互素,则称S由有限个互素因子链构成.本文中,设S由有限个互素的因子链构成,并且1∈S.我们首先给出幂GCD矩阵与幂LCM矩阵的行列式的公式,然后证明:如果a|b,则det(Sa)|det(Sb),det[Sa]|det[Sb],det(Sa)|det[Sb].最后我们指出:如果构成S的有限个因子链不互素,则此结论一般不成立.     

交换加法幂等半环上的矩阵积和式

研究交换加法幂等半环上矩阵及其伴随矩阵,得到若干积和式的性质,给出了伴随矩阵积和式的两个等式。本文的有些结论推广了模糊矩阵,格矩阵,坡矩阵上的相应结论。     

奇异四元数矩阵的正态及Wishart分布

本文利用拉直算子(vec)和Kronecker积求得了四元数矩阵的实表示矩阵的一些性质,在此基础上利用实矩阵的奇异正态分布密度函数,求出了四元数矩阵的奇异正态分布的密度函数表达式.由此得到四元数矩阵奇异Wishart分布的密度函数表达式.     

分配伪格上矩阵积和式的不等式

在分配伪格上研究矩阵的积和式问题,得到关于矩阵积和式的若干不等式.其结果推广了已有文献上的结论.     

定义在广义Gcd—closed集S上的GGCD矩阵和GLCM矩阵的逆

设S＝｛x1,x2,…xn｝是一个由非零整数且|xi|≠|xj≠k.1≤i,j≤n)组合的集合,我们先定义了集S上的广义GCD（GGCD）矩阵和广义LCM（GLCM）矩阵,然后计算了定义在广义gcd-closed集上的GGCD矩阵和CLCM矩阵的逆矩阵。     

A topological approach to divisibility of arithmetical functions and GCD matrices

Considering lower closed sets as closed sets on a preposet (P, ≤), we obtain an Alexandroff topology on P. Then order preserving functions are continuous functions. In this article we investigate order preserving properties (and thus continuity properties) of integer-valued arithmetical functions under the usual divisibility relation of integers and power GCD matrices under the divisibility relation of integer matrices.     

Smith meets Smith: Smith normal form of Smith matrix

In 1861, Henry John Stephen Smith [H.J.S. Smith, On systems of linear indeterminate equations and congruences, Philos. Trans. Royal Soc. London. 151 (1861), pp. 293–326] published famous results concerning solving systems of linear equations. The research on Smith normal form and its applications started and continues. In 1876, Smith [H.J.S. Smith, On the value of a certain arithmetical determinant, Proc. London Math. Soc. 7 (1875/76), pp. 208–212] calculated the determinant of the n?×?n matrix ((i,?j)), having the greatest common divisor (GCD) of i and j as its ij entry. Since that, many results concerning the determinants and related topics of GCD matrices, LCM matrices, meet matrices and join matrices have been published in the literature. In this article these two important research branches developed by Smith, in 1861 and in 1876, meet for the first time. The main purpose of this article is to determine the Smith normal form of the Smith matrix ((i,?j)). We do this: we determine the Smith normal form of GCD matrices defined on factor closed sets.     

Some analogues of smith's determinant

We calculate the determinants of the greatest common divisor (GCD) and the least common multiple (LCM) matrices associated with an arithmetical function on gcd-closed and lcm-closed sets. We also consider some unitary analogues of these determinants.     

广义酉矩阵与广义Hermite矩阵的张量积与诱导矩阵

本文研究了有限个广义酉矩阵与广义(反)Hermite矩阵的张量积和诱导矩阵.利用矩阵的张量积和诱导矩阵的性质,得到了它的张量积和诱导矩阵仍为广义酉矩阵与广义(反)Hermite矩阵.     

On the finiteness property for rational matrices

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. It was conjectured a decade ago that all finite sets of real matrices have the finiteness property. This “finiteness conjecture” is now known to be false but no explicit counterexample is available and in particular it is unclear if a counterexample is possible whose matrices have rational or binary entries. In this paper, we prove that all finite sets of nonnegative rational matrices have the finiteness property if and only if pairs of binary matrices do and we state a similar result when negative entries are allowed. We also show that all pairs of 2×2 binary matrices have the finiteness property. These results have direct implications for the stability problem for sets of matrices. Stability is algorithmically decidable for sets of matrices that have the finiteness property and so it follows from our results that if all pairs of binary matrices have the finiteness property then stability is decidable for nonnegative rational matrices. This would be in sharp contrast with the fact that the related problem of boundedness is known to be undecidable for sets of nonnegative rational matrices.     

Polynomial numerical hulls of matrix polynomials,II

In this article, we study some algebraic and geometrical properties of polynomial numerical hulls of matrix polynomials and joint polynomial numerical hulls of a finite family of matrices (possibly the coefficients of a matrix polynomial). Also, we study polynomial numerical hulls of basic A-factor block circulant matrices. These are block companion matrices of particular simple monic matrix polynomials. By studying the polynomial numerical hulls of the Kronecker product of two matrices, we characterize the polynomial numerical hulls of unitary basic A-factor block circulant matrices.     

Dn中幂等元的一种关系

本研究了Dn中幂等元的某些性质。给出了幂等元的另一个等价刻划以及两幂等元之积仍是幂等元的一个充要条件。     

矩阵逆半群

讨论矩阵逆半群的一些基本性质, 证明矩阵逆半群的幂等元集是有限布尔格的子半格, 从而证明等秩矩阵逆半群是群, 然后完全确定二级矩阵逆半群的结构：一个二级矩阵逆半群或者同构于二级线性群,或者同构于二级线性群添加一个零元素,或者是交换线性群的有限半格, 或者满足其他一些性质; 对于由某些二级矩阵构成的集合, 我们给出了它们成为矩阵逆半群的充分必要条件.     

矩阵张量积与诱导矩阵的y-数值半径

从y-数值半径的定义出发,利用矩阵张量积与诱导矩阵的性质,研究了它们的y-数值半径,得到了矩阵张量积与诱导矩阵y-数值半径的几个不等式.