有限局部环上对称矩阵的计数定理(I)

设$A_{n}(R)$是有限局部环$Z/p^{k}Z$上$n$阶对称矩阵的集合, 这里$n\geq 2$. $p$是大于$2$素数, $p\equiv1({\rm mod}4)$ 且$k>1$. 通过确定有限局部环$Z/p^{k}Z$上对称矩阵的标准型, 计算出$A_{n}(R)$在线性群${\rm GL}_{n}(R)$作用下的轨道数, 从而计算出由特定对称矩阵确定的正交群的阶以及与特定对称矩阵在同一轨道的对称矩阵的阶.     

Factoring Matrices into the Product of Circulant and Diagonal Matrices

A generic matrix \(A\in \,\mathbb {C}^{n \times n}\) is shown to be the product of circulant and diagonal matrices with the number of factors being \(2n-1\) at most. The demonstration is constructive, relying on first factoring matrix subspaces equivalent to polynomials in a permutation matrix over diagonal matrices into linear factors. For the linear factors, the sum of two scaled permutations is factored into the product of a circulant matrix and two diagonal matrices. Extending the monomial group, both low degree and sparse polynomials in a permutation matrix over diagonal matrices, together with their permutation equivalences, constitute a fundamental sparse matrix structure. Matrix analysis gets largely done polynomially, in terms of permutations only.     

Products of Random Rectangular Matrices

We study the asymptotic behaviour of points under matrix cocyles generated by rectangular matrices. In particular we prove a random Perron‐Frobenius and a Multiplicative Ergodic Theorem. We also provide an example where such products of random rectangular matrices arise in the theory of random walks in random environments and where the Multiplicative Ergodic Theorem can be used to investigate recurrence problems.     

Canonical forms for mixed symmetric-skewsymmetric quaternion matrix pencils

Canonical forms are described for pairs of quaternionic matrices, or equivalently matrix pencils, where one matrix is symmetric and the other matrix is skewsymmetric, under strict equivalence and symmetry respecting congruence. The symmetry is understood in the sense of a fixed involutory antiautomorphism of the skew field of the real quaternions; the involutory antiautomorphism is assumed to be nonstandard, i.e., other than the quaternionic conjugation. Some applications are developed, such as canonical forms for quaternionic matrices under symmetry respecting congruence, and canonical forms for matrices that are skewsymmetric with respect to a nondegenerate symmetric or skewsymmetric quaternion valued inner product.     

Congruence and conjunctivity of matrices to their adjoints

Every square matrix over a field F is involutorily congruent over F to its transpose, and hence each such matrix is the product of a symmetric matrix and an involutory matrix over F. In the usual complex case every matrix which is conjunctive with its adjoint (=conjugate-transpose) is involutorily conjunctive with its adjoint and hence is the product of a hermitian matrix and an involutory matrix; furthermore every such matrix is conjunctive with a real matrix. These three conditions on a matrix, (1) being conjunctive with its adjoint, (2) being involutorily conjunctive with its adjoint, and (3) being conjunctive with a real matrix, are studied in the more general context of a field F with involution, and it is shown in general that (3) implies (2), that (2) implies (3) if char F≠2 (a 2×2 counterexample exists for each F with char F=2), and that (1) does not in general imply (2) (a 2×2 counterexample in the complexification of the rational field is presented). The problem of deciding which matrices satisfy (2) is equivalent (even in this general context) to the problem of deciding which pairs of self-adjoint (“hermitian”) matrices are involutorily conjunctive. For the general 2×2 case, the three conditions are characterized in terms of norms.     

論矩陣的一種變換

<正> 在本文中,數域限定為複數域.我們要來研究如下的變換:(1)(它將方陣A變成方陣B),式中P表示任意正則陣,P表示P的元素的共軛救構成的陣.所有的變换(1)顯然成羣.這種變換現在姑稱之為種變換.如果二方陣A與B可由一個種變換變此成彼,我們就說,A與B是對相似的.     

Products of involutory matrices. I

It is shown that, for every integer ≥1 and every field F, each n×n matrix over F of determinant ±1 is the product of four involutory matrices over F. Products of three ×n involutory matrices over F are characterized for the special cases where n≤4 or F has prime order ≤5. It is also shown for every field F that every matrix over F of determinant ±1 having no more than two nontrivial invariant factors is a product of three involutory matrices over F.     

Infinitely many low- and high-energy solutions for a class of elliptic equations with variable exponent

