关于6的奇个速算法

学习速算法的人都知道、乘以6的计算比乘以8、4、7、8的计算要容易，但我们还．可以让它更容易。     

“具有幂零局部子群的有限群”一文的注记

称有限群$G$为一个PN-群若 $G$非幂零群,且对$G$的每一个$p$-子群$P$, 或者$P$是$G$的正规子群, 或者$P \subseteq Z_\infty(G)$, 或者$N_G(P)$是幂零群, $\forall p \in \pi(G)$. 本文证明了PN-群是亚幂零群. 特别地, PN-群是可解的 且给出了PN-群结构定理的一个初等的、直观的、简洁的证明.     

关于巴拿赫格中的$l^\infty$渐进等距拷贝

本文证明了具有$\sigma$-序半连续但非$\sigma$-序连续范数的$\sigma$-完备巴拿赫格包含$l^\infty$的渐进等距拷贝.并且证明了具有Orlicz范数的Fenchel-Orlicz空间不一定含有$l^\infty$的渐进等距拷贝.     

关于算术图的一个猜想

本文证明了文[1]给出的环C_(4t+1)和C_(4t+3)是算术图的如下猜想. 猜想 (1)若C_(4t+1)是(k,d)算术图,则k=2dt+2r;(2)若C_(4t+3)是(k,d)算术图,则k=(2t+1)d+2r,其中r是非负整数. 证明只证(1),证明(2)的方法与(1)类似.不妨设C_(4t+1)=(u_0,u_1,…,u_(4t),u_0)的顶点标     

The Semisimplicity of L^1 （K,w） of a Weighted Commutative Hypergroup K

In the present paper, it is shown that, for a locally compact commutative hypergroup K with a Borel measurable weight function w, the Banach algebra L^1 （K, w） is semisimple if and only if L^1 （K） is semisimple. Indeed, we have improved compact groups to the general setting of locally a well-krown result of Bhatt and Dedania from locally compact hypergroups.     

On s-quasinormal and c-normal subgroups of a finite group

Let F be a saturated formation containing the class of supersolvable groups and let G be a finite group. The following theorems are shown： （1） G ∈ F if and only if there is a normal subgroup H such that G/H ∈ F and every maximal subgroup of all Sylow subgroups of H is either c-normal or s-quasinormally embedded in G; （2） G ∈F if and only if there is a soluble normal subgroup H such that G/H∈F and every maximal subgroup of all Sylow subgroups of F（H）, the Fitting subgroup of H, is either e-normally or s-quasinormally embedded in G.     

On shape-preserving properties and simultaneous approximation of Stancu operator

In the present paper,the shape-preserving properties and the monotonicity for convex functions of Stancu operator are given.Moreover,the simultaneous approximation problems of this operator are also considered.     

The commutant of analytic Toeplitz operators on Bergman space

In this paper, using the matrix skills and operator theory techniques we characterize the commutant of analytic Toeplitz operators on Bergman space. For f（z） = z^ng（z） （n ≥1）, g（z） = b0 ＋ b1z^p1 ＋b2z^p2 ＋.. , bk ≠ 0 （k = 0, 1, 2,...）, our main result is =A′（Mf） = A′（Mzn）∩A′（Mg） = A′（Mz^s）, where s = g.c.d.（n,p1,p2,...）. In the last section, we study the relation between strongly irreducible curve and the winding number W（f,f（α））, α ∈ D.     

几类有趣图的奇优美性和奇强协调性

