高维空间中半线性波动方程的Sobolev指数

ＧｕｓｔａｖｏＰｏｎｃｅ与ＴｈｏｍａｓＣ．Ｓｉｄｅｒｉｓ［４］猜测对一些具有特殊非线性项的半线性波动方程，如ｕｔ－△ｕ＝ｕｋ（Ｄｕ）α（ｘ∈Ｒｎ，ｋ∈Ｚ＋，ｌ＝｜α｜２），其中Ｓｏｂｏｌｅｖ指数会在ｎ２与（ｎ２＋１）之间．文［４］中，在ｘ∈Ｒ３时，回答了这一问题．本文在ｎ３维空间中，得到了半线性波动方程ｕｔ－△ｕ＝ｕｋ（Ｄｕ）α（ｘ∈Ｒｎ，ｋ∈Ｚ＋，ｌ＝｜α｜２）的Ｓｏｂｏｌｅｖ指数为ｍａｘ｛ｎ２＋１２，（ｎ２－１）·ｌ－３ｌ－１＋２｝，此数确实在区间［ｎ２＋１２，ｎ２＋１］中．     

Jacobi多项式零点为结点的Lagrange插值多项式之逼近

对于可微函数ｆ∈Ｃｑ［－１，１］，本文研究以Ｊａｃｏｂｉ多项式Ｊ（α，β）ｎ（ｘ）的零点为结点组之Ｌａｇｒａｎｇｅ插值多项式对ｆ及其导数的同时逼近，证明不等式Ｌ（ｓ）ｎ（ｆ，α，β，ｘ）－ｆ（ｓ）（ｘ）＝Ｏ（１）Δ－ｓｎ（ｘ）Δｑｎ（ｘ）ω（ｆ（ｑ），Δｎ（ｘ））ｌｏｇｎ｛＋（１－ｘ＋ｎ－１）－α－１２ｎ－ｑω（ｆ（ｑ），ｎ－１）｝，在［０，１］上对于ｓ＝０，１，２，…，ｑ一致成立，其中Δｎ（ｘ）＝ｎ－１１－ｘ２＋ｎ－２     

关于欧拉常数的一个不等式

本文建立了关于欧拉常数γ的一个不等式：∑ｎｋ＝１１ｋ－ｌｎ（ｎ）－１２ｎ＋１１２ｎ２－１１２０ｎ４＜γ＜∑ｎｋ＝１１ｋ－ｌｎ（ｎ）－１２ｎ＋１１２ｎ２－１１２０ｎ４＋１２５２ｎ６,改进了文献［１］,［２］,［３］的结果     

图K_n-E(k_0P_3(∪ri=1k_iP(q_i-1)))的色唯一性

记δｎ＝ｋ≤ｎｋｎ－ｋ，在本文中证明了：ｒ∈Ｎ，若ｉ∈｛１，２，…，ｒ｝，ｑｉ（＞５）都是素数，并且［（δｑｉ－１－１）！＋１］／δｑｉ－１是正整数，则图簇Ｋｎ－Ｅｋ０Ｐ３∪ｋ１Ｐｑ１－１∪ｋ２Ｐｑ２－１∪…∪ｋｒＰｑｒ－１是色唯一的，推广了文［１］的结果     

A New Class of Generalized Landau Linear Positive Operator Sequence and Its Properties of Approximation

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎ１９０８，Ｅ．Ｌａｎｄａｕｉｎｔｒｏｄｕｃｅｄｔｈｅｆｏｌｌｏｗｉｎｇｗｅｌｌｋｎｏｗｎｓｅｑｕｅｎｃｅｏｆｏｐｅｒａｔｏｒｓ［１］Ｌｎ［ｆ（ｔ）；ｘ］＝Ｋｎ∫１－１ｆ（ｔ）［１－（ｔ－ｘ）２］ｎｄｔ，　　　　（１．１）ｗｈｅｒｅ　　　　　Ｋｎ＝［∫１｛－１（１－ｔ２）ｎｄｔ］－１～ｎπ　　（ｎ→∞）．（１．１）ｗａｓｕｓｅｄｉｎｔｈｅｐｒｏｏｆｏｆｔｈｅＷｅｉｅｒｓｔｒａｓｓＴｈｅｏｒｅｍ．Ｓｉｎｃｅｔｈｅｎ，ｔｈｅａｐｐｒｏｘｉｍａｔｉｏｎｐｒｏｐ－ｅｒｔ…     