This paper is concerned with the $p(x)$-Laplacian equation of the form $$ \left\{\begin{array}{ll} -\Delta_{p(x)} u=Q(x)|u|^{r(x)-2}u, &\mbox{in}\ \Omega,\u=0, &\mbox{on}\ \partial \Omega, \end{array}\right. \eqno{0.1} $$ where $\Omega\subset\R^N$ is a smooth bounded domain, $1p^+$ and $Q: \overline{\Omega}\to\R$ is a nonnegative continuous function. We prove that (0.1) has infinitely many small solutions and infinitely many large solutions by using the Clark''s theorem and the symmetric mountain pass lemma.     

数量对合矩阵的线性组合的秩的不变性

若矩阵A、B满足A2=λ2I、B2=μ2I（λμ≠0）,称A、B都是数量对合矩阵．当非零复数a、b、u、v满足μλ＋bμ≠0、uλ＋vμ≠0时,我们证明了数量对合矩阵A、B与单位矩阵,的线性组合的秩总是相等,并且是一个与a、b、札、u选择都无关的常数．应用所得到数量对合矩阵的线性组合的秩的不变性,可推广已有文献的关于对合矩阵的相应结果．     

The Perturbation Analysis of the Product of Singular Vector Matrices $UV^T$

Let A be an $n\times n$ nonsingular real matrix, which has singular value decomposition $A=U\sum V^T$. Assume A is perturbed to $\tilde{A}$ and $\tilde{A}$ has singular value decomposition $\tilde{A}=\tilde{U}\tilde{\sum}\tilde{V}^T$. It is proved that $\|\tilde{U}\tilde{V}^T-UV^T\|_F\leq \frac{2}{\sigma_n}\|\tilde{A}-A\|_F$, where $\sigma_n$ is the minimum singular value of A; $\|\dot\|_F$ denotes the Frobenius norm and $n$ is the dimension of A. This inequality is applicable to the computational error estimation of orthogonalization of a matrix, especially in the strapdown inertial navigation system.     

A Class of Constrained Inverse Eigenproblem and Associated Approximation Problem for Symmetric Reflexive Matrices

Let S∈Rn×n be a symmetric and nontrival involution matrix. We say that A∈E R n×n is a symmetric reflexive matrix if AT = A and SAS = A. Let S R r n×n(S)={A|A= AT,A = SAS, A∈Rn×n}. This paper discusses the following two problems. The first one is as follows. Given Z∈Rn×m (m < n),∧= diag(λ1,...,λm)∈Rm×m, andα,β∈R withα<β. Find a subset (?)(Z,∧,α,β) of SRrn×n(S) such that AZ = Z∧holds for any A∈(?)(Z,∧,α,β) and the remaining eigenvaluesλm 1 ,...,λn of A are located in the interval [α,β], Moreover, for a given B∈Rn×n, the second problem is to find AB∈(?)(Z,∧,α,β) such that where ||.|| is the Frobenius norm. Using the properties of symmetric reflexive matrices, the two problems are essentially decomposed into the same kind of subproblems for two real symmetric matrices with smaller dimensions, and then the expressions of the general solution for the two problems are derived.     

Group inverse and group involutory Matrices

In this work we deal with group involutory matrices, i.e.A^#=A. We give necessary and sufficient conditions to characterize these matrices in terms of different representations of the group inverse. First, we give different expressions of the group inverse of a square matrix A. In addition, the special case of integer matrices is considered.     

REGULARITY ESTIMATES FOR THE OBLIQUE DERIVATIVE PROBLEM ON NON-SMOOTH DOMAINS （I）

ＲＥＧＵＬＡＲＩＴＹＥＳＴＩＭＡＴＥＳＦＯＲＴＨＥＯＢＬＩＱＵＥＤＥＲＩＶＡＴＩＶＥＰＲＯＢＬＥＭＯＮＮＯＮ－ＳＭＯＯＴＨＤＯＭＡＩＮＳ（Ｉ）￥ＧＵＡＮＰＥＮＧＦＥＩ；Ｅ．ＳＡＷＹＥＲＡｂｓｔｒａｃｔ：Ｔｈｅａｕｔｈｏｒｓｃｏｎｓｉｄｅｒｔｈｅｅｘｉ...     

Products of involutory matrices. I

It is shown that, for every integer ?1 and every field F, each n×n matrix over F of determinant ±1 is the product of four involutory matrices over F. Products of three ×n involutory matrices over F are characterized for the special cases where n?4 or F has prime order ?5. It is also shown for every field F that every matrix over F of determinant ±1 having no more than two nontrivial invariant factors is a product of three involutory matrices over F.     

On Minimum Saturated Matrices

Motivated both by the work of Anstee, Griggs, and Sali on forbidden submatrices and also by the extremal sat-function for graphs, we introduce sat-type problems for matrices. Let ${\mathcal{F}}$ be a family of k-row matrices. A matrix M is called ${\mathcal{F}}$ -admissible if M contains no submatrix ${F \in \mathcal{F}}$ (as a row and column permutation of F). A matrix M without repeated columns is ${\mathcal{F}}$ -saturated if M is ${\mathcal{F}}$ -admissible but the addition of any column not present in M violates this property. In this paper we consider the function sat( ${n, \mathcal{F}}$ ) which is the minimal number of columns of an ${\mathcal{F}}$ -saturated matrix with n rows. We establish the estimate sat ${(n, \mathcal{F})=O(n^{k-1})}$ for any family ${\mathcal{F}}$ of k-row matrices and also compute the sat-function for a few small forbidden matrices.     

Symmetric Weighing Matrices Constructed using Group Matrices

A weighing matrix of order n and weight m² is a square matrix M of order n with entries from {-1,0,+1} such that MM^T=m²I where I is the identity matrix of order n. If M is a group matrix constructed using a group of order n, M is called a group weighing matrix. Recently, group weighing matrices were studied intensively, especially when the groups are cyclic and abelian. In this paper, we study the abelian group weighing matrices that are symmetric, i.e.M^T=M. Some new examples are found. Also we obtain a few exponent bounds on abelian groups that admit symmetric group weighing matrices. In particular, we prove that there is no symmetric abelian group weighing matrices of order 2p^r and weight p² where p is a prime and p≥ 5.Communicated by: K.T. Arasu     

具最小二乘谱约束的结构矩阵逼近问题及其扰动分析

从两个方面讨论具有最小二乘谱约束的对称斜哈密尔顿矩阵的逼近问题:(Ⅰ)研究使AX-XA的Frobenius范数最小的n阶实对称斜哈密尔顿矩阵A的集合C,其中X,A分别是特征向量和特征值矩阵, (Ⅱ)求(A)∈c使得‖C-(A)‖=min ‖C-A‖,这里‖·‖是Frobenius范数.给出了C的元素的一般表达式和(A)的显示表达式,分析了该最佳逼近矩阵A的扰动理论,并给出了数值实验.     

Normal Matrices and an Extension of Malyshev's Formula

Let A be a complex matrix of order n with n ≥ 3. We associate with A the 3n × 3n matrix $Q\left( {\gamma } \right) = \left( \begin{gathered} A \gamma _1 I_n \gamma _3 I_n \\ 0 A \gamma _2 I_n \\ 0 0 A \\ \end{gathered} \right)$ where $\gamma _1 ,\gamma _2 ,\gamma _3 $ are scalar parameters and γ=(γ₁,γ₂,γ₃). Let σ_i, 1 ≤ i ≤ 3n, be the singular values of Q(γ) in the decreasing order. We prove that, for a normal matrix A, its 2-norm distance from the set $\mathcal{M}$ of matrices with a zero eigenvalue of multiplicity at least 3 is equal to $\mathop {max}\limits_{\gamma _1 ,\gamma _2 \geqslant 0,\gamma _3 \in \mathbb{C}} \sigma _{3n - 2} (Q\left( \gamma \right)).$ This fact is a refinement (for normal matrices) of Malyshev's formula for the 2-norm distance from an arbitrary n × n matrix A to the set of n × n matrices with a multiple zero eigenvalue.     

Strongly nonlinear multivalued elliptic equations on a bounded domain

In this work we study the existence of nontrivial solution for the following class of multivalued quasilinear problems $$\begin{aligned} \displaystyle -\text{ div } ( \phi (|\nabla u|) \nabla u) - b(u)u \in \lambda \partial F(x,u)\;\text{ in }\;\Omega , \quad u=0\; \text{ on }\;\partial \Omega \end{aligned}$$ where $\Omega \subset \mathbb{R }^N$ is a bounded domain, $N\ge 2$ and $\partial F(x,u)$ is a generalized gradient of $F(x,t)$ with respect to $t$ . The main tools utilized are Variational Methods for Locally Lipschitz Functional and a Concentration Compactness Theorem for Orlicz space.     

Some Berezin Number Inequalities for Operator Matrices

The Berezin symbol à of an operator A acting on the reproducing kernel Hilbert space H = H(Ω) over some (nonempty) set is defined by \(\tilde A(\lambda ) = \left\langle {A\hat k_\lambda ,\hat k_\lambda } \right\rangle \), λ ∈ Ω, where \(\hat k_\lambda = k_\lambda /\left\| {k_\lambda } \right\|\) is the normalized reproducing kernel of H. The Berezin number of the operator A is defined by \(ber(A) = \mathop {\sup }\limits_{\lambda \in \Omega } \left| {\tilde A(\lambda )} \right| = \mathop {\sup }\limits_{\lambda \in \Omega } \left| {\left\langle {A\hat k_\lambda ,\hat k_\lambda } \right\rangle } \right|\). Moreover, ber(A) ? w(A) (numerical radius). We present some Berezin number inequalities. Among other inequalities, it is shown that if \(T = \left[ {\begin{array}{*{20}c} A & B \\ C & D \\ \end{array} } \right] \in \mathbb{B}(\mathcal{H}(\Omega _1 ) \oplus \mathcal{H}(\Omega _2 ))\), then

$$ber(T) \leqslant \frac{1}{2}(ber(A) + ber(D)) + \frac{1}{2}\sqrt {(ber(A) - ber(D))^2 + \left( {\left\| B \right\| + \left\| C \right\|} \right)^2 } .$$