Fractal properties of number systems

In this paper we study properties of the fundamental domain F of number systems in the n-dimensional real vector space. In particular we investigate the fractal structure of its boundary F. In a first step we give upper and lower bounds for its box counting dimension. Under certain circumstances these bounds are identical and we get an exact value for the box counting dimension. Under additional assumptions we prove that the Hausdorf dimension of F is equal to its box counting dimension. Moreover, we show that the Hausdorf measure is positive and fnite. This is done by applying the theory of graphdirected self similar sets due to Falconer and Bandt. Finally, we discuss the connection to canonical number systems in number felds, and give some numerical examples.     

Dimensions for random self–conformal sets

A set is called regular if its Hausdorff dimension and upper box–counting dimension coincide. In this paper, we prove that the random self–conformal set is regular almost surely. Also we determine the dimensions for a class of random self–conformal sets.     

The Box counting Dimension of Invariant Sets for Iterated Function Systems

Ｕｎｄｅｒｔｈｅｏｐｅｎｓｅｔｃｏｎｄｉｔｉｏｎ,ａｎｉｎｅｑｕａｌｉｔｙｏｎｔｈｅｂｏｘ－ｃｏｕｎｔｉｎｇｄｉｍｅｎｓｉｏｎｏｆｉｎｖａｒｉ－ａｎｔｓｅｔｓｆｏｒｃｏｎｔｒａｃｔｉｏｎｉｔｅｒａｔｅｄｆｕｎｃｔｉｏｎｓｙｓｔｅｍｓｗｅｒｅｇｉｖｅｎ...     

Hausdorff dimension of the limit sets of some planar geometric constructions

We determine the Hausdorff and box dimension of the limit sets for some class of planar non-Moran-like geometric constructions generalizing the Bedford-McMullen general Sierpiński carpets. The class includes affine constructions generated by an arbitrary partition of the unit square by a finite number of horizontal and vertical lines, as well as some non-affine examples, e.g. the flexed Sierpiński gasket.     

关于不变集的维数

本文讨论两类不变集的维数．在第一部分我们研究了平面上的一类自仿集,并给出了它的Hausdorff维数的—个估计．在第二部分我们研究Rd上的迭代函数系(IFS)的不变集, 特别我们考虑了压缩系数不是常数的情形,所得结果给出了经典结果的一个非平凡推广．     

Sub-Riemannian vs. Euclidean dimension comparison and fractal geometry on Carnot groups

We solve Gromov's dimension comparison problem for Hausdorff and box counting dimension on Carnot groups equipped with a Carnot-Carathéodory metric and an adapted Euclidean metric. The proofs use sharp covering theorems relating optimal mutual coverings of Euclidean and Carnot-Carathéodory balls, and elements of sub-Riemannian fractal geometry associated to horizontal self-similar iterated function systems on Carnot groups. Inspired by Falconer's work on almost sure dimensions of Euclidean self-affine fractals we show that Carnot-Carathéodory self-similar fractals are almost surely horizontal. As a consequence we obtain explicit dimension formulae for invariant sets of Euclidean iterated function systems of polynomial type. Jet space Carnot groups provide a rich source of examples.     

Beurling Dimension of Gabor Pseudoframes for Affine Subspaces

Pseudoframes for subspaces have been recently introduced by Li and Ogawa as a tool to analyze lower dimensional data with arbitrary flexibility of both the analyzing and the dual sequence. In this paper we study Gabor pseudoframes for affine subspaces by focusing on geometrical properties of their associated sets of parameters. We first introduce a new notion of Beurling dimension for discrete subsets of ℝ ^d by employing a certain generalized Beurling density. We present several properties of Beurling dimension including a comparison with other notions of dimension showing, for instance, that our notion includes the mass dimension as a special case. Then we prove that Gabor pseudoframes for affine subspaces satisfy a certain Homogeneous Approximation Property, which implies invariance under time–frequency shifts of an approximation by elements from the pseudoframe. The main result of this paper is a classification of Gabor pseudoframes for affine subspaces by means of the Beurling dimension of their sets of parameters. This provides us, in particular, with a Nyquist dimension which separates sets of parameters of pseudoframes from those of non-pseudoframes and which links a fixed value to sets of parameters of pseudo-Riesz sequences. These results are even new for the special case of Gabor frames for an affine subspace.      

Squares and their centers

