退化时滞微分系统的特征根分布与指数稳定

该文首先研究了退化时滞微分系统的特征根分布, 指出如果退化时滞微分系统的所有特征根都具有负实部, 在一个条件下, 特征根的负实部的最大值为负.由此可以得到一个条件, 在该条件下如果所有特征根都具有负实部, 则退化时滞微分系统的解是指数稳定的.作为例子, 对中立型给出其解为指数稳定的条件.     

On the Location of Roots of Graph Polynomials

Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph theoretic properties of the underlying graph.     

Schanuel's Conjecture and Algebraic Roots of Exponential Polynomials

In this article, I will prove that assuming Schanuel's conjecture, an exponential polynomial with algebraic coefficients can have only finitely many algebraic roots. Furthermore, this proof demonstrates that there are no unexpected algebraic roots of any such exponential polynomial. This implies a special case of Shapiro's conjecture: if p(x) and q(x) are two exponential polynomials with algebraic coefficients, each involving only one iteration of the exponential map, and they have common factors only of the form exp (g) for some exponential polynomial g, then p and q have only finitely many common zeros.     

On the Genus of the Nilpotent Graphs of Finite Groups

The nilpotent graph of a group G is a simple graph whose vertex set is G?nil(G), where nil(G) = {y ∈ G | ? x, y ? is nilpotent ? x ∈ G}, and two distinct vertices x and y are adjacent if ? x, y ? is nilpotent. In this article, we show that the collection of finite non-nilpotent groups whose nilpotent graphs have the same genus is finite, derive explicit formulas for the genus of the nilpotent graphs of some well-known classes of finite non-nilpotent groups, and determine all finite non-nilpotent groups whose nilpotent graphs are planar or toroidal.     

On the group of polynomial functions in a group

Let G be a group and let n be a positive integer. A polynomial function in G is a function from G ⁿ to G of the form , where f(x ₁, . . . , x _n ) is an element of the free product of G and the free group of rank n freely generated by x ₁, . . . , x _n . There is a natural definition for the product of two polynomial functions; equipped with this operation, the set of polynomial functions is a group. We prove that this group is polycyclic if and only if G is finitely generated, soluble, and nilpotent-by-finite. In particular, if the group of polynomial functions is polycyclic, then necessarily it is nilpotent-by-finite. Furthermore, we prove that G itself is polycyclic if and only if the subgroup of polynomial functions which send (1, . . . , 1) to 1 is finitely generated and soluble.      

On the Roots of Expected Independence Polynomials

The independence polynomial of a (finite) graph is the generating function for the number of independent sets of each cardinality. Assuming that each possible edge of a complete graph of order n is independently operational with probability p, we consider the expected independence polynomial. We show here that for all fixed , the expected independence polynomials of complete graphs have all real, simple roots.     

On an Asymptotic Behavior of Exponential Functional Equation

The stability problems of the exponential （functional） equation on a restricted domain will be investigated, and the results will be applied to the study of an asymptotic property of that equation. More precisely, the following asymptotic property is proved： Let X be a real （or complex） normed space. A mapping f ： X → C is exponential if and only if f（x ＋ y） - f（x）f（y） → 0 as ｜｜x｜｜ ＋ ｜｜y｜｜ → ∞ under some suitable conditions.     

On the Location of Roots of Independence Polynomials

The independence polynomial of a graph G is the function i(G, x) = _k0 i _k x ^k, where i _k is the number of independent sets of vertices in G of cardinality k. We prove that real roots of independence polynomials are dense in (–, 0], while complex roots are dense in , even when restricting to well covered or comparability graphs. Throughout, we exploit the fact that independence polynomials are essentially closed under graph composition.     

关于指数丢番图方程a~x+b~y=c~z的Terai猜想

本文证明了:当a=|m(m4-10m2+)|,b=5m4-10m2+1,c=m2+1,其 中m是偶数时,如果m≥542,则方程ax+by=cz仅有正整数解(x,y,z)=(2,2,5).     

On the Relative Commutativity Degree of a Subgroup of a Finite Group

The aim of this article is to give a generalization of the concept of commutativity degree of a finite group G (denoted by d(G)), to the concept of relative commutativity degree of a subgroup H of a group G (denoted by d(H, G)). We shall state some results concerning the new concept which are mostly new or improvements of known results given in Gustafson (1973 Gustafson , W. H. ( 1973 ). What is the probability that two group elements commute? Amer. Math. Monthly 80 : 1031 – 1304 .[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) and Moghaddam et al. (2005 Moghaddam , M. R. R. , Chiti , K. , Salemkar , A. R. ( 2005 ). n-Isoclinism classes and n-nilpotency degree of finite groups . Algebra Colloquium 12 ( 2 ): 225 – 261 . [Google Scholar]). Moreover, we shall define the relative nth nilpotency degree of a subgroup of a group and give some results concerning this at the end of the article.     

给定零点的指数型整函数Ⅱ

研究了如下问题:给定右半平面一复数列,以该复数列为零点的指数型整函数在虚轴上的增长性有什么表现?并给出了完整的解答.这是对Malliavin和Rubel关于给定右半平面一复数列为零点的指数型整函数性质的研究工作的一个推广.     

连续型指数差分布

本文提出了一个连续型随机变量的概率分布:指数差分布。讨论了该分布的极值、拐点、数学期望和方差,推导了参数的矩估计公式,探讨了该分布与指数分布的关系,给出了该分布在药代动力学中的应用。     

On the Computation of Square Roots in Finite Fields

In this paper, two improvements for computing square roots in finite fields are presented. Firstly, we give a simple extension of a method by O. Atkin, which requires two exponentiations in FM _q , when q9 mod 16. Our second method gives a major improvement to the Cipolla–Lehmer algorithm, which is both easier to implement and also much faster. While our method is independent of the power of 2 in q–1, its expected running time is equivalent to 1.33 as many multiplications as exponentiation via square and multiply. Several numerical examples are given that show the speed-up of the proposed methods, compared to the routines employed by Mathematica, Maple, respectively Magma.     

On the Average Number of Unitary Factors of Finite Abelian Groups (II)

Let t(G) be the number of unitary factors of finite abelian group G. In this paper we prove T(x)=∑ _|G|≤x t(G) = main terms for any exponent pair (κ1/2 + 2κ), which improves on the exponent 9/25 obtained by Xiaodong Cao and the author. Received December 8, 1998, Revised April 27, 1998, Accepted June 12, 1998     

关于有限阿贝尔群单因子个数的均值(Ⅱ)

令ｔ（Ｇ）为有限阿贝尔群Ｇ的单因子个数．本文得到了∑｜Ｇ｜≤ｘｔ（Ｇ）带有更好余项的渐近公式．     

On the Connectivity of Proper Power Graphs of Finite Groups

We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a nontrivial partition, and symmetric and alternating groups. Also, for such a group, the corresponding proper power graph has diameter at most 26 whenever it is connected.     

指数丢番图方程a~x+b~y=c~z

设a=|m(m~4-10m~2+5)|,b=5m~4-10m~2+1,c=m~2+1,其中m是正偶数。利用Bilu,Hanrot和Voutier关于本原素除子的深刻结果,证明了指数丢番图方程a~x+b~y=c~z仅有正整数解(x,y,z)=(2,2,5)。