单圈图的最大特征值的上界的改进

Let G（V, E） be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V（Cm）. The G - E（Cm） are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui ： i = 1, 2 , m}. Let κ = ec＋1. Forj = 1,2,...,k- 1, let δij = max{dv ： dist（v, ui） = j,v ∈ Ti}, δj = max{δij ： i = 1, 2,..., m}, δ0 = max{dui ： ui ∈ V（Cm）}. Then λ1（G）≤max{max 2≤j≤k-2 （√δj-1-1＋√δj-1）,2＋√δ0-2,√δ0-2＋√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 （G） is the largest eigenvalue of the adjacency matrix of G.     

树的最大特征值的上界的一个注记

设T是一个树,V是T的顶点集．记dv是υ∈V的度,△是T的最大顶点度．设υ∈V且dw=1．记k=ew+1,这里ew是w的excentricity．设δj′= max{dυ:dist(υ,w)=j},j=1,2,…,k-2,我们证明和这里μ1(T)和λ1(T)分别是T的Laplacian矩阵和邻接矩阵的最大特征值．特别地,记δo′=2．     

一类具有转向点的三阶微分方程的边值问题的解的高阶渐近展开

利用上下解方法,研究如下一类具有转向点的三阶微分方程的边值问题{ε~2y″′=f(t,y,ε)y″ g(t,y,ε)y′ h(t,y,ε),a相似文献   

与一类算术函数关联的矩阵的行列式的下界

设f为一个算术函数,S={x 1,…,x n}为一个n元正整数集合.称S为gcd-封闭的, 如果对于任意1 i,j n,均有(x i,x j)∈S.以 ={y 1,…,y m}表示包含S的最小gcd-封闭的正整数集合. 设(f(x i,x j))表示一个n×n矩阵, 其(i,j)项为f在x i与x j的最大公因子(x i,x j)处的值. 设(f[x i,x j])表示一个n×n矩阵, 其(i,j)项为f在x i与x j的最小公倍数[x i.xj]处的值. 本文证明了: (i) 如果f∈C s ={f:(f*μ)(d)>0, x∈S,d|x},这里f*μ表示f与μ的Dirichlet乘积,μ表示M bius函数,那么 并且(1)取等号当且仅当S=;(ii)如果f为乘法函数,并且 ∈Cs,那么 并且(2)取等号当且仅当S= .不等式(1)和(2)分别改进了Bourque与Ligh在1993年和1995年所得到的结果.     

乘方的指数与其幂的位数的关系

为了探究乘方的指数与其幂的位数的关系,定义了几个有关的新概念,并且证明了两个关于乘方以及进制进位的定理,由此建立起关于乘方以及进制进位的理论体系,其中包括进位理论中判定乘方的指数与其幂的位数是否存在周期规律的判别法,以及进位规律的求解法和四条相关的性质.     

一个问题的争论引发的思考

最近在网上看到这样一个题目：“王师傅是卖鱼的,一斤鱼进价45元,现亏本大甩卖,顾客35元买了一公斤,给了王师傅100元假钱,王师傅没零钱,于是找邻居换了100元.事后邻居存钱过程中发现钱是假的,被银行没收了,王师傅又赔了邻居100,请问王师傅一共亏了多少？”笔者把题目抛给办公室的老师们：谢老师：“55＋65＋100.”     

数的蒙蔽与形的误导

数与形是一个数学问题的两个层面,数能精细,形可直观,但同学们也须注意,如果你在解题时,出现了疏漏,数也可能出现貌似精细的蒙蔽,形也可以导致似乎明了的误导.本文通过两个典型例子,提醒同学们在学习     

计算Hamilton矩阵特征值的一个稳定的有效的保结构的算法

提出了一个稳定的有效的保结构的计算Hamilton矩阵特征值和特征不变子空间的算法,该算法是由SR算法改进变形而得到的。在该算法中,提出了两个策略,一个叫做消失稳策略,另一个称为预处理技术。在消失稳策略中,通过求解减比方程和回溯彻底克服了Bunser Gerstner和Mehrmann提出的SR算法的严重失稳和中断现象的发生,两种策略的实施的代价都非常低。数值算例展示了该算法比其它求解Hamilton矩阵特征问题的算法更有效和可靠。     

逆周期的交换半群生成的簇的子簇

In this paper, all subvarieties of the varieties Ak （k ∈N） generated by aperiodic commutative semigroups are characterized. Based on this characterization, the structure of lattice of subvarieties of Ak is investigated.     

自由群的直积的检验元素的注记

本文研究了自由群的直积的检验元素,通过对直积的自同态的分解,得到了直积中的元素为检验元素的充分必要条件,改进了O'neill和Turner的结果.此外,构造了两类具体的检验元素.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

Unimodality of independence polynomials of the incidence product of graphs

Given two graphs $G$ and $H$, assume that $V\left(G\right)=\{v_1,v_2,\dots ,v_n\}$ and $U$ is a subset of $V\left(H\right)$. We introduce a new graph operation called the incidence product, denoted by $G\odot H^U$, as follows: insert a new vertex into each edge of $G$, then join with edges those pairs of new vertices on adjacent edges of $G$. Finally, for every vertex $v_i\in V\left(G\right)$, replace it by a copy of the graph $H$ and join every new vertex being adjacent to $v_i$ to every vertex of $U$. It generalizes the line graph operation. We prove that the independence polynomial

$I\left(G\odot H^U;x\right)=I^n(H;x)M\left(G;\frac{x{I}^2(H?U;x)}{I^2(H;x)}\right),$

where $M(G;x)$ is its matching polynomial. Based on this formula, we show that the incidence product of some graphs preserves symmetry, unimodality, reality of zeros of independence polynomials. As applications, we obtain some graphs so-formed having symmetric and unimodal independence polynomials. In particular, the graph $Q\left(G\right)$ introduced by Cvetkovi?, Doob and Sachs has a symmetric and unimodal independence polynomial.     

22号初等元胞自动机的极限语言复杂性

§1Introduction Thetaskofthispaperistosolvetheproblemproposedin[1],i.e.,toexplorethe complexityoflimitset,orequivalently,limitlanguageoftheelementarycellularautomaton ofrule22bythetoolsofformallanguagetheory.Cellularautomata(abbreviatedasCA),asmathematicalmodelsforcomplexnatural systemscontaininglargenumbersofsimpleidenticalcomponentswithlocalinteractions,havebeenwidelyusedinphysical,biological,chemicalandcomputationalsystems[2].Despitetheirsimpleconstruction,someCAcandisplayveryrichandcompl…     

Partial cohomology of groups and extensions of semilattices of abelian groups

We extend the notion of a partial cohomology group $H^n(G,A)$ to the case of non-unital A and find interpretations of $H^1(G,A)$ and $H^2(G,A)$ in the theory of extensions of semilattices of abelian groups by groups.     

Admissibility of estimators of the probability of unobserved outcomes

The problem of estimating the probability of unobserved outcomes or, as it is sometimes called, the conditional probability of a new species, is studied. Good's estimator, which is essentially the same as Robbins' estimator, namely the number of singleton species observed divided by the sample size, is studied from a decision theory point of view. The results obtained are as follows: (1) When the total number of different species is assumed bounded by some known number, Good's and Robbins' estimators are inadmissible for squared error loss. (2) If the number of different species can be infinite, Good's and Robbins' estimators are admissible for squared error loss. (3) Whereas Robbins' estimator is a UMVUE for theunconditional probability of a new species obtained in one extra sample point, Robbins' estimator is not a uniformly minimum mean squared error unbiased estimator of the conditional probability of a new species. This answers a question raised by Robbins. (4) It is shown that for Robbins' model and squared error loss, there are admissible Bayes estimators which do not depend only on a minimal sufficient statistic. A discussion of interpretations and significance of the results is offered. Research supported by NSF Grant DMS-88-22622.     

Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs

Consider two graphs $G$ and $H$. Let $H^k\left[G\right]$ be the lexicographic product of $H^k$ and $G$, where $H^k$ is the lexicographic product of the graph $H$ by itself $k$ times. In this paper, we determine the spectrum of $H^k\left[G\right]$ and $H^k$ when $G$ and $H$ are regular and the Laplacian spectrum of $H^k\left[G\right]$ and $H^k$ for $G$ and $H$ arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic powers of regular graphs, and to the algebraic connectivity and the largest Laplacian eigenvalues in the case of lexicographic powers of arbitrary graphs. This approach allows the determination of the spectrum (in case of regular graphs) and Laplacian spectrum (for arbitrary graphs) of huge graphs. As an example, the spectrum of the lexicographic power of the Petersen graph with the googol number (that is, 10¹⁰⁰ ) of vertices is determined. The paper finishes with the extension of some well known spectral and combinatorial invariant properties of graphs to its lexicographic powers.