偶特征有限域上对称矩阵结合方案

设S(n,q)是偶特征有限域F_q上n×n对称矩阵所成的集合.令R_i={(X,Y)|X,Y∈S(n,q),rank(Y-X)=2i-1,2i},0≤i≤[(n+1)/2]采用矩阵方法,证明了Sym(n,q)={s(n,q),{R_i}_(0≤i≤)[(n+1)/2]}是[(n+1)/2]个结合类的P—多项式对称结合方案,而Sym(n,q)的结合关系的图Γ~((1))是正则的,并且它同构于交错矩阵结合方案.此外,又给出Sym(n,q)的自同构形式.     

q_k-树的色性

一、引言本文考虑的图都是有限、无向的简单图.设 V(G)为图 G 的点集,E(G)为图 G 的边集.对任意的正整数 q,称为 q-树的图是归纳定义的,最小的 q-树是完全图 k_q,一个n+1阶的 q-树(n≥q)是在任一个 n 阶的 q-树上添上一个新点,并且添上 q 条邻接这个点与 n 阶 q-树上任意选取 q 个两两相邻的点的边而获得.记 P(G,λ)为图 G 的色多项式     

Gaussian fluctuations of eigenvalues in log-gas ensemble: Bulk case I

We study the central limit theorem of the k-th eigenvalue of a random matrix in the log-gas ensemble with an external potential V = q2mx2 m. More precisely, let Pn(d H) = Cne-nTrV(H)dH be the distribution of n × n Hermitian random matrices, ρV(x)dx the equilibrium measure, where Cnis a normalization constant, V(x) = q2mx2m with q2m=Γ(m)Γ(12)/Γ(2m+1/2), and m ≥ 1. Let x1 ≤···≤ xnbe the eigenvalues of H. Let k := k(n) be such that k(n)/n∈ [a, 1- a] for n large enough, where a ∈(0,12).Define G(s) :=∫s-1ρV(x)dx,- 1 ≤ s ≤ 1,and set t := G-1(k/n). We prove that, as n →∞,xk- t log n1/2 2π21/2nρV(t)→ N(0, 1)in distribution. Multi-dimensional central limit theorem is also proved. Our results can be viewed as natural extensions of the bulk central limit theorems for GUE ensemble established by J. Gustavsson in 2005.     

广义树映射的吸引中心和ω-极限集空间

设D是广义树(即具有有限个分支点的树突(dendrite)),f是D上的连续自映射.用P(f)、R(f)、SA(f)、Γ(f)、UΓ(f)、ω(x,f)和?(f)分别表示f的周期点集、回归点集、特殊α-极限点集、γ-极限点集、单侧γ-极限点集、x的ω-极限集和非游荡集.对任意A?D,记ω(A)=∪_(x∈A)ω(x,f).对任意的自然数n≥2,记ω~n(f)=ω(ω~(n-1)(f)),其中ω(f)=∪_(x∈D)ω(x,f).本文证明:对任意的正整数n,有ω~(n+2)(f)=ω~2(f)=ω(?(f))=ω(SA(f))=ω(Γ(f))=ω(P(f)∪(∪_(n=0)~∞f~n(UΓ(f))))=ω(P(f))=ω(R(f)∪UΓ(f))=P(f)∪(∪_(n=0)~∞f~n(UΓ(f)))?P(f).此外,本文还构造了一个只有一个分支点的广义树D和D上的一个连续自映射f,使得{ω(x,f):x∈D}在Hausdorff度量下不是闭的.     

Z_n[i]的平方映射图（英文）

本文研究了模n高斯整数环Z_n[i]的平方映射图Γ(n).利用数论、图论与群论等方法,获得了Γ(n)中顶点0及1的入度,并研究了Γ(n)的零因子子图的半正则性.同时,获得了Γ(n)中顶点的高度公式.推广了Somer等人给出的模n剩余类环平方映射图的相关结论.     

关于q-树二次整子图和n阶加点q-树色多项式的注记

