8n阶标准幻立方的第1类快速构造方法

前言费尔马是第一个提出幻立方概念的人。他给出的幻立方定义是:n阶数字立方体的4条对角线和每条直行上n个数之和均等于幻立方常数c_n,c_n=n/2(n~3+1)。共需满足3n~2+4个条件,可以称之为古典幻立方。本文将提出第2种类型的幻立方:n阶数字立方体的3n+6个完整的n阶平面都是n阶     

平衡立方体的h-额外连通度及h-额外条件诊断数

互连网络的连通度和可诊断数是衡量网络性能优劣的经典参数.h-额外连通度作为连通度的一种推广,是度量互连网络可靠性的一个重要指标.相应地,h-额外条件诊断数作为传统可诊断度的推广,也是度量系统诊断能力的一种新的性能指标.另外,平衡立方体网络作为超立方体网络的变形,在保留前者原有优良性能的基础上,又增加了一些新的优良性能.文中确定了平衡立方体(BH_n)的4-额外连通度和5-额外连通度都是6n-8.在此基础上,进一步推导出当h=4,5,n≥4时,BH_n在PMC模型下的h-额外条件可诊断数是6n-3.从而表明了在h-额外条件诊断策略下的可诊断数几乎是传统可诊断数的3倍.     

完全对换网络的限制连通度

完全对换网络是基于 Cayley 图模型的一类重要互连网络. 一个图 G 的 k-限制点(边)连通度是使得 G-F 不连通且每个分支至少有 k 个顶点的最小点(边)子集 F 的基数, 记作 \kappa_{k}(\lambda_{k}). 它是衡量网络可靠性的重要参数之一, 也是图的容错性的一种精化了的度量. 一般地, 网络的 k-限制点(边)连通度越大, 它的连通性就越好. 证明了完全对换网络 CT_{n} 的 2-限制点(边)连通度和 3-限制点(边)连通度, 具体来说: 当 n\geq4 时, \kappa_{2}(CT_{n})=n(n-1)-2, \kappa_{3}(CT_{n})=\frac{3n(n-1)}{2}-6; 当 n\geq3 时, \lambda_{2}(CT_{n})=n(n-1)-2, \lambda_{3}(CT_{n})=\frac{3n(n-1)}{2}-4.     

基于最小传输延迟的单向Hamming网设计

Hamming网H(m,n)作为超立方网的推广,优良的性质使其成为并行处理和计算系统的首选拓扑结构。本文利用分层方法,对单向Hamming网进行最小直径(定向直径)设计,以保证低干扰的同时,降低其传输延迟,方法如下:当n=3时,首先根据d→(H(2,3))=3得到3d→(H(3,3))4,进而得到4d→(H(4,3))5,最后将H(m,3)按照H(4,3)分层,每一层H(m,3)按照H(4,3)方式进行定向设计;当n4时,每一层按照H(2,n)的方式进行定向。最后验证,按照这种方式设计的Hamming网,可有效降低信息传输延迟。     

一类拟轮图的亏格（英文）

设W_n是阶数为n+1的轮图.如果添加一个3-度的点到W_n中,所得图的亏格如何变化?本文通过联树模型得到γ(W_n⊕v_(typ)~1)=0,γ(W_n⊕v_(typ)~2)=1,γ(W_n⊕v_(typ)~3)=1.     

关于一类立方图的可连通性

文献[1]中提出阶为n(n≥3)的路的立方图是可圈图当且仅当n为奇数,本文主要证明阶为n(n≥3)的路的立方图是可连通图当且仅当n为奇数,从而加强了文献[1]中的结论.     

上期基础训练题答案或提示

提示:(5)总数是C(1/3) C(2/3) C(3/3)=7;故选A。(6) 设任一x-12m 8n,p=3m 2n,q=-(3m 2n),则x=12m 8n=4(3m 2n)=20(3m 2n)-16(3m 2n)=20p 16q,故x∈B,从而AB,同理可证BA,故A=B.选C。     

