三类与Riemann Zeta函数有关的级数的求和公式

本文采用组合数学的方法,利用第二类Ｓｔｉｒｌｉｎｇ数和Ｂｅｒｎｏｕｌｌｉ数给出级数∑∞ｋ＝２ｋ＾ｍξ（２ｋ）及∑∞ｋ＝１（２ｋ＋１）＾ｍξ（２ｋ＋１）其中ｍ≥１,ξ（ｘ）＝ξ（ｘ）－１）的求和公式。这些公式表述简洁并有鲜明的规律性。     

n阶时滞差分方程的边值问题

本文研究ｎ阶时滞差分方程的边值问题：ｘ（ｋ＋ｎ）＝ｆ（ｋ，ｘｋ（），ｘ（ｋ），ｘ（ｋ＋１），…，ｘ（ｋ＋ｎ－１）），ｋ∈ＩＴ，ｘ（ｍ）＝φ（ｍ），ｍ∈Ｉ－ｒ，ｘ（１）＝ａ１，ｘ（２）＝ａ２，…，ｘ（ｎ－２）＝ａｎ－２，ｘ（Ｔ）＝Ａ，｛得到了解的存在性和唯一性的结果．     

求双曲线的渐近线的策略和公式

求双曲线的渐近线的策略和公式罗万才（湖南湘潭师范４１１２０４）双曲线ｍ２ｘｗ—ｎ２ｙ２＝ｋ（ｋ≠０）与其渐近线。ｍ２ｘ２—ｎ２ｙ２＝０的方程结构相近，仅是常数项不同（＊）．由此联想问题：（１）双曲线Ｌ：ｆ（ｘ，ｙ）＝Ａｘ２＋Ｂｘｙ＋Ｃｙ２＋ＤＸ＋Ｅｙ...     

利用尺度函数寻求常微分方程的近似解

论的结论是：设ｍ－１阶线性常微分方程的一般形式为ｄ＾ｍ－１ｕｄｘ＾ｍ－１＋ａ１（ｘ）ｄ＾ｍ－２ｕｄｘ＾ｍ－２＋…＋ａｍ－２（ｘ）ｄｕｄｘ＋ａｍ－１（ｘ）ｕ＝ｆ（ｘ）那么,当限定ｘ∈「０,１」时,它的近似解为ｕＮ（ｘ）＝∑２＾Ｎ－１ｋ＝－ｍ＋１ｃ＾ＮｋＮｍ（２＾Ｎｘ－ｋ）其中,ｍ≥２,Ｎｍ是ｍ阶样条函数。ｃ＾Ｎｋ是待定常数,它由ｍ－１个定解条件和导出等式产生的２＾Ｎ个条件决定。     

整距点的性质和计数公式

整距点的性质和计数公式３１６２００浙江岱山县岱山中学张善立定理１（性质定理）如果（ｘ１，ｘ２，ｘ３）是匈股形整距点，则当（１）ｘ１＇＝ｘ１＋ｎ，ｘ２＇＝ｘ２一ｍ＞０，ｘ。’＝ｘ。－ｎ；或（２）ｘ；’＝ｘ；＋ｍ，ｘ。’＝ｘ。＋ｎ，ｘ。’＝ｘ。一ｍ＞０时...     

区间上平顶单峰扩张自映射的周期轨道

设ｔ（０＜ｔ＜１）是一个常数，ｎ≥３是奇数，ｍ≥０及ｋ≥１是整数，Ｐ０（ｘ）＝ｘ－１，Ｐｉ（ｘ）＝（ｘ２ｉ－１－１）Ｐｉ－１（ｘ）（ｉ≥１），ｒｍｎ（ｔ）及ｒｋ（ｔ）分别是方程Ｐｍ（ｘ）（ｘ２ｍｎ－２ｘ２ｍ（ｎ－２）－１）－ｔ（ｘ２ｍｎ－１）（ｘ２ｍ＋１）＝０及Ｐｋ－１（ｘ）－ｔ（ｘ２ｋ－１＋１）＝０在（１，＋∞）上的唯一实根，ｆ是闭区间Ｉ＝［０，１］上的峰顶区间长度为ｔ的平顶单峰扩张自映射．本文证明了，若ｆ的扩张常数λ≥ｒｍｎ（ｔ）（或＞ｒｋ（ｔ）），，则ｆ有２ｍｎ（或２ｋ）周期点．此外，本文还指出，当１＜λ＜ｒｍｎ（ｔ）（或≤ｒｋ（ｔ）时，在Ｉ上存在着具有扩张常数λ及峰顶区间长度ｔ却无２ｍｎ（或２ｋ）周期点的平顶单峰扩张自映射     

