一类板材下料计量问题

一张矩形铝板,需要冲压（剪裁）成一定规格的板料．问如何下料才能使得铝板的利用率最高？这是一类矩形薄板下料的计量问题．问题的数学提法是：一个平面图形（矩形）面积为Ｓ,需要无重叠地、完整地放入面积为Ａ的某种规格的纸片．设放入纸片的个数为ｎ,求ｎ的最大值．显然ｎ≤［ＳＡ］．其中［ｘ］表示不超过ｘ的最大整数．至于ｎ的最大值能否达到［ＳＡ］,这与纸片形状有关．因此,要设计一种实现ｎ＝［ＳＡ］的方案或者给出ｎ≠［ＳＡ］的证明,然后再验证ｎ能否达到［ＳＡ］－１．这样依次验证下去,总可以找到ｎ的最大值．以上给出…     

一类特殊函数的[n/n]Padé逼近

本文对［ｎ／ｎ］Ｐａｄé逼近进行探讨，证明了Ｐｎ（ｘ）／Ｑｎ（ｘ）是函数ｆ（ｘ）在ｘ＝０处的［ｎ／ｎ］Ｐａｄé逼近，而Ｑｎ（ｘ）＝Ｐｎ（－ｘ）的充要条件是ｆ（ｘ）ｆ（－ｘ）＝１，从而使这一类函数的［ｎ／ｎ］Ｐａｄé逼近计算量减少一半．     

T(t)积分半群

本文引入Ｔ（ｔ）积分半群的概念，它是ｎ次积分半群［１］及α次积分半群［２］的推广．我们给出Ｔ（ｔ）积分半群的定义、生成定理，并讨论相应的一类积分型抽象Ｃａｕｃｈｙ问题解的存在唯一性．     

一类高幂次的三角数列求和公式

一类高幂次的三角数列求和公式徐和郁（浙江普陀中学３１６１００）本文将给出一系列关于正、余弦的高幂次的三角数列的求和公式．先引入两个引理．引理１ｃｏｓｎθ＝１２ｎ∑ｎｋ＝０Ｃｋｎｃｏｓ（ｎ－２ｋ）θ（ｎ∈Ｎ）．证明见文［１］．引理２∑ｎ－１ｔ＝０ｃｏｓ...     

关于一类色散型发展方程反问题的一个注记

关于一类色散型发展方程反问题的一个注记宋守根（中南工业大学地质系，长沙４１００８３）文献［１］利用Ｃ０半群理论研究一类非线性色散型方程的反问题．其中ｎ是Ｒ”中具有光滑边界ｏｆｆ的有界区域，面是ｎ维Ｌａｐｌａｃｅ算子，而算子Ｌ０为本文将改进［１］的一个...     

A New Class of Generalized Landau Linear Positive Operator Sequence and Its Properties of Approximation

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎ１９０８，Ｅ．Ｌａｎｄａｕｉｎｔｒｏｄｕｃｅｄｔｈｅｆｏｌｌｏｗｉｎｇｗｅｌｌｋｎｏｗｎｓｅｑｕｅｎｃｅｏｆｏｐｅｒａｔｏｒｓ［１］Ｌｎ［ｆ（ｔ）；ｘ］＝Ｋｎ∫１－１ｆ（ｔ）［１－（ｔ－ｘ）２］ｎｄｔ，　　　　（１．１）ｗｈｅｒｅ　　　　　Ｋｎ＝［∫１｛－１（１－ｔ２）ｎｄｔ］－１～ｎπ　　（ｎ→∞）．（１．１）ｗａｓｕｓｅｄｉｎｔｈｅｐｒｏｏｆｏｆｔｈｅＷｅｉｅｒｓｔｒａｓｓＴｈｅｏｒｅｍ．Ｓｉｎｃｅｔｈｅｎ，ｔｈｅａｐｐｒｏｘｉｍａｔｉｏｎｐｒｏｐ－ｅｒｔ…     

一类时变大系统的区间矩阵平稳振荡

一类时变大系统的区间矩阵平稳振荡王美娟（上海机械学院基础部，上海２０００９３）在文献［１］中，我们讨论了具有分解的大系统的区间矩阵平稳振荡问题．其中Ａｓｓ为ｎｓ×ｎｓ阶实常量矩阵．平均法是用来解决时变系统问题的很有成效的一种方法．它使我们有可能从常数...     

数据插值和共轭函数

