A Note on the Recursive Sequence x n + 1 = p k x n + p k − 1 x n − 1 +...+ p 1 x n − k + 1

We present some comments on the behavior of solutions of the difference equation where p _i 0, i = 1,..., k, k N, and x _–k ,..., x _–1 R.     

Linking (n − 2)-dimensional panels inn-space I: (k − 1,k)-graphs and (k − 1,k)-frames

A (k – 1,k)-graph is a multi-graph satisfyinge (k – 1)v – k for every non-empty subset ofe edges onv vertices, with equality whene = |E(G)|. A (k – 1,k)-frame is a structure generalizing an (n – 2, 2)-framework inn-space, a structure consisting of a set of (n – 2)-dimensional bodies inn-space and a set of rigid bars each joining a pair of bodies using ball joints. We prove that a graph is the graph of a minimally rigid (with respect to edges) (k – 1,k)-frame if and only if it is a (k – 1,k)-graph. Rigidity here means infinitesimal rigidity or equivalently statical rigidity.     

On High G k−1,k -Defective Varieties

We give a rough characterization for n-dimensional varieties with G_k?1,k-defect equal to a > 0 if k ≥ n. Then we apply this in the case that a ≥ n ? 2 to become a fine classification.     

Remarks on bifurcations ofu + μu − u k=0 (4≤kεZ +)

In this paper, we investigate the bifurcations of one class of steady-state reaction-diffusion equations of the formu″ + μu − u ^k=0, subjectu(0)=u(π)=0, where μ is a parameter, 4≤kεZ ⁺. Using the singularity theory based on the Liapunov-Schmidt reduction, some satisfactory results are obtained. This work is supported by the National Natural Science Foundation of China (No.19971057) and the Youth Science Foundation of Shanghai Municipal Commission of Education (No.99QA66).     

关于Sk=1+2k+3k+…+nk的探究

1.递推公式由二项展开式得对i求和上式左边可化为(n+1)k+1-1+Sk+1,从而有(1)由(1)式得递推公式     

关于Lebesgue-Nagell方程x2+a2=yn

本文研究了Lebesgue-Nagell方程x2+a2=yu.利用Lucas数本原素因数的相关结果,获得了该方程解的较好上界.     

Hamiltonian[k,k+1]-因子

本文考虑n/2-临界图中Hamiltonian[k,k+1]-因子的存在性。Hamiltonian[k,k+1]-因子是指包含Hamiltonian圈的[k,k+1]-因子;给定阶数为n的简单图G,若δ(G)≥n/2而δ(G\e)相似文献   

一类隐式的k+1阶线性k步法

本文首先给出了一类比Adams-Moulton方法的绝对稳定区间大的隐式k+1阶线性k步法基本公式.求出了3-9步新公式的分数形式的精确系数,阶数,局部截断误差主项系数和绝对稳定区间,然后构造了由4阶隐式新公式和同阶显式Nyström公式组合而成的预估-校正方法,比著名的Adams-Bashforth-Moulton和Nyström-Adams-Moulton预估校正方法的绝对稳定区间大,最后用对比数值试验对结果进行了验证.     

On the neutrix convolution product ofx − r Inx − andx + −3

The existence of the neutrix convolution product of distributionx _? ^r Inx _? andx ₊ ^?3 is proved and some convolution products are evaluated.