关于k-消去二分图的一些结果

图 G的一个 k-正则支撑子图称为 G的 k-因子 ,若对 G的任一边 e,图 G- e总存在一个 k-因子 ,则称 G是 k-消去图 .证明了二分图 G=( X,Y) ,且 | X | =| Y|是 k-消去图的充分必要条件是 k| S|≤ r1 + 2 r2 +…+ k( rk+… + rΔ) - ε( S)对所有 S X成立 .并由此给出二分图是 k-消去图的充分度条件 .     

2003年全国攻读硕士学位研究生入学考试数学试题(一)(附答案)

一、填空题 (本题共 6小题 ,每小题 4分 ,满分 2 4分 )( 1 )　 limx→ 0 ( cosx) 1ln( 1+ x2 )　　 =　 1e　。( 2 )　曲面 z=x2 +y2 与平面 2 x+4 y-z=0平行的切平面的方程是　 2 x+4 y-z=5　。( 3 )　设 x2 =∑∞n=0ancosnx( -π≤ x≤π) ,则 a2 =　 1　( 4)　从 R2 的基 α1=10 ,α2 =　 1-1 到基 β1=11 ,β2 =12 的过渡矩阵为 　 2　　　 3-1　　 -2 　。( 5)　设二维随机变量 ( X,Y)的概率密度为f ( x,y) =6x,　　 0≤ x≤ y≤ 1 ,0 ,　　　其他则 P{ X+Y≤ 1 } =　 14 　。( 6)　已知一批零件的长度 X(单位 :cm)服从正态分布 N(…     

Traces on an (AF)-Algebra

Let A= U A_n be an (AF)-algebra with identity e, where A_n = M(p(n)),p(n) = (p~(n)) ∈Z_(++)~(r(n)), A_n→A_(n+1), e∈A_n, n, τ(A) be the space of alltracial states on A,G(A) = lim (Z~(r(n)),φ_n) be the dimension group of A,φ_u(G) bethe state space of G(A), where u =φ_(n∞).(p(n)) is an ordered unit of G(A).     

再探半角余弦和的上界

近期在阅读贵刊 2 0 0 2年第 3期时 ,看到了安徽师范大学的郭老师给出的《半角的余弦和上界的加强》一文 ,觉得证明较繁 .实际上利用柯西不等式结合恒等式 cos A cos B cos C =1 rR证明较为简便 .现证如下 :cos A2 cos B2 cos C2　≤ 3(cos2 A2 cos2 B2 cos2 C2 )　 = 32 (3 cos A cos B cos C)　 = 32 (3 1 rR) =6 3r2 R.另外我还利用均值不等式得到了关于半角余弦和的两个上界的一个隔离 .cos A2 cos B2 cos C2 =23.(32 cos A2 32 cos B2 32 cos C2 )≤ 13(94 cos2 A2 cos2 B2 cos2 C2 )=33 (174 r2 R) ,∵　 …     

二部平衡公平划分的一个下界

设V_1,V_2是图G的一个二部划分.如果一1≤|V_1|-|V_2|≤1,则称V_1,V_2是G的一个二部平衡划分.对于n个顶点m条边的简单图G,本文证明了:(1)若G是k-正则图(k≥3),则G存在一个最小二部平衡划分V_1,V_2,使得max{e(V_1),e(V_2)}≥((k-1)m)/4k;(2)如果r是大于4的实数,且当n是偶数时△(G)≤((3r-4))/(r+4)δ(G)-(2r)/(r+4),当n是奇数时△(G)≤(3r-4)/(r+4)δ(G)-(8r)/(r+4),那么G存在一个二部平衡划分,使得min{e(V_1),e(V_2)}≥m/r,这里e(V_i)表示G中两个顶点都在V_i中的边的数目.     

THE CONVERGENCE OF APPROACH PENALTY FUNCTION METHOD FOR APPROXIMATE BILEVEL PROGRAMMING PROBLEM

' 1 IntroductionWe collsider the fOllowi11g bilevel programndng problen1:max f(x, y),(BP) s.t.x E X = {z E RnIAx = b,x 2 0}, (1)y e Y(x).whereY(x) = {argmaxdTyIDx Gy 5 g, y 2 0}, (2)and b E R", d, y E Rr, g E Rs, A, D.and G are m x n1 s x n aild 8 x r matrices respectively. If itis not very difficult to eva1uate f(and/or Vf) at all iteration points, there are many algorithmeavailable fOr solving problem (BP) (see [1,2,3etc1). However, in some problems (see [4]), f(x, y)is too com…     

C2(4,k) 中的强支撑可迹图

设2≤h≤3,l0,k≥0是整数,C_h(l,k)是由h-边连通简单图组成的集合,图G∈C_h(l,k)当且仅当对图G的任意一个二边割或三边割X,图G-X的每个分支都至少有︱V(G)-k︱/l个点.设e=u_1v_1和e'=u_2v_2是图G的两条边.若e≠e',G(e,e')是将图G中的边e=u_1v_1和e'=u_2v_2分别用路u_1v_ev_1和u_2v_e'v_2替换得到的图(其中,v_e,v_e'是不在V(G)中的两个新的点).若e=e',G(e,e')是将图G中的边e=u_1v_1用路u_1v_ev_1替换得到的图,也记作G(e).若对任意的e,e'∈E(G),G(e,e')都有支撑(v_e,v_e')迹,则称图G是强支撑可迹的.作者证明了,若图G∈C_2(4,k)且|V(G)|5k,则要么图G是强支撑可迹图,要么存在e,e'∈E(G),使得G(e,e')可以收缩成一个有限图类F中的图.当k=4时,F被完全确定了.     

A RECOGNITION OF SIMPLE GROUPS PSL（3, q） BY THEIR ELEMENT ORDERS

For any group G, denote byπe(G) the set of orders of elements in G. Given a finite group G, let h(πe (G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called k-recognizable if h(πe(G)) = k <∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3 < q≡±2 (mod 5) and (6, (q-1)/2) = 1, are recognizable.     

On the adjacent vertex-distinguishing equitable edge coloring of graphs

Let G(V, E) be a graph. A k-adjacent vertex-distinguishing equatable edge coloring of G, k-AVEEC for short, is a proper edge coloring f if (1) C(u)≠C(v) for uv ∈ E(G), where C(u) = {f(uv)|uv ∈ E}, and (2) for any i, j = 1, 2,… k, we have ||Ei| |Ej|| ≤ 1, where Ei = {e|e ∈ E(G) and f(e) = i}. χáve (G) = min{k| there exists a k-AVEEC of G} is called the adjacent vertex-distinguishing equitable edge chromatic number of G. In this paper, we obtain the χáve (G) of some special graphs and present a conjecture.     

从L~p(G,A)到L~p(G,X)的L~1(G,A)-模同态和不变算子(1

于树模 《数学年刊A辑(中文版)》1990,(6)

Bipartition of graph under degree constraints

Let G be a graph, let s be a positive integer, and let X be a subset of V(G). Denote δ(X) to be the minimum degree of the subgraph G[X] induced by X. A partition(X, Y) of V(G) is called s-good if min{δ(X), δ(Y)} s. In this paper, we strengthen a result of Maurer and a result of Arkin and Hassin, and prove that for any positive integer k with 2 k |V(G)|- 2, every connected graph G with δ(G) 2 admits a1-good partition(X, Y) such that |X| = k and |Y| = |V(G)|- k, and δ(X) + δ(Y) δ(G)- 1.     

关于P_(r,(2s-1))的奇优美标号

对于简单图G=〈V,E〉,如果存在一个映射f:V(G)→{0,1,2,…,2 |E|-1}满足1)对任意的u,v∈V,若u≠v,则(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的奇优美标号.Gnanajoethi提出了一个猜想:每棵树都是奇优美的.证明了图P_(r,(2s-1)是奇优美图.     

Homological behavior of idempotent subalgebras and Ext algebras

Let A be a(left and right) Noetherian ring that is semiperfect. Let e be an idempotent of A and consider the ring Γ :=(1-e)A(1-e) and the semi-simple right A-module Se := e A/e rad A. In this paper, we investigate the relationship between the global dimensions of A and Γ, by using the homological properties of Se. More precisely, we consider the Yoneda ring Y(e) := Ext_A~*(Se, Se) of e. We prove that if Y(e) is Artinian of finite global dimension, then A has finite global dimension if and only if so does Γ. We also investigate the situation where both A and Γ have finite global dimension. When A is Koszul and finite dimensional, this implies that Y(e) has finite global dimension. We end the paper with a reduction technique to compute the Cartan determinant of Artin algebras. We prove that if Y(e) has finite global dimension, then the Cartan determinants of A and Γ coincide. This provides a new way to approach the long-standing Cartan determinant conjecture.     

一个加强的强大数定律

本文旨在给出概率论中的一个加强的强大数定律 ,并采用“子序列方法”予以证明 .一般地说 ,子序列方法旨在将一个子序列证明 (相对地说比较容易 )的结果扩张到整个序列上去 .定理　设 { Xn,n≥ 1 }为一随机变量序列 ,令Sn =∑nj=1Xj (1 )　若诸 Xj不相关 ,且满足σ2 (Xn) =O(nθ)　　 (θ≥ 0 ) (2 )　则对任意满足α >3 2θ4(3 )　的正数 α,有Sn -E(Sn)nα → 0　 (n→∞ ) .　　　 a.e. (4)　　　证明　不失一般性 ,我们可以假设对每个 j,E(Xj) =0 ,则有E(S2n) =∑nj=1E(X2j) (5 )　注意到 (2 )式有E(S2n)≤ O(n1 θ) . (6)　…     

Z3-CONNECTIVITY OF 4-EDGE-CONNECTED TRIANGULAR GRAPHS

A graph G is k-triangular if each of its edge is contained in at least k triangles. It is conjectured that every 4-edge-connected triangular graph admits a nowhere-zero 3-flow. A triangle-path in a graph G is a sequence of distinct triangles T_1 T_2··· T_k in G such that for 1 ≤ i ≤ k-1, |E(T_i) ∩ E(T_(i+1))| = 1 and E(T_i) ∩ E(T_j) = ? if j i + 1. Two edges e, e′∈ E(G) are triangularly connected if there is a triangle-path T_1, T_2, ···, T_k in G such that e ∈ E(T_1)and e′∈ E(T_k). Two edges e, e′∈ E(G) are equivalent if they are the same,parallel or triangularly connected. It is easy to see that this is an equivalent relation. Each equivalent class is called a triangularly connected component.In this paper, we prove that every 4-edge-connected triangular graph G is Z_3-connected, unless it has a triangularly connected component which is not Z_3-connected but admits a nowhere-zero 3-flow.     

有关递归不可分集的几个结果

本文在递归不可分理论方面得到一些结果。 1.对任意给定的非递归r.e.度,均存在r.e.集,A是有丝分裂集且可分裂的两集可要求为递归不可分的r.e.集。 2.对任意高r.e.集C和任意非递归r.e.集D,均存在递归不可分的r.e.集A,B满足A其高度,B具低度,C≤_TA,φ<_TB≤_TD。 3.存在r.e.集A,B,C,D满足(1)A,B递归不可分且形成极小对,(2)A\B,A\D,C\B,C\D,(3)A<_TC,B<_TD,(4)A,B具低度,(5)C,D具高度。     

线性模型中均值向量的最小二乘估计和最佳线性无偏估计之差的欧氏范数的界

我们讨论最一般的线性模型 Y=Xβ e E(e)=0,Cov(e)=V,(1)其中Y为n×1随机观测向量,X为n×p的已知矩阵,其秩 R(X)=r,β为p×1未知参数向量,e为n×1随机误差向量,E(e)表示e的均值向量,Cov(e)表示e的协方差矩阵.V为n×n的定正方阵.记为V>0(下同).     

关于丢番图方程X~2+4Y~4=pZ~4

设p为素数,p=4A~2+1+2|A,A∈N~*.运用二次和四次丢番图方程的结果证明了方程G:X~2+4Y~4=pZ~4,gcd(X,Y,Z)=1,除开正整数解(X,Y,Z)=(1,A,1)外,当A≡1(mod4)时,至多还有正整数解(X,Y,Z)满足X=|p(a~2-b~2)~2-4(A(a~2-b~2)±ab)~2|,Y~2=A(a~2-b~2)~2±2ab(a~2-b~2)-4a~2b~2A,Z=a~2+b~2;当A≡3(mod4)时,至多还有正整数解(X,Y,Z)满足X=|4a~2b~2A-(4abA±(a~2-b~2))~2|,Y~2=4a~2b~2A±2ab(a~2-b~2)-A(a~2-b~2)~2,Z=a~2+b~2.这里a,b∈N~*并且ab,gcd(a,b)=1,2|(a+b).同时具体给出了p=5时方程G的全部正整数解.     

A Combinatorial Theorem on Ordered Circular Sequences of n_1 u''''s and n_2 v''''s with Application to Kernel-perfect Graphs

Abstract An ordered circular permutation S of u's and v's is called an ordered circular sequence of u's andv's.A kernel of a digraph G=(V,A)is an independent subset of V,say K,such that for any vertex v_i in V\Kthere is an arc from v_i to a vertex v_j in K.G is said to be kernel-perfect(KP)if every induced subgraph of Ghas a kernel. G is said to be kernel-perfect-critical(KPC)if G has no kernel but every proper induced subgraphof G has a kernel.The digraph G=(V,A)=(j_1,j_2,…,j_k)is defined by:V(G)={0,1,…,n-1},A(G)={uv│v-u≡j_i(mod n) for 1≤i≤k}. In an eariler work, we investigated the digraph G=(1,±δd,±2d,±3d,…±sd),denoted by G(n,d,r,s),whereδ=1 for d>1 or δ=0 for d=1,and n,d,r,s are positive integers with(n,d)=r and n=mr ,and gave some necessaryand sufficient conditions for G(n,d,r,s)with r≥3 and s=1 to be KP or KPC. In this paper,we prove a combinatorial theorem on ordered circular sequences of n_1 u's and n_2 v's.By usingthe theorem,we prove that,if(n,d)=r≥2 and s≥2,then G(n,d,r,s,)is     

l2-值两参数OU过程的连续

§ 1　IntroductionLet{ Y(t) ;-∞ 0 ,i.e.Xk(· ) is a sta-tionary,mean zero Gaussian process with EXk(s) Xk(t) =(γk/λk) exp(-λk|t-s|) ,k=1 ,2 ,....The process Y(· ) was first introduced in[1 ] as the stationary solution of the infinitearray of stochastic differential equationsd Xi(t) =-λi Xi(t) dt+(2γi) 1 / 2 d Wi(t)　 (i =1 ,2 ,...) ,(1 .1 )where { Wi(t)…