We study the relationship between the size of two sets B, S ? R², when B contains either the whole boundary or the four vertices of a square with axes-parallel sides and center in every point of S. Size refers to cardinality, Hausdorff dimension, packing dimension, or upper or lower box dimension. Perhaps surprisingly, the results vary depending on the notion of size under consideration. For example, we construct a compact set B of Hausdorff dimension 1 which contains the boundary of an axes-parallel square with center in every point in [0, 1]², prove that such a B must have packing and lower box dimension at least 7/4, and show by example that this is sharp. For more general sets of centers, the answers for packing and box counting dimensions also differ. These problems are inspired by the analogous problems for circles that were investigated by Bourgain, Marstrand and Wolff, among others.     

Category and dimensions for cut-out sets

In this paper, we study the modified box dimensions of cut-out sets that belong to a positive, nonincreasing and summable sequence. Noting that the family of such sets is a compact metric space under the Hausdorff metric, we prove that the lower modified box dimension equals zero and the upper modified box dimension equals the upper box dimension for almost all cut-out set in the sense of Baire category.     

Logistic混沌系统分形特性研究

对Logistic序列进行研究,利用Matlab数值模拟,通过计算不同初值、不同参数对应的混沌序列的计盒维数,得出结论:只要在数据充分的情况下,Logistic系统的分形维数基本由参数λ决定,与系统初值无关;同时计盒维数并非像熵一样随Logistic系统的参数λ增大而增大.     

Variational formula related to the self‐affine Sierpinski carpets

We consider those subsets of the self‐affine Sierpinski carpets that are the union of an uncountable number of sets each of which consists of the points with their location codes having prescribed group frequencies. It is proved that their Hausdorff dimensions equal to the supremum of the Hausdorff dimensions of the sets in the union. The main advantage is that we treat these subsets in a unified manner and the value of the Hausdorff dimensions do not need to be guessed a priori.     

On the Lipschitz equivalence of self‐affine sets

Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems.     

On class dimension of flat association schemes in affine and affine-symplectic spaces

In this paper, we obtain upper bounds of the class dimension of flat association schemes in affine and affine-symplectic spaces and construct resolving sets for these schemes.     

Counting the number of independent sets in chordal graphs

We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (2) a linear-time algorithm for counting the number of maximum independent sets; (3) a polynomial-time algorithm for counting the number of independent sets of a fixed size. With similar ideas, we show that enumeration (namely, listing) of the independent sets, the maximum independent sets, and the independent sets of a fixed size in a chordal graph can be done in constant time per output. On the other hand, we prove that the following problems for a chordal graph are #P-complete: (1) counting the number of maximal independent sets; (2) counting the number of minimum maximal independent sets. With similar ideas, we also show that finding a minimum weighted maximal independent set in a chordal graph is NP-hard, and even hard to approximate.     

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.     

随机分形的测度性质

本文主要介绍随机过程样本轨道、Ｈａｗｋｅｓ模型、统计自相似集、统计自仿射集的测度性质，同时也将介绍一些离散分形的结果．文中还列出一些尚未解决的问题．     

Weak tangent and level sets of Takagi functions

In this paper, we study some properties of Takagi functions and their level sets. We show that for Takagi functions $$T_{a,b}$$ with parameters a, b such that ab is a root of a Littlewood polynomial, there exist large level sets. As a consequence, we show that for some parameters a, b, the Assouad dimension of graphs of $$T_{a,b}$$ is strictly larger than their upper box dimension. In particular, we can find weak tangents of those graphs with large Hausdorff dimension, larger than the upper box dimension of the graphs.     

Local Convergence Behavior of Some Projection-Type Methods for Affine Variational Inequalities

In this paper, we study the local convergence behavior of four projection-type methods for the solution of the affine variational inequality (AVI) problem. It is shown that, if the sequence generated by one of the methods converges to a nondegenerate KKT point of the AVI problem, then after a finite number of iterations, some index sets in the dual variables at each iterative point coincide with the index set of the active constraints in the primal variables at the KKT point. As a consequence, we find that, after finitely many iterations, the four methods need not compute projections and their iterative equations are of reduced dimension.     

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.     

A generalization of the Bombieri–Pila determinant method

The so-called determinant method was developed by Bombieri and Pila in 1989 for counting integral points of bounded height on affine plane curves. In this paper, we give a generalization of that method to varieties of higher dimension, yielding a proof of Heath-Brown’s “Theorem 14” by real-analytic considerations alone. Bibliography: 11 titles.