对于简单图G=〈V,E〉,如果存在一个映射f:V(G)→{0,1,2,…,2|E|-1}满足:1)对任意的u,v∈V,若u≠v,则f(u)≠f(v);2)max{f(v)|v∈V}=2|E|-1;3)对任意的e_1,e_2∈E,若e_1≠e_2,则g(e_1)≠g(e_2),此处g(e)=|f(u)+f(v)|,e=uv;4)|g(e)|e∈E}={1,3,5,…,2|E|-1},则称G为奇优美图,f称为G的奇优美标号.设G=〈V,E〉是一个无向简单图.如果存在一个映射f:V(G)→{0,1,2,…,2|E|-1},满足:1)f是单射;2)■uv∈E(G),令f(uv)=f(u)+f(v),有{f(uv)|uv∈E(G)}={1,3,5,…,2|E|-1},则称G是奇强协调图,f称为G的.奇强协调标号或奇强协调值.给出了链图、升降梯等几类有趣图的奇优美标号和奇强协调标号.     

强算术图

一个（p,q)-图G被为是强（k,d)-算术图,如果存在一个由G的顶点集到模q的整数群Zq的单射,使得相邻两顶点标号的和导出的边值为算术级数,k,k d,……,k (q-1)d,本文讨论了这类标号图的结构和一些性质。     

算术图的若干性质

本文得到了算术图的一些新性质，并解决了文[1]提出的两个猜想.     

完全有向图的奇长圈覆盖

设DK_v表示完全有向对称图,C（v,m）表示覆盖DK_v的m长有向圈的最小圈数（称为覆盖数）.对任意正整数m和v,当m≤v≤m+6时,覆盖数C（v,m） 被确定.     

On Subgraphs in Distance-Regular Graphs

Terwilliger [15] has given the diameter bound d (s – 1)(k – 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hypercube are the even polygons, the hypercubes and the doubled Odd graphs and proves this in the case of girth 4. We show that the only distance-regular subgraphs of a hypercube with girth 6 are the doubled Odd graphs. If the girth is equal to 8, then its valency is at most 12.     

On Compatible Normal Odd Partitions in Cubic Graphs

A normal odd partition of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail. For each vertex v, we can distinguish the edge for which this vertex is pending. Three normal odd partitions are compatible whenever these distinguished edges are distinct for each vertex. We examine this notion and show that a cubic 3‐edge‐colorable graph can always be provided with three compatible normal odd partitions. The Petersen graph has this property and we can construct other cubic graphs with chromatic index four with the same property. Finally, we propose a new conjecture which, if true, would imply the well‐known Fan and Raspaud Conjecture.     

任意n个完备二分图的并图的k－优美性和算术性

证明了对于正整数k,n,si,ti（si,ti≥2,i=1,2,…,n）,图n/U/i=1,Ksi,ti是k-优美图;对于正整数k,d（d≥2）,k≠0（roodd）及n,si,ti（si,ti≥2,i=1,2,…,n）,图n/U/i=1,Ksi,ti是（k,d）-算术图,前一结论推广了文[6]的相应结果。     

算术图一个猜想的证明

Ａｃｈａｒｙａ和Ｈｅｄｇｅ提出猜想：(i)若圈Ｃ_4t＋１( t≥1, t∈N) 是(k, d )－算术图，则Ｋ＝２ｄｔ+ 2r ( r≥0, r∈N ) ; ( ii) 若圈C_4t＋3是(k, d )-算术图, 则k= (2t+ 1) d + 2r ( r≥0, r∈N ). 本文证明了上述猜想为真.     

完全图中的正常染色的路和圈

令$K_{n}^{c}$表示$n$ 个顶点的边染色完全图.
令 $\Delta^{mon}
(K_{n}^{c})$表示$K^c_{n}$的顶点上关联的同种颜色的边的最大数目.
如果$K_{n}^{c}$中的一个圈（路）上相邻的边染不同颜色,则称它为正常染色的.
B. Bollob\'{a}s和P. Erd\"{o}s (1976) 提出了如下猜想：若 $\Delta^{{mon}}
(K_{n}^{c})<\lfloor \frac{n}{2} \rfloor$, 则$K_{n}^{c}$中含有一个正常染
色的Hamilton圈. 这个猜想至今还未被证明.我们研究了上述条件下的正常染色的路和圈.