在这篇文章中我们成功地仅用色多项式表征了最小度不等于q-3的q-树的二次整子图和n阶加点q-树,即当图的最小度δ(G)≠q-3时,n阶图G具有色多项式P(G;λ)=λ(λ-1)…(λ-q+2)(λ-q+1)~3(λ-q)~(n-q-2), n≥q+2,当且仅当G是n阶q-树的二次整子图或n阶加点q-树.     

ARMA序列协方差阵求逆和参数估计

§1.引言 如何求ARMA(p,q)序列的N个样本的协方差阵Γ_N的逆,已有不少人研究过。这个问题不但有理论上的重要意义,而且可应用于参数估计中。对于(p,0),(0,1)阶序列,较早就已得到结果,但对一般的(p,q)阶序列,近年来才有进展。在一维情形,[2]将Γ_N的求逆化为p+q阶阵求逆和一些递推算法;[1]进一步把求逆的阶数从p+q降低为r=max{p,q}。也就是说,虽然对一般的(p,q)阶序列,Γ_N~(-1)诸元不能象(p,0),     

三路树P(m,n,t)是边幻图的证明(Ⅱ)

令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V ∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图.     

三路树P(m,n,t)是边幻图的证明(II)

令简单图G=(V,E)是有p个顶点q条边的图.假设G的顶点和边由1,2,…,p+q所标号,且f:V∪E→{1,2,…,p+q}是一个双射,如果对所有的边xy,f(x)+f(y)+f(xy)是常量,则称图G是边幻图(edge-magic).本文证明了三路树P(m,n,t)当n为偶数,t=n+2时也是边幻图.     

SL(3,p~n)的Cartan不变量

