关于体上矩阵方程A_（mn）X_（ns）＝B_（ms）之解的注记

本文改进了文［１］的结果，利用体上矩阵的初等行和列变换，给出了任意体上的矩阵方程ＡｍｓＸａｓ＝Ｂｍｓ的一种更为实用的简便解法。     

关于f［ψ（X）］＝ψ（X）中映射f的存在性

关于ｆ［ψ（Ｘ）］＝ψ（Ｘ）中映射ｆ的存在性４３００１２武汉铁路成人中专章曙雯４３００７０武汉体育学院王晓芬文［１］过论了函数关系ｆ（ｓｉｎｘ）＝ｓｉｎｘ（ｎ∈Ｎ）中映射ｆ的存在性问题，指出ｎ为底数时ｆ不存在．类似的函数关系亦见于各种书刊．例如：设，...     

On the Moments of S_ny/(nφ(n))~(1/p) in p-type Space

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎ１９６７，Ｔｅｉｃｈｅｒｐｒｏｖｅｄｔｈａｔ［１］Ｅ（Ｓｕｐｎ｜Ｓｎ｜ｎＬ２ｎ）ｐ＜＋∞，　ｉｆｆＥＸ２ｌｏｇ＋｜Ｘ｜Ｌ２｜Ｘ｜＜＋∞，ｐ＝２Ｅ｜Ｘ｜ｐ＜＋∞，ｐ＞２　　　　．　Ｗｈｅｒｅ｛Ｘ，Ｘｎ，ｎ≥１｝ｉｓａｓｅｑｕｅｎｃｅｏｆｉ．ｉ．ｄｒｅａｌｒａｎｄｏｍｖａｒｉａｂｌｅｓｗｉｔｈｍｅａｎｓｚｅｒｏ．Ｉｎ１９９５，Ｔｈｅｓｉｍｉｌａｒｒｅｓｕｌｔｓｈａｖｅｂｅｅｎｓｅｔｕｐｆｏｒｉ．ｉ．ｄｒａｎｄｏｍｖａｒｉａｂｌｅｓ｛Ｘ，Ｘｎｎ≥１｝ｗｉｔｈｍｅａｎ…     

Angles of Norm ed Linear Spaces and Characterizations of Inner Product Spaces

§１．　Ｄｅｆｉｎｉｔｉｏｎｓ，ＬｅｍｍａｓａｎｄＴｈｅｏｒｅｍＤｅｆｉｎｉｔｉｏｎ１［１］　Ｌｅｔ（Ｘ，ｙ·ｙ）ｂｅａｒｅａｌｎｏｒｍｅｄｌｉｎｅａｒｓｐａｃｅｏｆｄｅｍｅｎｓｉｏｎｇｒｅａｔｅｒｔｈａｎ１，ｗｅｄｅｆｉｎｅａｎｇｌｅｓＡｍ，ｎ（ｘ，ｙ）ｂｅｔｗｅｅｎｎｏｎｚｅｒｏｖｅｃｔｏｒｓｘａｎｄｙｉｎＸｂｙＡｍ，ｎ（ｘ，ｙ）＝ｃｏｓ－１ｎｙｘｙｘｙ＋ｙｙｙｙｙ２－ｍｙｘｙｘｙ－ｙｙｙｙｙ２＋２（ｍ－ｎ）２（ｍ＋ｎ），ｈｅｒｅｍａｎｄｎａｒｅｔｗｏｎｏｎ－ｎｅｇｅｎｔｉｖｅｉｎｔｅ－ｇｅ…     

矩阵方程AXB=C的通解

本文给出了矩阵方程 Ａ_（ｍ×ｎ）Ｘ_（ｎ×５）Ｂ_（ｓ×）＝Ｃ_（ｍ×ｔ）有解且有无穷解的通解表达式 Ｘ＝Ｃ~（＊＊）＋［ｋ_（１１）ξ_１~Ｔ＋…＋ｋ_（１（ｎ－ｒ））ξ_（ｎ－ｒ）~Ｔ＋……ｋ_（ｓ１）ξ_１~Ｔ＋…＋ｋ_（ｓ（ｎ－ｒ））ξ_（ｎ－ｒ）~Ｔ］ ＋［Ｐ_（１１）η_１＋…＋Ｐ_（１（ｓ－１））η_（ｓ－１）……Ｐ_（ｎ１）η_１＋…Ｐ_（ｎ（ｓ－１））η_（ｓ－１）］~Ｔ（其中ｋ_（ｉｊ）;Ｐ_（ｉｊ）为任意常数;ξ_１…,ξ_（ｎ－ｒ）;η_１…,η_（ｓ－１）分别为Ａ_（ｍ×ｎ）Ｘ_（ｎ×１）＝０;Ｘ_（１×ｓ）Ｂ_（ｓ×ｔ）＝０的一个基础解系,Ｃ~（＊＊）为ＡＸＢ＝Ｃ的一个特解）及利用矩阵初等变换求其通解的方法．     

