Dynamics of the generalized 3x + 1 function determined by its fractal images

Two different complex maps were obtained by generalizing 3x ＋ 1 function to the complex plane, and fractal images for these two complex maps were constructed by using escape time, stopping time and total stopping time arithmetic. The dynamics of the generalized 3x＋1 function based on the structural characteristics of the fractal images was studied. We found that：（1） the size and structure of the stable regions, stopping regions, total stopping regions, and divergent regions for the three types of fractal images depend on convergence rate of the map on the x and y axes. （2） The black stable regions constructed, respectively, by escape time and total stopping time are almost overlapped, demonstrating that 3x ＋1 function converged steadily. （3） All of the three fractal images are symmetric to the real axis. The structures on the neighborhood of positive integer number are symmetric to a perpendicular line, which is corresponding to the point or its nearby points on the x axis. And the structures have complicated fractal structure characteristics. These findings indicate that the generalized 3x＋1 function on integer number and its neighborhood contains plentiful information in the complex plane.     

复迭代映射z_(n+1)=_n~m+c的广义Mandelbrot集

研究了复迭代zn+ 1= zmn+c的广义Mandelbrot集 ,证明了其关于实轴是对称的 ,并且具有m + 1次的旋转对称性 ,得出周期轨道的稳定性条件及一周期轨道的稳定区域的边界方程·利用逃逸时间算法和周期点查找算法构造Mandelbrot集 ,可以更清楚地了解Mandelbrot集的结构     

A class of compactly supported symmetric/antisymmetric B-spline wavelets

An algorithm for constructing a class of compactly supported symmetric/antisymmetric B-spline wavelets is presented.For any m th order and k th order cardinal B-spline Nm (x), Nk (x), if m k is an even integer, the corresponding m th order B-spline wavelets ψkm (x) can be constructed, which are compactly supported symmetric/antisymmetric. In addition, if ψkm (x), m ＞ 1 is m th Bspline wavelet associated with two spline functions Nm (x) and Nk (x), then (ψkm (x))′( x ) is m - 1th B-spline wavelet associated with Nm-1(x) and Nk 1(x), i.e. (ψkm(x))′(x) =22ψk 1m-1(x). Similarly, ∫x0 ψkm(t)dt, k ＞1 is m 1th B-spline wavelet associated with Nm 1 (x) and Nk-1 (x). Using this method, we recovered Chui and Wang' s spline wavelets. Since a class of B-spline wavelets are symmetric/antisymmetric, their linear phase property is assured. Several examples are also presented.     

一类差分方程的Cm解的存在性和惟一性

讨论了一类较广泛的差分方程G(x,f(x),f(x 1),……,f(x n)=n,x∈R，其中G∈C^m（R^n 2,R),n≥2)，通过采用小挪动映射逼近不动点的方法，对任一整数m≥0，在较弱的条件下证明了该方程的C^m解的存在性和惟一性。     

丢番图方程y(y+1)(y+2)(y+3)=n~2 x(x+1)(x+2)(x+3)解的研究

设n1是正整数,利用Pell方程的正整数解的一组恒等式和高次丢番图方程的结果,研究了丢番图方程y(y+1)(y+2)(y+3)=n~2x(x+1)(x+2)(x+3)的正整数解(x,y),分别在2|/n,3|x的情形下和n不同素因数的个数不超过2的情形下,证明了该方程没有正整数解(x,y).     

关于方程sum from k=0 to n[x+2(10l+9)k]~r=[x+2(10l+9)(n+1)]~r

证明了:当奇数r>3,n,x为正整数,l为非负整数,(x,2(10l+9))=1时,方程sum from h=0 to n[x+2(10l+9)k]~r=[x+2(10l+9)(n+1)]~r无正整数解。     

Fractal structures of the non-boundary region of the generalized Mandelbrot set

In order to study the interior structure of the Mandelbrot(M) set, Pickover and Hooper have advanced the epsilon cross method and the star trails method, respectively. In order to reveal the exterior structure of the M set, Philip has proposed the regional decomposition method and the angle-slicing decomposition method. In this paper, these methods are extended, and the equipotential line method and the color adjustment method are proposed to study the exterior structure of the M set..4 series of the non-boundary region structure images of the generalized M sets is generated by using the above-mentioned methods. The results show that the non-boundary regions of the generalized M sets for integer index number have the fractal feature; while those for decimal index number have discontinuity and collapse. and their evolutions depend on the choice of the principal range of the phase angle.     

变参数复迭代系统的吸引子及其分形图

研究了一类变参数复迭代系统Ｚｋ＋１＝ｆ（λｋ，Ｚｋ，Ｚ－ｋ)的吸引子分布规律，对该迭代系统的动力行为特征作了猜想，且利用研究结果和计算机可视化技术中的逃逸时间算法得到了若干二维ｎ次迭代映射中的分形图，计算机图示实验的结果为猜想提供了佐证.     

复多项式虚实部互换构造广义M集及J集