亚纯函数的幅角分布及其增长性

本文考虑了亚纯函数的幅角分布及其增长性的关系，得到了如下定理：设ｆ（ｚ）为亚纯函数，下级μ（μ〈＋∞，ａｒｇｚ＝θｋ（ｋ＝１，２，…，ｑ；０≤θ１〈θ２〈…〈θｑ〈２π，θｑ＋１＝θ１＋２π）为ｑ（１≤ｑ〈＋∞）条半直线使对Ａ↓ε〉０有：ｌｉｍｒ→∞↑－ｌｏｇ＋ｎ↑－（∪ｋ＝１↑ｑΩ↑－（θｋ＋ε，θｋ＋１－ε；ｒ），ｆ＝ｘ）／ｌｏｇｒ≤ρ〈＋∞ ｘ＝０，∞则当存在一非负整数ｌ使ｆ＾（ｌ）（ｚ）（     

关于分圆域及其最大实子域的类数的上界

设ｍ是适合ｍ≠２（ｍｏｄ４）的正整数，ζｍ是ｍ次本原单位根，又设△ｋ，ｈｍ分别是分圆域Ｋ＝Ｑ（ζｍ）的判别式和类数，本文证明了：当ψ（ｍ）≥２２０时，ｈｍ〈４２３ｗｍＱｍ√△ｋ／（１９．４７）其中ψ（ｍ）是ｍ的Ｅｕｌｅｒ函数ｗｍ是Ｋ中单位根的人数，当ｍ是素数方幂时，Ｑｍ＝１否则Ｑｍ＝２由此可推知：当奇素数Ｐ≥２２３时，ｈｐ〈３６ｐ＾７．５（ｐ／２１．６）＾（ｐ－２）／２     

两个不等式的简捷证法

下面给出的两类不等式问题,一般是通过代换的方法证明．本文给出直接简捷的证明．命题１　设ｘｉ∈Ｒ＋（ｉ＝１,２,…,ｎ）且ｘ２１１＋ｘ２１＋ｘ２２１＋ｘ２２＋…＋ｘ２ｎ１＋ｘ２ｎ＝ａ（０＜ａ＜ｎ）,求证：ｘ１１＋ｘ２＋ｘ２２１＋ｘ２２＋…＋ｘ２ｎ１＋ｘ２ｎ≤ａ（ｎ－ａ）①证　由题设易知：１１＋ｘ２１＋１１＋ｘ２２＋…＋１１＋ｘ２ｎ＝ｎ－ａ．由于　１１＋ｘ２ｋ＋ｎ－ａａ·ｘ２ｋ１＋ｘ２ｋ　　≥２１１＋ｘ２ｋ·ｎ－ａａ·ｘ２ｋ１＋ｋ２ｋ　　＝２ｎ－ａａ·ｘｋ１＋ｘ２ｋ）（ｋ＝１,２,…,ｎ）,此ｎ式相…     

面积为2π[m（m＋1）＋2]的广义极小浸入球面

本文主要利用Ｐｌｕｃｋｅｒ公式，通过若干引理和命题，证明了全体具有面积为Ａ（ｘ）＝２π［ｍ（ｍ＋１）＋２］的广义极小满浸入ｘ：Ｓ＾２→Ｓ＾２ｍ构成的等价类空间微分同胚于齐性空间Ｇ＝ＳＯ（２ｍ＋１，Ｃ）／ＳＯ（２ｍ＋１，Ｒ）。     

关于亲和数的一个注记

本文研究了一类整数序列(2n)2n 1的某些性质,利用费玛数和数论函数的某些性质,获得了验证此类整数是否是亲和数和完全数的方法,既不与其他正整数构成亲和数对也不是完全数.     

