秩减形式的一种新方法（英文）

Let A be an m by n matrix of rank l, and let M and N be m by k and n by q matrices, respectively, where k is not necessarily equal to q or rank(M AN) min(k, q). In this paper, we provide some necessary and sufficient conditions for the validity of the rank subtractivity formula: rank(A-AN(M AN)-M A) = rank(A)-rank(AN(M AN)-M A)by applying the full rank decomposition of A = F G(F ∈ Rm×l, G ∈ Rl×n, rank(A) =rank(F) = rank(G) = l) and the product singular value decomposition of the matrix pair[F M, GN ]. This rank subtractivity formula along with the condition under which it holds is called the extended Wedderburn-Guttman theorem.     

On the p—Local Rank of Finite Groups

In this paper,we shall mainly study the p-solvable finite group in terms of p-local rank,and a group theoretic characterization will be given of finite p-solvabel groups with p-local rank two.Theorem A Let G be a finite p-solvable group with p-local rank plr(G)=2 and Op(G)=1.If P is a Sylow p-subgrounp of G,then P has a normal subgroup Q such that P/Q is cyclic or a generalized quaternion 2-group and the p-rank of Q is at most two.Theorem B Let G be a finite p-solvable group with Op(G)=1.Then the p-length lp(G)≤plr(G);if in addition plr(G)=lp (G) and p≥5 is odd,then plr(G)=0 or 1.     

用$\tau_e(L_2(16))$刻画$L_2(16)$

Let G be a group and πe(G) the set of element orders of G.Let k∈πe(G) and m k be the number of elements of order k in G.Letτe(G)={mk|k∈πe(G)}.In this paper,we prove that L2(16) is recognizable byτe (L2(16)).In other words,we prove that if G is a group such that τe(G)=τe(L2(16))={1,255,272,544,1088,1920},then G is isomorphic to L2(16).     

Standardness and Standard Automorphisms of Chevalley Groups, I: the Case of Rank at Least Two

The author studies the linkage between the standardness and the standard automorphisms of Chevalley groups over rings.It is proved that if H is any standard subgroup of G(R),then each of its automorphisms can be extended to an automorphism of G(R,I),restricted to an automorphism of E(R,I),and an automorphism of E(R,I) can be extended to one of G(R,I).The case of Chevalley groups of rank at least two is treated in this paper.Further results about the case of Chevalley groups of rank one,the case of non-commutative ground ring and some others exceptions will appear elsewhere.     

THE CONNECTIVITIES OF ADJACENT TREE GRAPHS

The connectivity and the circuit rank of a graph G are denoted by x(G) and ρ,respectively.It isshown that if H is the adjacent tree graph of a simple connected graph G,then x(H)=2ρ.     

$m$个$C_{3}$的并和$m$个$C_{4}$的并的点可区别 $E$-全染色

Let G be a simple graph. A total coloring f of G is called E-total-coloring if no two adjacent vertices of G receive the same color and no edge of G receives the same color as one of its endpoints. For E-total-coloring f of a graph G and any vertex u of G, let Cf （u） or C（u） denote the set of colors of vertex u and the edges incident to u. We call C（u） the color set of u. If C（u） ≠ C（v） for any two different vertices u and v of V（G）, then we say that f is a vertex-distinguishing E-total-coloring of G, or a VDET coloring of G for short. The minimum number of colors required for a VDET colorings of G is denoted by X^evt（G）, and it is called the VDET chromatic number of G. In this article, we will discuss vertex-distinguishing E-total colorings of the graphs mC3 and mC4.     

Crossed products by finite group actions with certain tracial Rokhlin property

We introduce a special tracial Rokhlin property for unital C~*-algebras. Let A be a unital tracial rank zero C~*-algebra(or tracial rank no more than one C~*-algebra). Suppose that α : G → Aut(A) is an action of a finite group G on A, which has this special tracial Rokhlin property, and suppose that A is a α-simple C~*-algebra. Then, the crossed product C~*-algebra C~*(G, A, α) has tracia rank zero(or has tracial rank no more than one). In fact,we get a more general results.     

本刊英文版Vol.27(2011),No.9论文摘要(英文)

<正>Graphs Whose Critical Groups Have Larger Rank Yao Ping HOU Wai Chee SHIU Wai Hong CHAN Abstract The critical group C(G) of a graph G is a refinement of the number of spanning trees of the graph and is closely connected with the Laplacian matrix.Let r(G) be the minimum number of generators(i.e.,the rank) of the group C(G) andβ(G) be the number of independent     

$K_v$的最大$K_2K_3$填充设计

Abstract Let Kv be the complete graph on v vertices, and G a finite simple undirected graph without isolated vertices. A G-packing of Kv, denoted by （v, G, 1）-packing, is a pair （X,A） where X is the vertex set of K＋ and ＋4 is a family of edge-disjoint subgraphs isomorphic to G in Kv. In this paper, the maximum number of subgraphs in a （v, G, 1）-packing is determined when G is K2 x K3, the Cartesian product of K2 and K3, leaving two orders undetermined. This design originated from the use of DNA library screening.     