On[m,P_1~(a_1),P_2~(a_2),…,P_s~(a_s)]Index Type Groups

Ｏｎ［ｍ，Ｐ_１~（ａ_１）,Ｐ_２~（ａ_２）,…,Ｐ_ｓ~（ａ_ｓ）］ＩｎｄｅｘＴｙｐｅＧｒｏｕｐｓＬｉＸｉａｎｈｕａ（黎先华）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＧｕｉｚｈｏｕＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｇｕｉｙａｎｇ，５５０００１）Ａ...     

常返的随机徘徊的零集的维数

设｛Ｘｎ｝是Ｚ上的常返的随机徘徊，其均值为０，其分布属于指数为α（１＜α≤２）的稳定律吸引场．令Ａ（ω）＝｛ｎ：Ｘｎ（ω）＝０｝，则对ａ．ｓ．的ω，Ａ（ω）是一个按［５］中意义下的指数为的分形．     

方程f~（n）（x）＝Af~（n－k）（（ax＋b）／（cx－a））

本文提出方程ｆ~（ｎ）（ｘ）＝Ａｆ（ｎ－ｋ）（（ａｘ＋ｂ）／（ｃｘ－ａ）），证明它是可积的．所得结论是文献［１］中结论的推广．     

图Kn—E（k0P3（∪↑r↓i=1kiPqi—1））的色唯一性

记δｎ＝Σ↓ｋ≤ｎ（＾ｋｎ－ｋ），在本文中证明了：Ａ↓ｒ∈Ｎ，若Ａ↓∈Ｎ，若Ａ↓∈｛１，２，…，ｒ｝，ｑｉ（〉５）都是素数，并且［（δｑｉ－１－１）！＋１］／δｑｉ－１是正整数，则图簇Ｋｎ－Ｅ（ｋ０Ｐ３∪ｋ１Ｐｑ１－１∪…∪ｋｒＰｑｒ－１）是色唯一的，推广了文［１］的结果。     