The Pseudoachromatic Number of a Graph

The pseudoachromatic number of a graph G is the maximum size of a vertex partition of G (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there is at least one edge of G. This parameter is determined for graphs such as cycles, paths, wheels, certain complete multipartite graphs, and for other classes of graphs. Some open problems are raised.AMS Subject Classification (1991): primary 05C75 secondary 05C85     

Weak Hausdorff Gaps and the 𝔭 ≤ t Problem

We find topological characterizations of the pseudointersection number ?? and the tower number t of the real line and we show that ?? < t iff there exists a compact separable T₂ space X of π-weight < ?? that can be covered by < t nowhere dense sets iff there exists a weak Hausdorff gap of size K < t, i. e., a pair ({A : i ≠ k}, {B_J : j ε K}) C [W]^W X [U]W such that A = {A_i : i ε K} is a decreasing tower, B = {B_j : j ε K) is a family of pseudointersections of A, and there is no pseudointersection S of A meeting each member of B in an infinite set.     

Remarks on restrained domination and total restrained domination in graphs

The restrained domination number ^r(G) and the total restrained domination number _t ^r (G) of a graph G were introduced recently by various authors as certain variants of the domination number (G) of (G). A well-known numerical invariant of a graph is the domatic number d(G) which is in a certain way related (and may be called dual) to (G). The paper tries to define analogous concepts also for the restrained domination and the total restrained domination and discusses the sense of such new definitions.This research was supported by Grant MSM 245100303 of the Ministry of Education, Youth and Sports of the Czech Republic.     

关于调和数的一个结论

设n是大于1的正常数,并且设n=pα11p2α2…ptαt,其中pi为素数,i=1,2,…,t,ω(n)表示n的不同素因子的个数,即ω(n)=t.若n的所有因子的倒数和为整数,即0≤∑ij≤αjj=1,2,…,t1p1i1pi22…ptit为整数,称n是调和数.证明了和调和数相关的一个结论.     

The upper traceable number of a graph

For a nontrivial connected graph G of order n and a linear ordering s: v ₁, v ₂, …, v _n of vertices of G, define . The traceable number t(G) of a graph G is t(G) = min{d(s)} and the upper traceable number t ⁺(G) of G is t ⁺(G) = max{d(s)}, where the minimum and maximum are taken over all linear orderings s of vertices of G. We study upper traceable numbers of several classes of graphs and the relationship between the traceable number and upper traceable number of a graph. All connected graphs G for which t ⁺(G) − t(G) = 1 are characterized and a formula for the upper traceable number of a tree is established. Research supported by Srinakharinwirot University, the Thailand Research Fund and the Commission on Higher Education, Thailand under the grant number MRG 5080075.     

On the relations of graph parameters and its total parameters

In this paper we get some relations between α（G）, α＇（G）, β（G）, β＇（G） and αT（G）, βT（G）. And all bounds in these relations are best possible, where α（G）, α＇（G）,/3（G）, β（G）, αT（G） and βT（G） are the covering number, edge-covering number, independent number, edge-independent number （or matching number）, total covering number and total independent number, respectively.     

A Note on the Bondage Number of a Graph

ＡＮｏｔｅｏｎｔｈｅＢｏｎｄａｇｅＮｕｍｂｅｒｏｆａＧｒａｐｈ￥ＬｉＹｕｑｉａｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＧｕａｎｇｚｈｏｕＴｅａｃｈｅｒ＇ｓＣｏｌｌｅｇｅ）Ａｂｓｔｒａｃｔ：Ｔｈｅｂｏｎｄａｇｅｎｕｍｂｅｒｂ（Ｇ）ｏｆａｇ...     

Rainbow Numbers for Cycles with Pendant Edges

A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f (n, H) is the maximum number of colors in an edge-coloring of K _n with no rainbow copy of H. The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of K _n with rb(n, H) number of colors contains a rainbow copy of H. Certainly rb(n, H) = f(n, H) + 1. Anti-Ramsey numbers were introduced by Erdős et al. [4] and studied in numerous papers. We show that for n ≥ k + 1, where C _k ⁺ denotes a cycle C _k with a pendant edge.