在研究经典Ｍ－集构造方法的基础上，进一步将复多项式虚实部互换构造广义高阶Ｍ－集并对Ｍ－集的特征进行了分析研究，根据作者提出的旋转逃逸时间算法构造一系列相应的高阶Ｊｕｌｉａ集。     

关于Diophantine方程x~3±1=Dy~2

利用数论中的同余,勒让德符号的性质及其它一些方法,研究丢番图方程x3±1=Dy2(D=D1p,D是无平方因子的正整数,其中D1是不能被3或6k+1之形的素数整除的正整数,p=3(12r+7)(12r+8)+1,r是正整数)的解的情况。证明了当D1≡7(mod12)时,方程x3+1=Dy2无正整数解;当D1≡5,8(mod12)时,方程x3-1=Dy2无正整数解。     

一个二维滞后Logistic映射的分岔与分形

利用理论推导分析了二维滞后Logistic映射周期解的稳定性和分岔,利用相图、分岔图、Lyapunov指数和分维数等计算方法,证明了二维滞后Logistic映射依次经叉形分岔和Hopf分岔通向混沌.对二维滞后Logistic映射的吸引盆及其广义M-J集的研究表明:不同周期轨道的吸引盆形状相似,大小不同,每个吸引盆中周期和非周期区域之间的边界是分形的;广义M集的结构与a,R和有N关,广义J集的结构与a,R,N,和Cx,Cy有关,并且广义M-J集具有分形特征.     

Some joint distributions for Markov process

We study the joint distributions of four random variables h(ω) (stopping time or optional time), location x(h), l(ω) (co-optional time) and location x(l) for Markov processes. Some distributions for d(≥3) -dimensional Brownian motion and the joint distribution of first exit and last exit locations for symmetric stable process are found.     

关于非线性多调和方程的整体解的存在性

本文主要研究形如:Δ ((Δnu)pp-1) f(|x|, u,(△) (u)x∈R2的非线性多调和方程的整体解,此处n是自然数,p>1是实常数,f:(- 3)R×R 是一个连续函数,ξa*:=|ξa*=|ξa-1ξ,ξ∈R,a>0,证明了该方程不存在径向对称的正整体解, 并给出存在无穷多个最终为负值且其渐进阶(当n→∞时,|u| 作为无穷大量的阶)不低于 |x|2nlog|x| 的整体解u的充分条件及渐进阶正好是 |x|2nlog|x| 的充分必要条件.     

关于丢番图方程x3±1=py2

应用因子分解法、简单同余法以及前人的已知结果证明了:(1)设p是1个奇素数,则丢番图方程组x+1=3py21,x2-x+1=3y22,(y1,y2)=1,y1>0,y2>0,无正整数解x,p,y1,y2;(2)丢番图方程x3+1=py2(其中p≡-1(mod 3)为素数)仅有整数解(x,y)=(-1,0);(3)丢番图方程x3-1=py2(其中p≡-1(m od 3)为素数)仅有整数解(x,y)=(1,0).     

关于不定方程x3 + 27 = 139y2

利用Pell方程,递归数列,同余式和平方剩余几种初等方法证明了不定方程x3+27=139y2仅有整数解(-3,0),(13,±4);在证明该结论的过程中,同时证明了不定方程x3+1=417y2仅有整数解(x,y)=(-1,0),从而给出了不定方程x3+27=139y2的全部整数解。     

关于Diophantine方程x~3+1=3py~2

设p是奇素数,研究丢番图方程x3+1=3py2正整数解的情况.利用初等数论的方法得到了丢番图方程x3+1=3py2无正整数解的若干充分条件.     

关于连续数方程注记

本文用初等方法证明了,当ｎ,ｘ ,ｒ 是正整数且ｒ ＞ ３ ,ｄ ＝ ２ｓ＋ ２ ,整数Ｓ≥０ ,ｇｃｄ（ ｘ,ｄ） ＝ １ ,丢番图方程ｎ－１ｋ＝ ０（ｘ ＋ ｄｋ）ｒ ＝ （ｘ ＋ ｄｎ）ｒ 无整数解。     

关于Diophantine方程X~3=NY~2+1

本文的主要结果是：Diophantine方程X3=NY2＋1没有正整数解，其中N只含形如的素因子且不含今数个3。     

A new escape time algorithm of constructing Julia set

Escape time algorithm is an effective theoretical algorithm of constructing fractal graphics. The key of this algorithm lies in the construction of escape time function. A new escape time function is presented based on the research of escape time algorithm. An accelerated escape time algorithm is carried out in this paper. The experiments have demonstrated that the new algorithm is not only as precise as the old, but also faster when it is used to construct Julia set.     

关于不定方程3x(x+1)(x+2)(x+3)=14y(y+1)(y+2)(y+3)

运用递归数列、pell方程、同余式及平方(非)剩余等方法,证明了不定方程3x(x+1)(x+2)(x+3)=14y(y+1)(y+2)(y+3)仅有正整数解(5,3).