ERDS-RE''''NYI大数律下自正则的效用

｛Ｘ，Ｘｉ，ｉ≥１｝是ｉ．ｉ．ｄ．ｒ．ｖ′．ｓ．在矩母函数存在的条件下，由古典的Ｅｒｄｏｓ－Ｒéｎｙｉ大数律有ｌｉｍｎ→∞ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ［ｃｌｏｇｎ］＝α（ｃ），α（ｃ）为某常数．自正则下ＭｉｋｌóｓＣｓｏｒｇｏ＆ＳｈａｏＱｉｍａｎ（１９９４）在仅要求一阶矩的条件下就得到了：ｌｉｍｎ→∞ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１（Ｘ２ｉ＋１）＝β（ｃ），β（ｃ）为某常数．众所周知，自正则下人们往往在较弱条件下取得相应结果是因为：分母中的Ｘ能有效抵销分子中Ｘ较大而引起整个分式极限行为的波动．因此，在什么样的条件下，式ｍａｘ０≤ｋ≤ｎ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘｉ∑ｋ＋［ｃｌｏｇｎ］ｉ＝ｋ＋１Ｘ２ｉ１－β［ｃｌｏｇｎ］β→ｒ（ｃ）成为非常有意思的问题，因为它将依赖于β的大小．本文给出，当０＜β≤１２时，只要Ｅ（Ｘ）≥０，上式就有有限极限．当１２＜β＜１时，则必须在矩母函数存在下，上式才有有限极限．并都求出了其极限表达式．     

一个来自振动理论反问题的矩阵方程

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＲｎ×ｍｄｅｎｏｔｅｔｈｅｒｅａｌｎ×ｍｍａｔｒｉｘｓｐａｃｅ ,Ｒｎ×ｍｒ ｉｔｓｓｕｂｓｅｔｗｈｏｓｅｅｌｅｍｅｎｔｓｈａｖｅｒａｎｋｒ ,ＯＲｎ×ｎｔｈｅｓｅｔｏｆａｌｌｎ×ｎｏｒｔｈｏｇｏｎａｌｍａｔｒｉｃｅｓ,ＳＲｎ×ｎ(ＳＲｎ×ｎ≥ ,ＳＲｎ×ｎ>)ｔｈｅｓｅｔｏｆａｌｌｎ×ｎｒｅａｌｓｙｍｍｅｔｒｉｃ (ｓｙｍｍｅｔｒｉｃｐｏｓｉｔｉｖｅｓｅｍｉｄｅｆｉｎｉｔｅ ,ｐｏｓｉｔｉｖｅｄｅｆｉｎｉｔｅ)ｍａｔｒｉｃｅｓ.ＴｈｅｎｏｔａｔｉｏｎＡ>0 (≥ 0 ,<0 ,≤ 0 )ｍ…     

矩阵环F[A]中元素的可逆性

研究了矩阵环F[A]中元素可逆的条件,讨论了矩阵环F[A]上的矩阵的初等变换与初等矩阵的性质,给出了求F[A]中可逆元的逆元的一个简便方法.     

四元数矩阵方程(AXB,CXD)=(E,F)的最小范数最小二乘Hermitian解

提出了研究四元数矩阵方程(AXB, CXD)=(E, F)的最小范数最小二乘Hermitian解的一个有效方法.首先应用四元数矩阵的实表示矩阵以及实表示矩阵的特殊结构,把四元数矩阵方程转化为相应的实矩阵方程,然后求出四元数矩阵方程(AXB, CXD)=(E, F)的最小二乘Hermitian解集,进而得到其最小范数最小二乘Hermitian解.所得到的结果只涉及实矩阵,相应的算法只涉及实运算,因此非常有效.最后的两个数值例子也说明了这一点.     

分块矩阵[A B]中一块的广义逆

给出矩阵[A B]的广义逆,其中A∈Cm×k,B∈Cm×(n-k),本文得到子块A的相关广义逆的计算公式.     

A system of equations for describing cocyclic Hadamard matrices

Given a basis for 2‐cocycles over a group G of order , we describe a nonlinear system of 4t‐1 equations and k indeterminates over , whose solutions determine the whole set of cocyclic Hadamard matrices over G, in the sense that ( ) is a solution of the system if and only if the 2‐cocycle gives rise to a cocyclic Hadamard matrix . Furthermore, the study of any isolated equation of the system provides upper and lower bounds on the number of coboundary generators in which have to be combined to form a cocyclic Hadamard matrix coming from a special class of cocycles. We include some results on the families of groups and . A deeper study of the system provides some more nice properties. For instance, in the case of dihedral groups , we have found that it suffices to check t instead of the 4t rows of , to decide the Hadamard character of the matrix (for a special class of cocycles f). © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 276–290, 2008     

矩阵方程X+A*X-nA=I的正定解

In this paper we give some sufficient conditions and some necessary conditions under which the matrix equation X A^*X^-nA=I has a positive definite solution. An iterative method which converges to a positive definite solution of this equation is constructed. And an error estimate formula on this iterative method is also derived.     

On a Solution of the Quaternion Matrix Equation X - A X B = C and Its Application

This paper first studies the solution of a complex matrix equation X - AXB = C, obtains an explicit solution of the equation by means of characteristic polynomial, and then studies the quaternion matrix equation X - A X B = C, characterizes the existence of a solution to the matrix equation, and derives closed-form solutions of the matrix equation in explicit forms by means of real representations of quaternion matrices. This paper also gives an application to the complex matrix equation X - AXB =C.     

The Versatility of MMAP[K] and the MMAP[K]/G[K]/1 Queue

This paper studies a single server queueing system with multiple types of customers. The first part of the paper discusses some modeling issues associated with the Markov arrival processes with marked arrivals (MMAP[K], where K is an integer representing the number of types of customers). The usefulness of MMAP[K] in modeling point processes is shown by a number of interesting examples. The second part of the paper studies a single server queueing system with an MMAP[K] as its input process. The busy period, virtual waiting time, and actual waiting times are studied. The focus is on the actual waiting times of individual types of customers. Explicit formulas are obtained for the Laplace–Stieltjes transforms of these actual waiting times.