设Ｇ（ｚ）在｜ｚ｜＜ρ（ρ＞１）中解析，且数据Ｒｅ［Ｇ（ｅｊ２ｋπ／ｎ）］；ｋ＝０，１，…，ｎ－１已给出，其中ｎ＝２ν＋１，本文构造了一个ν次多项式Ｐν（ｚ）满足插值条件Ｒｅ［Ｐν（ｅｊ２ｋπ／ｎ）］＝Ｒｅ［Ｇ（ｅｊ２ｋπ／ｎ）］，ｋ＝０，１，…，ｎ－１．并估计了误差‖Ｇ（ｅｊω）－Ｐν（ｅｊω）‖．此外，还给出了一个Ｗａｌｓｈ类型的超收敛定理．     

正星形的几个判定定理

正星形的几个判定定理熊曾润宋方钦（江西赣南师范学院３４１０００）由单独一条平面闭折线组成的正星形，是一种非常优美的图形，它们具有许多美妙的性质（见［１］与［２］）．这种图形的定义是（图１）定义１将圆ｎ等分（如图１），从任一分点开始，顺次连结相隔ｍ个分...     

平面封闭折线中的射影定理,正弦定理和余弦定理

本文将三角形的射影定理、正弦定理和余弦定理，拓广到平面封闭折线中，从而揭示其基本元素——边与折角之间的恒等关系．文中的有关概念（如折角、顶角），可参阅［１］［２］文．定理设ｎ边平面封闭折线Ａ１Ａ２…Ａｎ的边长为｜Ａ１Ａ２｜＝ａ１，｜Ａ２Ａ３｜＝ａ２，...     

(En)系统极限环的相对位置

本文证明了，对任意正整数K，存在平面n次系统，它具有一串不少于K个大极限环．这些大极限环两两之间各有若干小极限环．     

Large Induced Forests in Triangle-Free Planar Graphs

Given a planar graph G, what is the largest subset of vertices of G that induces a forest? Albertson and Berman [2] conjectured that every planar graph has an induced subgraph on at least half of the vertices that is a forest. For bipartite planar graphs, Akiyama and Wanatabe [1] conjectured that there is always an induced forest of size at least 5n/8. Here we prove that every triangle-free (and therefore every bipartite) planar graph on n vertices has an induced forest of size at least (17n+24)/32.     

BIFURCATIONS OF LIMIT CYCLES FORMING COMPOUND EYES IN THE CUBIC SYSTEM

