一类随机Moran集的分形维数

本文研究了随机压缩向量满足一定条件下的随机Moran集的分形维数.利用计算上盒维数的上界和分形维数之间的性质,得到Moran集各种分形维数. 并在一般情形下,给出随机Moran集的上盒维数的上界.     

高度螺线纤维“丛”的机理研究

本文对D→D的映射f在圆环体内产生的高度螺线纤维丛F之机理进行了研究,并对分形集F的维数,f在F上的浑沌性进行了较细致地剖析。     

一类分形曲面的精细计盒维数公式

本文研究由一个二变元四阶差分方程边值问题生成的分形曲面的精细计盒维数问题,给出了一个自然的维数公式,若该边值问题的边界上的连续函数的图象的精细计盒维数为γ,则该解曲面的精细计盒维数为（1＋γ）。     

Sierpinski锥及其Hausdorff维数与Hausdorff测度

首先给出了 Sierpinski锥的概念及构造过程 ,然后求出其计盒维数、Hausdorff维数和 Hausdorff测度 .     

一类高维齐次Moran集的Hausdorff维数与上盒维数

本文构造一类特殊的高维齐次Moran集:{m_k^d}型齐次Moran集,并得到了满足一定条件的这类集合的Hausdorff维数与上盒维数的表达式.     

高维空间中一类齐次Moran集的分形维数

本文在高维空间中利用连通分支构造了一类称为{m_k^d}型齐次Moran集的齐次Moran集,并在一定的条件下得到这类集合的Hausdorff维数与上盒维数.     

关于可数点集的盒维数的一些探讨

本文研究了一类可数点集的盒维数的计算问题.通过构造双Lipschitz映射,把原可数点集的盒维数的求解问题转化为求解一类相对简单的可数点集的盒维数.获得了两个单调的可数点集在具有同阶间隔时具有相同的上盒维数和下盒维数的结论.该结论为计算一类可数点集的盒维数提供了方便.     

R^d中Hausdorff维数和packing维数的确定

本文目的在于建立确定Ｒ＾ｄ中Ｈａｕｓｄｏｒｆｆ维数ｄｉｍ和ｐａｃｋｉｎｇ维数Ｄｉｍ的两个命题，进而寻求Ｒ＾ｄ中Ｈａｕｓｄｏｒｆｆ维数ｄｉｍ与ｐａｃｋｉｎｇ维数Ｄｉｍ相等的条件；这使得我们能够引入分形测度的测度论定义。     

Hausdorff维数和Packing维数

设W~(t)∶R N→Rd是N指标d维广义W inner过程,Bore l集E1,…,Em RN>.本文研究了在一定条件下,m项代数和W~(E1)W~(E2)…W~(Em)的H ausdorff维数和Pack ing维数的有关结论,其结果推广了文[3]的相关结果。     

同心圆靶的计盒维数

本文讨论了以严格递减的正数列{rn}为半径的同心圆靶E和将E的间隔按从大到小的顺序重排后得到新的同心圆靶F的计盒维数的关系,证明了E的计盒维数不小于F的计盒维数,且举例说明了不等式可严格成立。     

The relationship between the Box dimension of the Besicovitch functions and the orders of their fractional calculus

The relationship between the Box dimension of the Besicovitch functions and the orders of their fractional calculus has been investigated. On some special conditions, the linear connection between them has been proved, and the other case has also been discussed.     

Regular Steinhaus graphs of odd degree

A Steinhaus matrix is a binary square matrix of size n which is symmetric, with a diagonal of zeros, and whose upper-triangular coefficients satisfy a_i,j=a_i−1,j−1+a_i−1,j for all 2?i<j?n. Steinhaus matrices are determined by their first row. A Steinhaus graph is a simple graph whose adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem, due to Dymacek, which states that even Steinhaus graphs, i.e. those with all vertex degrees even, have doubly-symmetric Steinhaus matrices. In 1979 Dymacek conjectured that the complete graph on two vertices K₂ is the only regular Steinhaus graph of odd degree. Using Dymacek’s theorem, we prove that if (a_i,j)_1?i,j?n is a Steinhaus matrix associated with a regular Steinhaus graph of odd degree then its sub-matrix (a_i,j)_2?i,j?n−1 is a multi-symmetric matrix, that is a doubly-symmetric matrix where each row of its upper-triangular part is a symmetric sequence. We prove that the multi-symmetric Steinhaus matrices of size n whose Steinhaus graphs are regular modulo 4, i.e. where all vertex degrees are equal modulo 4, only depend on parameters for all even numbers n, and on parameters in the odd case. This result permits us to verify Dymacek’s conjecture up to 1500 vertices in the odd case.     