有理插值的基本特征

１　引　言 记 ｎ为次数不超过ｎ的一元多项式函数类,约定零多项式的次数为－∞,即ｄｅｅ（０）＝－∞;记 ｍ,ｎ为分子属于 ｍ,分母属于 ｎ＼｛０｝的一元有理函数类．我们约定：本文所采用的概念和记号将与文［１］保持一致,本文中“有理插值问题”系指文［１］中“有理插值问题（２．１）（２．２）”,并简记为ＲＩＰ． 文［１］在［２－８］的基础上引进了ＲＩＰ的　方程组,定义了　插值式,指出了其与经典结果的关系,这为我们分析ＲＩＰ提供了一个有力的工具．本文将在文［１］的基础上,深入讨论ＲＩＰ的基本特征．在本节和下…     

恰有t行含对称正元的布尔方阵的幂敛指数的估值

设Ｄｎ，２（ｔ）为恰有ｔ行含对称正元的ｎ阶布尔方阵的集合，２≤ｔ≤ｎ。本文证明了，对于任给Ａ∈Ｄｎ，２（ｔ），幂敛指数ｋ（Ａ）≤∫（ｎ－ｔ－１）＾２＋１，３ｎ－ｔ－２，当ｔ≤ｎ－［３＋√８ｎ－７／２］当ｔ〉ｎ－［３＋√８ｎ－７／２］，这里［ｘ］表示不小于ｘ的最小整数。同时，我们还证明了这个界是可以达到的，并且对Ｄｎ，２（ｔ）的极矩阵集合作了部分刻划。     

图Kn—E（k0P3（∪↑r↓i=1kiPqi—1））的色唯一性

记δｎ＝Σ↓ｋ≤ｎ（＾ｋｎ－ｋ），在本文中证明了：Ａ↓ｒ∈Ｎ，若Ａ↓∈Ｎ，若Ａ↓∈｛１，２，…，ｒ｝，ｑｉ（〉５）都是素数，并且［（δｑｉ－１－１）！＋１］／δｑｉ－１是正整数，则图簇Ｋｎ－Ｅ（ｋ０Ｐ３∪ｋ１Ｐｑ１－１∪…∪ｋｒＰｑｒ－１）是色唯一的，推广了文［１］的结果。     

一类BSC码的汉明距离界

根据二元叠加码(Binary Superimposed Code)M_q(n,k,d)的定义研究了这个BSC码任意两个码字的汉明(Hamming)距离上下界,并由此给出了它的平均汉明距离和均方差的界.     

“mp2型“伪素数的性质与存在

定义 若ｎ是合数,且２ｎ－１＝１（ｍｏｄ ｎ）,则称ｎ是伪素数． 文［１］证得 １０９３２及 ３５１１２这两个数是伪素数,从而否定了陈历功等提出的“伪素数不含平方数因数”的猜想．记ｐ是奇素数,ｍＮ,本文将讨论“ｍＰ２型”伪素数的性质与存在的实例．先引入以下的 引理［２］设使同余式：２ｒ＝１（ｍｏｄ ｍ）成立的最小正整数为ｒ,则 ２ａ＝１（ｍｏｄ ｍ）的充要条件是ｒ（注引理即文［２］第七章定理１的推过２） 定理１ 设ｐ是奇素数,如果ｎ是含有因数Ｐ２的伪素数,则Ｐ２是伪素数． 证明 记ｎ＝ｍｐ２（ｍ Ｎ）,则由伪…     

具有最大度距离的单圈图

设U (n)是具有n个顶点的所有单圈图的集合,G(3; n- 3)是由一个三角形C3粘上一条悬挂路P_(n-3)得到的单圈图.本文将证明当n 5时具有最大度距离的单圈图是G(3; n - 3).     

移位交换网的最优路由算法

移位交换网是重要的互联网络之一 ,在并行计算中有着广泛应用 .然而 ,它缺少任意点对间的最短路由算法 .已有的路由算法都不能保证其任意节点对间都是最短路由 .文中给出了一个最短路由算法 ,也是最优路由算法 ,它使得从源节点到目的节点的任何信息都是沿最短路由传输 .同时 ,我们还得到了任意节点对间的距离公式     