关于完全二部图$K_{4, n}$和$K_{n, n}$的点可区别 $IE$-全染色的一些注记

Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.     

ON GROUPS OF ODD ORDER AND RANK $\[ \le 2\]$

The least commonmultiple of dimensions of chief factors of a finite solvable group is called the rank of the group. The groups of odd order with trivial Fratttini subgroups all of whose subgroups but itself have ranks are completely determined (Theorem A). For an odd number a necessary and sufficient condition for the groups of order n all to be of rank $\[ \le 2\]$ is obtained (Theorem B).     

Non-Negative Integer Matrix Representations of a $\mathbb{Z}_{+}$-Ring

The $\mathbb{Z}_{+}$-ring is an important invariant in the theory of tensor category. In this paper, by using matrix method, we describe all irreducible $\mathbb{Z}_{+}$-modules over a $\mathbb{Z}_{+}$-ring $\mathcal{A}$, where $\mathcal{A}$ is a commutative ring with a $\mathbb{Z}_{+}$-basis{$1$, $x$, $y$, $xy$} and relations: $$ x^{2}=1,\;\;\;\;\; y^{2}=1+x+xy.$$We prove that when the rank of $\mathbb{Z}_{+}$-module $n\geq5$, there does not exist irreducible $\mathbb{Z}_{+}$-modules and when the rank $n\leq4$, there exists finite inequivalent irreducible $\mathbb{Z}_{+}$-modules, the number of which is respectively 1, 3, 3, 2 when the rank runs from 1 to 4.     

Fast Parallel Algorithms for Computing Generalized Inverses $A^+$ and $A_{MN}^+$

The parallel arithmetic complexities for computing generalized inverse $A^+$, computing the minimum-norm least-squares solution of $Ax=b$, computing order $m+n-r$ determinants and finding the characteristic polynomials of order $m+n-r$ matrices are shown to have the same grawth rate. Algorithms are given that compute $A^+$ and $A_{MN}^+$ in $O(\log r\dot \log n+\log m)$ and $O(\log^2n+\log m)$ steps using a number of processors which is a polynomial in $m, \ n$ and $r$ $(A\in B_r^{m\times n},r=rank \ A)$.     

ON THE CONSTRUCTION OF INDECOMPOSABLE POSITIVE DEFINITE QUADRATIC FORMS OVER Z

The aim of this paper is to construct indecomposable positive definite Z-lattices withgiven rank n(2≤n≤9) and discriminant a,a being composite and square-free,but for afinite number of exceptions.And all exceptional cases for 3≤n≤9 are determined.Theseare unsettled cases of a paper of O’Meara in 1975.     

THE TRIANGULAR MODEL OF SEMI-SIMPLE L~*-ALGEBRA OF H-S OPERATORS

In this paper,some properties of semi-simple L-algebras are considered.At first,applying Cartan decomposition,the author constructs a family of nilpotentsubalgebras in a semi-simple L-algebra and proves that whole algebra can be spanned bythese subalgebras,their conjugations and Cartan subalgebras.Then,the author proves that every nonzero root vector of semi-simple L-algebra ofH-S operators is a finite rank operator and presents the triangular model of the algebra.Finally,non-Voltera property of the algebra is shown.     

On $ p $ -Universal and $ p $ -Minimal Numberings

Siberian Mathematical Journal - We study the $ p $ -reducibility of numberings which was introduced and first studied by Degtev. $ p $ -Reducibility is an effectively bounded version of the $ e $...     

Nonlinear Mixed Jordan Triple $ * $ -Derivations on $ * $ -Algebras

Siberian Mathematical Journal - Let $ {\mathcal{A}} $ be a&nbsp;unital $ \ast $ -algebra containing a&nbsp;nontrivial projection. Under some mild conditions on&nbsp; $ {\mathcal{A}} $ ,...     

$ P $ -Stability of Some Classes of $ S $ -Acts

Siberian Mathematical Journal - The notion of $ P $ -stability is a particular case of the generalized stability of complete theories. This paper discusses some problems that are related to the $ P...     

A New Characterization of Finite $ \sigma $ -Soluble $ P\sigma T $ -Groups

Siberian Mathematical Journal - We prove that&nbsp; $ G $ is a finite $ \sigma $ -soluble group with transitive $ \sigma $ -permutability if and only if the following hold: (i) $ G $ possesses...     

Generalized Rickart $ \ast $ -Rings

Siberian Mathematical Journal - As a common generalization of Rickart $ \ast $ -rings and generalized Baer $ \ast $ -rings, we say that a&nbsp;ring&nbsp; $ R $ with an involution&nbsp;...