K表示特征数p>0的代数闭域。G是K上单连通半单代数群。Γ_n=G(FP~n)是P~n个元素的有限域上型G的有限Chevalley群,它在K上的群代数是KΓ_n.Λ_n表示不同构的不可约KΓ_n-模M_(λ,n)的指标集,也是不同构的主不可分解KΓ_n-模R_(λ,n)的指标集,它可以看作G的权格X中“限制”优势权的集合X_(p~n)。因此|Λ_n|=p~(R·rankG.Γ_n的Cartan不变量C_(λ,μ(λ,μ∈Λ_n)等于M_(μ,n)作为R_(λ,n)的合成因子出现的重数,形成|Λ_n|阶对称矩阵。     

Groups with Prescribed Systems of Schmidt Subgroups

Siberian Mathematical Journal - A Schmidt (p, q)-group is a Schmidt group G with π(G) = {p, q} and normal Sylow p-subgroup. The N-critical graph ΓNc(G) of a group G is the directed graph...     

偶错位图的张量幂的最大独立集和自同构群

若A_n 是X := {1, 2,..., n} 上的偶置换构成的交错群, E_n 是X 上的偶错位集, 则Cayley 图AΓ_n := Γ(A_n, E_n) 称为偶错位图. 令AΓ_n^q 为q 个AΓ_n 的张量幂. 在本文中, 我们研究了AΓ_n^q 的连通性、直径、独立数、团数、色数和最大独立集等性质. 利用AΓ_n^q 最大独立集的结果, 我们完全确定了AΓ_n^q 的自同构群的结构.     

The Zero-Divisor Graphs Which Are Uniquely Determined By Neighborhoods

A nonempty simple connected graph G is called a uniquely determined graph, if distinct vertices of G have distinct neighborhoods. We prove that if R is a commutative ring, then Γ(R) is uniquely determined if and only if either R is a Boolean ring or T(R) is a local ring with x² = 0 for any x ∈ Z(R), where T(R) is the total quotient ring of R. We determine all the corresponding rings with characteristic p for any finite complete graph, and in particular, give all the corresponding rings of K_n if n + 1 = p^q for some primes p, q. Finally, we show that a graph G with more than two vertices has a unique corresponding zero-divisor semigroup if G is a zero-divisor graph of some Boolean ring.     

给定顶点数和边数的连通图的Q-谱半径的界

图的无符号拉普拉斯矩阵是图的邻接矩阵和度对角矩阵的和,其特征值记为q1≥q2≥…≥qn.设C(n,m)是由n个顶点m条边的连通图构成的集合,这里1≤n-1≤m≤(n2).如果对于任意的G∈C(n,m)都有q1(G*)≥q1(G)成立,图G*∈C(n,m)叫做最大图.这篇文章证明了对任意给定的正整数a=m-n+1,如果n...     

Darstellungen von SL(2,ℤ/pλℤ) und Thetafunktionen. II

If the modular group Γ=SL(2,?) operates in the usual way on complex vector spaces generated by suitably chosen theta constants of level q (i.e. modular forms for the congruence subgroup Γ(q) of Γ), then this operation defines a representation of the group SL(2,?/q?). Using this method, we construct all Weil representations of these groups for any prime-power q. It is shown how they depend on the underlying quadratic form of the theta constants and how theta relations can be used to find invariant subspaces.     

图K_(m,n)∪K_(p,q)的k优美性

路线等在[3]中证明了当k>1,且min{p,q}≥2时,图St(m)∪Kp,q是k优美图.本文论证了当min{m,n,p,q}≥2时,图Km,n∪Kp,q是k优美图.     

Kp,q-factorization of complete bipartite graphs

Let K_(m,n) be a complete bipartite graph with two partite sets having m and nvertices, respectively. A K_(p,q)-factorization of K_(m,n) is a set of edge-disjoint K_(p,q)-factorsof K_(m,n) which partition the set of edges of K_(m,n). When p=i and q is a prime number,Wang, in his paper "On K_(1,k)-factorizations of a complete bipartite graph" (Discrete Math,1994, 126; 359-364), investigated the K_(1,q)-factorization of K_(m,n) and gave a sufficientcondition for such a factorization to exist. In the paper "K_(1,k)-factorizations of completebipartite graphs" (Discrete Math, 2002, 259: 301-306), Du and Wang extended Wang'sresult to the case that q is any positive integer In this paper, we give a sufficient conditionfor K_(m,n) to have a K_(p,q)-factorization. As a special case, it is shown that the Martin's BACconjecture is true when p: q=k: (k+1) for any positive integer k.     

几类多圈图的拉普拉斯谱刻画

设图G是一个简单连通图. 如果任何一个与图G同拉普拉斯谱的图都与图G同构,则称图G是由其拉普拉斯谱确定的. 定义了双圈图\theta_{n}(p_1,p_2,\cdots,p_t) 和m 圈图H_n(m\cdot C_3;p_1,p_2,\cdots,p_t). 证明了双圈图\theta_{n}(p)和\theta_{n}(p,q),三圈图H_n(3\cdot C_3;p)和H_n(3\cdot C_3;p,q)分别是由它们的拉普拉斯谱确定的.     

Mean distance in a graph

The average or mean of the distances between vertices in a connected graph Γ, μ(Γ), is a natural measure of the compactness of the graph. In this paper we compute bounds for μ(Γ) in terms of the number of vertices in Γ and the diameter of Γ. We prove a formula for computing μ(Γ) when Γ is a tree which is particularly useful when Γ has a high degree of symmetry. Finally, we present algorithms for μ(Γ) which are amenable to computer implementation.     

OD-CHARACTERIZATION OF ALMOST SIMPLE GROUPS RELATED TO U6（2）

Let G be a finite group and π(G) = { p 1 , p 2 , ··· , p k } be the set of the primes dividing the order of G. We define its prime graph Γ(G) as follows. The vertex set of this graph is π(G), and two distinct vertices p, q are joined by an edge if and only if pq ∈π e (G). In this case, we write p ～ q. For p ∈π(G), put deg(p) := |{ q ∈π(G) | p ～ q }| , which is called the degree of p. We also define D(G) := (deg(p 1 ), deg(p 2 ), ··· , deg(p k )), where p 1 < p 2 < ··· < p k , which is called the degree pattern of G. We say a group G is k-fold OD-characterizable if there exist exactly k non-isomorphic finite groups with the same order and degree pattern as G. Specially, a 1-fold OD-characterizable group is simply called an OD-characterizable group. Let L := U 6 (2). In this article, we classify all finite groups with the same order and degree pattern as an almost simple groups related to L. In fact, we prove that L and L.2 are OD-characterizable, L.3 is 3-fold OD-characterizable, and L.S 3 is 5-fold OD-characterizable.