Let H(n)be the maximal number of limit cycle of planar real polynomial differentialsystem with the degree n and C_m~k denote the nest of k limit cycles enclosing m singular points.By computing detection functions,tne authors study bifurcation and phase diagrams in theclass of a planar cubic disturbed Hamiltonian system.In particular,the following conclusionis reached:The planar cubic system(E_ε)has 11 limit cycles,which form the pattern ofcompound eyes of C_9~1(?)2[C'~ε(?)(2C_1~2)and have the symmetrical structure;so the Hilbertnumber H(3)≥11.     

More About 4-Isosceles Planar Sets

A finite planar set is k-isosceles for k 3 if every k-point subset of the set contains a point equidistant from the other two. In [1] Fishburn obtains several important results about isosceles planar sets and poses a series of conjectures and open questions. We disprove Conjecture 1 in [1] and provide another 34 nonsimilar 4-isosceles 8-point planar sets which answer one of the open questions in [1] negatively.     

Approximation of the function sign x in the uniform and integral metrics by means of rational functions

Estimates are obtained for the nonsymmetric deviations R_n [sign x] and R_n [sign x]_L of the function sign x from rational functions of degree ≤n, respectively, in the metric $$c([ - 1, - \delta ] \cup [\delta ,1]), 0< \delta< exp( - \alpha \surd \overline n ), \alpha > 0,$$ and in the metric L[?1, 1]: $$\begin{gathered} R_n [sign x] _{\frown }^\smile exp \{ - \pi ^2 n/(2 ln 1/\delta )\} , n \to \infty , \hfill \\ 10^{ - 3} n^{ - 2} \exp ( - 2\pi \surd \overline n )< R_n [sign x_{|L}< \exp ( - \pi \surd \overline {n/2} + 150). \hfill \\ \end{gathered} $$ Let 0 < δ < 1, Δ (δ)=[?1, ? δ] ∪ [δ, 1]; $$\begin{gathered} R_n [f;\Delta (\delta )] = R_n [f] = inf max |f(x) - R(x)|, \hfill \\ R_n [f;[ - 1,1] ]_L = R_n [f]_L = \mathop {inf}\limits_{R(x)} \smallint _{ - 1}^1 |f(x) - R(x)|dx, \hfill \\ \end{gathered} $$ where R(x) is a rational function of order at most n. Bulanov [1] proved that for δ ε [e^?n, e^?1] the inequality $$\exp \left( {\frac{{\pi ^2 n}}{{2\ln (1/\delta }}} \right) \leqslant R_n [sign x] \leqslant 30 exp\left( {\frac{{\pi ^2 n}}{{2\ln (1/\delta + 4 ln ln (e/\delta ) + 4}}} \right)$$ is valid. The lower estimate in this inequality was previously obtained by Gonchar ([2], cf. also [1]).     

Cycle Covers of Planar 2-Edge-Connected Graphs

A graph with n vertices is said to have a small cycle cover provided its edges can be covered with at most (2n ? 1)/3 cycles. Bondy [2] has conjectured that every 2-connected graph has a small cycle cover. In [3] Lai and Lai prove Bondy’s conjecture for plane triangulations. In [1] the author extends this result to all planar 3-connected graphs, by proving that they can be covered by at most (n + 1)/2 cycles. In this paper we show that Bondy’s conjecture holds for all planar 2-connected graphs. We also show that all planar 2-edge-connected graphs can be covered by at most (3n ? 3)/4 cycles and we show an infinite family of graphs for which this bound is attained.     

一类具细焦点的三次系统极限环的唯一性

继续相关文献的工作,给出与二次系统Ⅰ相伴的一类三次系统在奇点N(0,1/n)的焦点量公式,证明了系统在细焦点N外围至多有一个极限环,同时证明了当N或O为细焦点时,系统在另一个焦点外围无极限环,结合相关文献的结论,说明了具有细焦点的该系统在全平面至多有一个极限环.     

Number and Location of Limit Cycles in a Class of Perturbed Polynomial Systems

In this paper,we investigate the number,location and stability of limit cycles in a class of perturbedpolynomial systems with (2n 1) or (2n 2)-degree by constructing detection function and using qualitativeanalysis.We show that there are at most n limit cycles in the perturbed polynomial system,which is similar tothe result of Perko in [8] by using Melnikov method.For n=2,we establish the general conditions dependingon polynomial's coefficients for the bifurcation,location and stability of limit cycles.The bifurcation parametervalue of limit cycles in [5] is also improved by us.When n=3 the sufficient and necessary conditions for theappearance of 3 limit cycles are given.Two numerical examples for the location and stability of limit cycles areused to demonstrate our theoretical results.     

List 2-facial 5-colorability of plane graphs with girth at least 12

A proper vertex coloring of a plane graph is 2-facial if any two different vertices joined by a facial walk of length 2 are colored differently, and it is 2-distance if every two vertices at distance 2 from each other are colored differently. Note that any 2-facial coloring of a subcubic graph is 2-distance.It is known that every plane graph with girth at least 14 has a 2-facial 5-coloring [M. Montassier, A. Raspaud, A note on 2-facial coloring of plane graphs. Inform. Process. Lett. 98 (6) (2006) 235–241], and that every planar subcubic graph with girth at least 13 has a list 2-distance 5-coloring [F. Havet, Choosability of square of planar subcubic graphs with large girth, Discrete Math. 309 (2009) 3353–3563].We strengthen these results by proving the list 2-facial 5-colorability of plane graphs with girth at least 12.     

Arithmetic properties of the values of a set of functions satisfying a system of differential equations

General results were presented in [2] and [3] concerning arithmetic properties of the values at algebraic points of a class of analytic functions satisfying linear differential equations. In the present note we consider the application of these results to the set of functions $$\begin{gathered} ^f (\alpha _k z) = \sum\nolimits_{n = 0}^\infty {\frac{{ \mu (\mu + 1)... (\mu + n - 1) }}{{\lambda (\lambda + 1)... (\lambda + n - 1)}}} (\alpha _k z)^n (k = 1,2,...,m,) \hfill \\ \lambda \ne 0, - 1, - 2,...), \hfill \\ \end{gathered}$$ where α₁, ..., α_m are algebraic numbers; λ and μ are rational numbers; and the functions satisfy a system of linear differential equations.