与任意图正交的[0,kj]m1-因子分解

设kl,k2,…,km是正整数.证明了若G是一个[0,k1+k2+…+km-m+1]-图,H是G中一个给定的有m条边的子图,则G有一个[0,kj]m1-因子分解与H正交.     

与任意图正交的[0,k_i]_1~m-因子分解

设G是一个图 ,k1,… ,km 是正整数·　若图G的边能分解成m个边不交的 [0 ,k1]_因子F1,… ,[0 ,km]_因子Fm,则称 F =F1,… ,Fm 是G的一个 [0 ,ki]m1_因子分解·　如果H是G的一个有m条边的子图且对任意的 1≤i≤m有｜E(H) ∩E(Fi) ｜=1,则称 F与H正交·　证明了若G是一个 [0 ,k1 … km-m 1]_图 ,H是G的一个有m条边的子图 ,则图G有一个 [0 ,ki]m1_因子分解与H正交     

与任意图正交的[0,ki]1^m—因子分解

设G是一个图,k1,…,km,是正整数,若图G的边能分解成m个边不交的[0,k1]-因子 F1,…,[0,]-l因子Fm,则称F＝{F1,…,Fm}是G 的一个[0,ki]1^m-因子分解,如果H是G的一个有m条边的了了图且对任意的1≤i≤m有E（H）E（Fi)=1,则称F与H正交,证明了若G是一个[0,k1 ,…, km-m 1]-图,。H是G的一个有m条边的子图,则图G有一个[0,ki]1^m-因子分解与H正交。     

与任意图正交的［0，ki］m1-因子分解

设G是一个图, k1,…, km是正整数.若图G的边能分解成m个边不交的［0,k1］-因子 F1,…,［0,km］-因子Fm,则称＝F1,…,Fm是G的一个［0,ki］m1-因子分解.如果H是G的一个有m条边的子图且对任意的1≤I≤m有｜E(H)∩E(Fi)｜＝1,则称与H正交.证明了若G是一个［0,k1＋…＋km－m＋1］-图,H是G的一个有m条边的子图,则图G有一个［0,ki］m1-因子分解与H正交.     

与星正交的[0,k_j]~m_1-因子分解

设G是一个图，k1；k2，…，km是正整数，如果对所有的x∈V（G）有0≤dG（x）≤k1＋k2＋…＋km－m＋1成立，K是G的m-星，则G有一个［0，kj］1m-因子分解与K正交．     

图中具有正交（g,f）因子分解的子图

设G是一个 (mg +k ,mf -k) -图 (1≤k 相似文献   

二分（0，mf—m＋1）-图的正交（0，f）-因子分解

设G=（X,Y,E（G））是一个二分图,分别用V（G）=X∪Y和E（G）表示G的顶点集和边集．设f是定义在V（G）上的整数值函数且对任意x∈V（G）有f（x）≥k．设H1,H2,…,Hk是G的k个顶点不相交的子图,且｜E（Hi）｜=m,1≤i≤k．本文证明了每个二分（0,mf—m＋1）．图G有一个（0,f）-因子分解正交于Hi（i=1,2,…,k）     

含有给定k-正则子图的[a,b]-因子

设G是一个图,并设n,k,r,a和b是整数且满足k≥1,k≤a＜b和n≥3.对于G的给定的k-正则图H,如果G是K1,n-free图,且G的最小度至少是((n(a+1)+b-a-(k+1))/(b-k))「(ab+b-a-k)/(2(n-1))」-(n-1)/(b-k)(「(an+b-a-k)/(2(n-1))」)2-1,那么G有一个[a,b]-因子F使得E(H)(∈)E(F).类似地,也得到了关于图G有一个r-因子含有G中给定的k-正则子图的度条件.进一步,指出这些度条件是最佳的.     

（mg＋k,mf—k）—图中正交于r个不相交子图的边不变的（g,f）—因子

设m,k和r为正整数,且使l≤k＜m.设G是一个具有顶点集合V(G)和边集合E(G)的图,并设g和f是定义在V(G)上的使对每个x∈V(G)有r≤g(x)≤f(x)的整数值函数.设H1,H2,…,Hr是G的r个顶点不相交的子图且|E(Hi)|=k,1≤i≤r.本文证明了每个(mg+k,mf-k)-图有k个边不相交的(g,f)-因子正交于Hi,1≤i≤r.     

二分(0,mf-m+1)-图的正交(0,f)-因子分解

设G=(X,Y,E(G))是一个二分图,分别用V(G)=XUY和E(G)表示G的顶点集和边集.设f是定义在V(G)上的整数值函数且对(A)x∈V(G)有f(x)≥k.设H_1,H_2,…,H_k是G的k个顶点不相交的子图,且|E(H_i)|=m,1≤i≤k.本文证明了每个二分(0,mf-m+1)-图G有一个(0,f)-因子分解正交于Hi(i=1,2,…,k).     

ON A THEOREM OF A.A. LYAPUNOV

Abstract

In this note we obtain some extensions and an approximation of the Lyapunov convexity theorem by means of the bilinear integration of a set-valued function. The integration is performed successively with respect to a non-atomic, a direct sum and a Darboux vector measure. The necessary counterexamples are provided.     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

A REMARK ON A BMO MARTINGALE

Let M = (Mt,Ft) be a uniformly integrable continuous martingale with MO = 0. For1 5 p < cot we setIIMllBMO. = '3p II[E[IMoo ~ MTIplFT]]'/Pll.,where the supremum is taken over all stopping times T.Set BMO. = {M: IIMllBMO. < co}. It is well known that BMO. = BMO, (VI S p 5 q).F'urthermore, all 11.llBMO. norms are equivalent andIIi ~~if;llMllBMO. = SUP T P(T < co)i'where the supremum is taken over all stopping times T satisfying P(T < co) > 0. In the laterwe shall simply …     

有限群的一个类函数的模构造

本文研究了有限群上的一个类函数.通过计算它和不可约特征标的内积,证明了它是特征标并且通过复群代数的中心的正则表示给出了它的一个模构造.     

NAMING A COLUMN ON A SPREADSHEET

Spreadsheets use a meaningful algebra-like notation which, research suggests, can support pupils in developing an understanding of variables. This paper discusses the activity of Year 8 pupils who were taught to name a column on a spreadsheet, and who were asked to reflect upon their activity in a stimulated recall interview. More specifically, it considers the pupils' understanding of notation, such as 'A2' and 'm', which they used when constructing spreadsheet formulae. It is suggested that experience of naming columns may help pupils to develop a clearer sense of the notation as a variable, and to make links between their spreadsheet activity and use of standard algebraic notation [1].     

A new characterization of A 5

Let G be a group and τ _e (G) the set of numbers of elements of G of the same order. In this paper, by τ _e (G), we give a new characterization of A ₅, where A ₅ is the alternating group of degree 5. We get the theorem following: Theorem. Let G be a group, ${G\cong A_5}$ if and only if τ _e (G) = τ _e (A ₅) = {1, 15, 20, 24}.     

简化摩擦接触问题的对称弱超内罚间断Galerkin方法的先验和后验误差估计

本文讨论了简化摩擦接触问题的一类对称弱超内罚间断Galerkin方法.首先,在能量范数意义下得到最优先验误差估计.进一步,我们推导了一类残量型后验误差估计子,并证明了它的可靠性和有效性.