Stability of the Minkowski Measure of Asymmetry for Convex Bodies

Given a convex body $C\subset R^n$ (i.e., a compact convex set with nonempty interior), for $x\in$ {\it int}$(C)$, the interior, and a hyperplane $H$ with $x\in H$, let $H_1,H_2$ be the two support hyperplanes of $C$ parallel to $H$. Let $r(H, x)$ be the ratio, not less than 1, in which $H$ divides the distance between $H_1,H_2$. Then the quantity $${\it As}(C):=\inf_{x\in {\it int}(C)}\,\sup_{H\ni x}\,r(H,x)$$ is called the Minkowski measure of asymmetry of $C$. {\it As}$(\cdot)$ can be viewed as a real-valued function defined on the family of all convex bodies in $R^n$. It has been known for a long time that {\it As}$(\cdot)$ attains its minimum value 1 at all centrally symmetric convex bodies and maximum value $n$ at all simplexes. In this paper we discuss the stability of the Minkowski measure of asymmetry for convex bodies. We give an estimate for the deviation of a convex body from a simplex if the corresponding Minkowski measure of asymmetry is close to its maximum value. More precisely, the following result is obtained: Let $C\subset R^n$ be a convex body. If {\it As}$(C)\ge n-\varepsilon$ for some $0\le \varepsilon < 1/8(n+1),$ then there exists a simplex $S_0$ formed by $n+1$ support hyperplanes of $C$, such that $$(1+8(n+1)\varepsilon)^{-1}S_0\subset C\subset S_0,$$ where the homethety center is the (unique) Minkowski critical point of $C$. So $$d_{{\rm BM}}(C,S)\le 1+8(n+1)\varepsilon$$ holds for all simplexes $S$, where $d_{{\rm BM}}(\cdot,\cdot)$ denotes the Banach-Mazur distance.     

Approximation of Convex Bodies by ConvexBodies

For the affine distance d(C,D) between two convex bodies C, D(?) Rn, which reduces to the Banach-Mazur distance for symmetric convex bodies, the bounds of d(C, D) have been studied for many years. Some well known estimates for the upper-bounds are as follows: F. John proved d(C, D) < n1/2 if one is an ellipsoid and another is symmetric, d(C, D) < n if both are symmetric, and from F. John's result and d(C1,C2) < d(C1,C3)d(C2,C3) one has d(C,D) < n2 for general convex bodies; M. Lassak proved d(C, D) < (2n - 1) if one of them is symmetric. In this paper we get an estimate which includes all the results above as special cases and refines some of them in terms of measures of asymmetry for convex bodies.     

实Hilbert空间中点到有限余维子空间的距离问题

本文讨论实Ｈｉｌｂｅｒｔ空间中一点到有限余维子空间的距离，将一点到超平面的距离公式推广到一点到余维ｎ子空间Ｍ以及仿射集Ｑ的距离公式，并对Ｍ或Ｑ闭的情形表示出最佳逼近元。     

Distance Integral Complete Multipartite Graphs with s=5, 6

Let D(G) = (dij )n×n denote the distance matrix of a connected graph G with order n, where dij is equal to the distance between vertices vi and vj in G. A graph is called distance integral if all eigenvalues of its distance matrix are integers. In 2014, Yang and Wang gave a su?cient and necessary condition for complete r-partite graphs Kp1,p2,··· ,pr =Ka1·p1,a2·p2,··· ,as···ps to be distance integral and obtained such distance integral graphs with s = 1, 2, 3, 4. However distance integral complete multipartite graphs Ka1·p1,a2·p2,··· ,as·ps with s>4 have not been found. In this paper, we find and construct some infinite classes of these distance integral graphs Ka1·p1,a2·p2,··· ,as·ps with s = 5, 6. The problem of the existence of such distance integral graphs Ka1·p1,a2·p2,··· ,as·ps with arbitrarily large number s remains open.     

有循环极大子群的素数幂阶群的作用是边传递的图(II)

