一类同余方程解数的上界估计

主要研究形如 rⅡi=1(X+m_i)≡2rⅡj=r+1(X+m_j)(mod p~μ)的同余方程关于m=(m_1,…,m_(2r))解数估计问题,并得出当r=4,5时,该同余方程解数的上界估计.前者可改进Dodd的结论,而后者则町应用于对另一类同余方程组解数的上界估计.     

从抽象代数角度谈求解一类多项式同余方程

本文从抽象代数角度讨论了用形式幂级数方法求解一类多项式同余方程的原理,并用交换图直观地展示了证明的思路.     

关于Smarandache函数的一个同余方程

研究了一个包含Smarandache函数S（n）的同余方程的可解性,并利用初等方法及原根的性质得到了该同余方程的所有正整数解,从而解决了相关文献中提出的一个问题.     

序半群的一类正则同余

设S是有向序半群,本文给出了S上的一类正则同余,称为强序同余的定义及性质.证明了S的强序同余是强正则同余,但反之不成立.同时证明了强序同余格SOC(S)是S的同余格C(S)关于通常集合的交和传递积的V-完备的分配子格.     

一类格序半群的同余

本文讨论了一类可换格序半群的同余性质。给出了这类格序半群同余的表示和同态分解定理。这个结论一般化了［１］和［２］中的结果。     

一次同余方程的求解技巧

1　引言一次同余方程形如ax≡ b( mod m) ( 1 )其中 a,b,m都是整数 ,m≠ 0 ,m|a。一次同余方程 ( 1 )有解的充要条件是( a,m) |b ( 2 )当条件 ( 2 )满足时 ,一次同余方程 ( 1 )一共有 ( a,m)个解。并且 ,如果 x0 是 ( 1 )的某一特解 ,则 ( 1 )的全部解是 [1]x =x0 +m( a,m) t( mod m) , ( 3 )其中 t=0 ,1 ,… ,( a,m) -1。因此 ,当一次同余方程有解并且有不只一个解时 ,关键是求出它的一个特解。设 ( a,m) =g,a=a1g,b=b1g,m=m1g则必有 ( a1,m1) =1。此时可以取一次同余方程a1x≡ b1( mod m1) ( 4)的唯一解做 ( 1 )的一个特解 [1]。问题是 ,…     

两类方程亚纯解(n,1)级的上界估计

本文给出Riccati方程及另外一类具有代表性微分方程的亚纯解（n,1)级的上界估计，在一定条件下确立了文[2]中的猜测的正确性。     

Hamilton群的主同余

研究了有限交换群和Hamilton群的主同余,利用同余的定义并构造它们的主同余公式,给出了它们的主同余刻画.     

关于Thue方程的解数

设ｍ是正整数,ｆ（Ｘ,Ｙ）＝ａ０Ｘｎ＋ａ１Ｘ（ｎ－１）Ｙ＋．．．＋ａｎＹｎ∈Ｚ［Ｘ,Ｙ］是Ｑ上不可约化的叫ｎ（ｎ≥３）次齐次多项式。本文证明了：当ｇｃｄ（ｍ,ａ０）＝１,ｎ≥４００且ｍ≥１０（３５）时,方程｜ｆ（ｘ,ｙ）｜＝ｍ,ｘ,ｙ∈ｚ,ｇｃｄ（ｘ,ｙ）＝１,至多有６ｎｖ（ｍ）组解（ｘ,ｙ）,其中ｖ（ｍ）是同余式Ｆ（ｚ）＝ｆ（ｚ,１）≡０（ｍｏｄｍ）的解数。特别是当ｇｃｄ（ｍ,ＤＦ）＝１时,该方程至多有６ｎ（ω（ｍ）＋１）组解（ｘ,ｙ）,其中ＤＦ是多项式Ｆ的判别式,ω（ｍ）是ｍ的不同素因数的个数．     