一类复值函数图象的fractal维数

本文讨论一类连续而无处可微的复值函数,给出其图象的box维数与packing维数的表达式。     

A universal sequence of integers generating balanced Steinhaus figures modulo an odd number

In this paper, we partially solve an open problem, due to J.C. Molluzzo in 1976, on the existence of balanced Steinhaus triangles modulo a positive integer n, that are Steinhaus triangles containing all the elements of Z/nZ with the same multiplicity. For every odd number n, we build an orbit in Z/nZ, by the linear cellular automaton generating the Pascal triangle modulo n, which contains infinitely many balanced Steinhaus triangles. This orbit, in Z/nZ, is obtained from an integer sequence called the universal sequence. We show that there exist balanced Steinhaus triangles for at least 2/3 of the admissible sizes, in the case where n is an odd prime power. Other balanced Steinhaus figures, such as Steinhaus trapezoids, generalized Pascal triangles, Pascal trapezoids or lozenges, also appear in the orbit of the universal sequence modulo n odd. We prove the existence of balanced generalized Pascal triangles for at least 2/3 of the admissible sizes, in the case where n is an odd prime power, and the existence of balanced lozenges for all admissible sizes, in the case where n is a square-free odd number.     

Iterated function systems with non-distinct fixed points

The dimension theory of self-similar sets is quite well understood in the cases when some separation conditions (open set condition or weak separation condition) or the so-called transversality condition hold. Otherwise the study of the Hausdorff dimension is far from well understood. We investigate the properties of the Hausdorff dimension of self-similar sets such that some functions in the corresponding iterated function system share the same fixed point. Then it is not possible to apply directly known techniques. In this paper we are going to calculate the Hausdorff dimension for almost all contracting parameters and calculate the proper dimensional Hausdorff measure of the attractor.     

Weierstrass型函数图象的分形维数

考虑函数f(x)=sum from i=1 to ∞(?)~(-1)φ((?) θ_n)和w(x)=sum from n=1 to ∞(?)φ_(?)((?)x θ_(?)),式中0<α<(?)是任意实数,在一定条件下,估计了函数f图象的Hausdorff维数的下界,并求得了w函数图象的Box维数和Packing维数。     

Some Remarks on One-dimensional Functions and Their Riemann–Liouville Fractional Calculus

A one-dimensional continuous function of unbounded variation on [0,1] has been constructed.The length of its graph is infnite,while part of this function displays fractal features.The Box dimension of its Riemann–Liouville fractional integral has been calculated.     

Bush型函数的分形维数及其奇异性

本文给出了一类无处可微的连续函数──Ｂｕｓｈ型函数的Ｂｏｘ维数的精确值及其Ｈａｕｓｄｏｒｆｆ维数的下界估计值，同时讨论了Ｂｕｓｈ型函数的奇异性特征．     

On the box dimension for a class of nonaffine fractal interpolation functions

We present lower and upper bounds for the box dimension of the graphs of certain nonaffine fractal interpolation functions by generalizing the results that hold for the affine case.     

Revisiting the box counting algorithm for the correlation dimension analysis of hyperchaotic time series

We undertake the correlation dimension analysis of hyperchaotic time series using the box counting algorithm. We show that the conventional box counting scheme is inadequate for the accurate computation of correlation dimension (D₂) of a hyperchaotic attractor and propose a modified scheme which is automated and gives better convergence of D₂ with respect to the number of data points. The scheme is first tested using the time series from standard chaotic systems, pure noise and data added with noise. It is then applied on the time series from three standard hyperchaotic systems for computing D₂. Our analysis clearly reveals that a second scaling region appears at lower values of box size as the system makes a transition into the hyperchaotic phase. This, in turn, suggests that correlation dimension analysis can also give information regarding chaos-hyperchaos transition.