假定Γ是一个有限的、单的、无向的且无孤立点的图,G是Aut(Γ)的一个子群.如果G在Γ的边集合上传递,则称Γ是G-边传递图.我们完全分类了当G为一个有循环的极大子群的素数幂阶群时的G-边传递图.结果为:设图Γ含有一个阶为pn(p是素数,n≥2)的自同构群,且G有一个极大子群循环,则Γ是G-边传递的,当且仅当Γ同构于下列图之一1)pmK1,pn-1-m,0≤m≤n-1;2)pmK1,pn-m,0≤m≤n;3)pmKp,pn-m-1,0≤m≤n-2;4)pn-mCpm,pm≥3,m＜n;5)2n-2K1,1;6)pn-1-mCpm,pm≥3,m≤n-1;7)2pn-mCpm,pm≥3,m≤n-1;8)2pn-mK1,pm,0≤m≤n;9)pn-mK1,2pm,0≤m≤n;10)pn-mK2,pm,0＜m≤n;11)C(2pn-m,1,pm);12)pkC(2pm-k,1,pn-m),0＜k＜m,0＜m≤n;13)(t-s,2m)C(2m 1/(t-s,2m),1,2n-1-m),其中0≤m≤n-1,2n-2(s-1)≡0(mod 2m),t≡1(mod 2),s(≠)t(mod 2m),1≤s≤2m,1≤t≤2n-1;14)∪p i=1 Ci p n-1,其中Ci p n-1=Ca1a1 [1 (i-1)pn-2]a 1 2[1 (i--1)p n-2]…a 1 (pn-1-1)[1 (i-1)p n-2]≌Cp n-1,i=1,2,…,p;15)∪2 i=1 Ci 2n-1,其中Ci 2n-1=Ca1a 1 [1 (i-1)(2n-2-1)]a1 2[1 (i-1)(2n-2-1)]…a1 (2n-1-1)[1 (i-1)(2n-2-1)]≌C2n-1,i=1,2.     

Привалов定理的拓广

<正> 设Ω是 m 个实变数 u_1,…,u_m 空间中的-p 维可定向流形Ω:(?)Ω称为属于 C~e 类(e是非负的整数),如果实函数 f_1,…,f_(m-p)皆有e次连续偏微商.Ω称为平滑的,如Ω属于 C~1 类并且矩阵     

同伦群和同调群的关系及其应用

<正> 最近几年来,关于同伦群的研究,特别是球面同化群的计算有很大的进步,但是关于更一般的空间的同伦群的计算,就作者所知道的文献来说,似乎没有相应的进展,在这一方面的工作,最早也是最主要的是 Hurewicz 定理,Serre 在[15]中利用所谓 C同构的概念,把 Hurewicz 定理推广到所谓(n-1)维 C 连通空间中,但是也和 Hure-wicz 定理一样,只能讨论 n 维同伦群和 n 维同调群的关系.张素诚,Hilton 及 Barrat     

The Number of Embeddings of Minimally Rigid Graphs

Rigid frameworks in some Euclidean space are embedded graphs having a unique local realization (up to Euclidean motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings of minimally rigid graphs with $n$ vertices. We show that, modulo planar rigid motions, this number is at most ${{2n-4}\choose {n-2}} \approx 4^n$. We also exhibit several families which realize lower bounds of the order of $2^n$, $2.21^n$ and $2.28^n$. For the upper bound we use techniques from complex algebraic geometry, based on the (projective) Cayley--Menger variety ${\it CM}^{2,n}(C)\subset P_{{{n}\choose {2}}-1}(C)$ over the complex numbers $C$. In this context, point configurations are represented by coordinates given by squared distances between all pairs of points. Sectioning the variety with $2n-4$ hyperplanes yields at most $deg({\it CM}^{2,n})$ zero-dimensional components, and one finds this degree to be $D^{2,n}=\frac{1}{2}{{2n-4}\choose {n-2}}$. The lower bounds are related to inductive constructions of minimally rigid graphs via Henneberg sequences. The same approach works in higher dimensions. In particular, we show that it leads to an upper bound of $2 D^{3,n}= {({2^{n-3}}/({n-2}})){{2n-6}\choose{n-3}}$ for the number of spatial embeddings with generic edge lengths of the $1$-skeleton of a simplicial polyhedron, up to rigid motions. Our technique can also be adapted to the non-Euclidean case.