关于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-树.     

构造模型求自然数的方幂和

自然数方幂和问题是指Sk(n)=nΣi=1ik(n,k∈N)的计算与表示.早在公元前二百多年,希腊著名科学家阿基米德就已经得出了k=2和k=3时的结果:S2(n)=12+22+…+n2=n(n+1)(2n+1)/6,S3(n)=13+23+…+n3=n2(n+1)2/4,尽管他的证明比较复杂,但S4(n)的结果却始终无法找到,直到一千多年之后的11世纪,阿拉伯数学家才得道:S4(n)=1/30n(n+1)(2n+1)(3n2+3n-1).……     

新题征展(68)

A题组新编1.(1)已知等差数列{an}的前n项和为Sn,若Sm=Sn(m≠n),则Sm+n=;(2)已知函数f(x)=ax2+bx,若f(m)=f(n)(m≠n),则f(m+n)=;(3)已知函数f(x)=ax2+bx+c(a≠0),若f(m)=f(n)(m≠n),则f(m+n)=.2.(1)已知等差数列{an}的前n项和为Sn,若Sm=n,Sn=m(m≠n),则Sm+n=;(2)等差数列{an}的前n项和为Sn,若Sm=a,Sn=b(m≠n),则Sm+n=;(3)已知函数f(x)=ax2+bx(a≠0),若f(m)=t,f(n)=s(m≠n),则f(m+n)=;(4)f(x)=ax2+bx+c(a≠0),若f(m)=t,f(n)=s(m≠n),则f(m+n)=.3.(1)在周长为定值l的直角三角形中,怎样的三角形面积最大?最大面积是多少?请详述理由;(2)在…     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.     

Towards Excellence in Science Chinese Academy of Sciences

<正>May 26,2014,Beijing Science is a human enterprise in the pursuit of knowledge.The scientific revolution that occurred in the 17th Century initiated the advances of modern science.The scientific knowledge system created by     

THE 8~(th) INTERNATIONAL CONGRESS ON INDUSTRIAL AND APPLIED MATHEMATICS

<正>August 10-14,2015Beijing,ChinaThe International Congress on Industrial and Applied Mathematics(ICIAM)is the premier international congress in the field of applied mathematics held every four years under the auspices of the International Council for Industrial and Applied Mathematics.From August 10 to 14,2015,mathematicians,scientists     

Bounds for the zeros of polynomials

Let P(z)=∑↓j=0↑n ajx^j be a polynomial of degree n. In this paper we prove a more general result which interalia improves upon the bounds of a class of polynomials. We also prove a result which includes some extensions and generalizations of Enestrǒm-Kakeya theorem.     

Boundedness of commutators related to Marcinkiewicz integrals on hardy type spaces

In this paper, the authors study the boundedness of the operator [μΩ, b], the commutator generated by a function b ∈ Lipβ(Rn)(0 ＜β≤ 1) and the Marcinkiewicz integrals μΩ, on the classical Hardy spaces and the Herz-type Hardy spaces in the case Ω∈ Lipα(Sn-1)(0 ＜α≤ 1).     

Generalization of the interaction between Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average empirical statistics on u. A very simple relation exists when of a function f（u） of an input u from the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. These products are characterized by a Strang and Fix like condition. An explicit construction of these product operators is exhibited for piecewise polynomial functions, using Hermite interpolation. The averaging relation which holds for the Haar approximation is then recovered when the product is defined by a two point Hermite interpolation.     

Jacobi polynomials used to invert the laplace transform

Given the Laplace transform F(s) of a function f(t), we develop a new algorithm to find an approximation to f(t) by the use of the classical Jacobi polynomials. The main contribution of our work is the development of a new and very effective method to determine the coefficients in the finite series expansion that approximation f(t) in terms of Jacobi polynomials. Some numerical examples are illustrated.