一类解析函数的三阶Hankel行列式上界估计

主要研究了与对称点有关的一类解析函数M_s(α,μ,A,B)的三阶Hankel行列式H_3(1),得到了该行列式的上界估计.     

Improving an Upper Bound on the Stability Number of a Graph

In previous works an upper bound on the stability number of a graph based on quadratic programming was introduced and several of its properties were given. The graphs for which this bound is attained has been known as graphs with convex-QP stability number. This paper proposes a new upper bound on the stability number whose determination is also done by quadratic programming. It is proved that the new bound improves the above mentioned bound and several computational tests asserting its interest for large graphs are presented. In addition a necessary and sufficient condition for a graph to attain the new bound is proved. As a consequence a graph with convex-QP stability number also attains the new bound. On the other hand it is shown the existence of graphs attaining the new bound that do not belong to the class of graphs with convex-QP stability number. This allows to assert that the class of graphs with convex-QP stability number is strictly included in the class of graphs that attain the introduced bound. Some conclusions and lines for future work finalize the paper.     

An Upper Bound for the Total Domination Subdivision Number of a Graph

A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number γ _t (G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sd_gt(G){{\rm sd}_{\gamma_t}(G)} is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. In this paper, we prove that sd_gt(G) ￡ 2g_t(G)-1{{\rm sd}_{\gamma_t}(G)\leq 2\gamma_t(G)-1} for every simple connected graph G of order n ≥ 3.     

关于规范型拉丁方个数的上界

In this note,the author find an upper bound formula for the number of the p×p normalized Latin Square,the first row and column of which are both standard order 1,2,...,p.     

A Sharp Upper Bound for the Number of Spanning Trees of a Graph

Let G = (V,E) be a simple graph with n vertices, e edges and d₁ be the highest degree. Further let λ_i, i = 1,2,...,n be the non-increasing eigenvalues of the Laplacian matrix of the graph G. In this paper, we obtain the following result: For connected graph G, λ₂ = λ₃ = ... =  λ_n-1 if and only if G is a complete graph or a star graph or a (d₁,d₁) complete bipartite graph. Also we establish the following upper bound for the number of spanning trees of G on n, e and d₁ only:

图的邻点可区别VE-全色数的一个上界

根据图的邻点可区别VE-全染色的定义和性质,用概率方法研究了图的邻点可区别VE-全染色,并给出了图的邻点可区别VE-全色数的一个上界.如果δ≥7且△≥25,则有x_at^ue（G）≤7△,其中δ是图G的最小度,△是图G的最大度.     

一类可积非哈密顿系统的极限环数目的上界

研究了一类可积非哈密顿系统的极限环的上界,利用Abel积分证明其在一类2n+1次多项式扰动下至多可以产生n+1个极限环,并且是可以实现的.     

An Upper Bound for the Total Restrained Domination Number of Graphs

Let G be a graph with vertex set V. A set ${D \subseteq V}$ is a total restrained dominating set of G if every vertex in V has a neighbor in D and every vertex in ${V \setminus D}$ has a neighbor in ${V \setminus D}$ . The minimum cardinality of a total restrained dominating set of G is called the total restrained domination number of G, and is denoted by γ _tr (G). In this paper, we prove that if G is a connected graph of order n ≥ 4 and minimum degree at least two, then ${\gamma_{tr}(G) \leq n-\sqrt[3]{n \over 4}}$ .     

Improved Upper Bound for Generalized Acyclic Chromatic Number of Graphs

A vertex coloring of a graph G is called r-acyclic if it is a proper vertex coloring such that every cycle D receives at least min{|D|, r} colors. The r-acyclic chromatic number of G is the least number of colors in an r-acyclic coloring of G. We prove that for any number r ≥ 4, the r-acyclic chromatic number of any graph G with maximum degree Δ ≥ 7 and with girth at least (r ? 1)Δ is at most (4r ? 3)Δ.