自相似集的一类子集的维数

设F是满足强分离条件的自相似集，A↓x∈F，必存在唯一的无穷序列σx=(σx^(1),…，σx^(k)…）∈{1,2,…，m}^N,与之对应，定义F的子集：Fm,c,r={x∈F|∑rj=1σx^n j≥c,n=0,1,2,…},其中c,r为任意取定的正整数，本文证明了fm,c,r是图递归集，并确定了Fm,c,r的Hausdorff维数。     

$A_n-$型有限维代数的整体维数

设$k$是一个代数闭域, $n$是一个自然数,本文给出了一个精确刻画$A_{n}$-型有限维$k$-代数的整体维数的技巧.据此给出了$A_{n}$-型有限维$k$-代数的所有可能的整体维数.特别的,如果$n>1$,我们指出其中最大的是 $n-1$,最小的是 $1$.     

一类递归集的Hausdorff维数及Bouligand维数

本文给出递归集的Ｈａｕｓｄｏｒｆｆ维数的下界估计，并由此确定了一类递归集的维数，所获结果包含并推广了Ｂｅｄｆｏｒｄ，Ｄｅｋｋｉｎｇ及文志英、钟红柳等人的有关结果。     

由表示系统生成的分形的维数

在这篇文章里,由Ｒｎ中点的表示系统所生成的自仿射集中,给出了自仿射集满足Ｍｏｒａｎ开集条件的一个新的判别方法和不满足开集条件的自相似集的Ｈａｕｓｄｏｒｆｆ维数的上界和下界,并根据两个实例估计出其上下界是相等的．     

一类递归集Hausdorff维数及Bouligand维数

本语言给出了递归集的Ｈａｕｓｄｏｒｆｆ维数的下界估计，并由此确定了一类递归集的维数，所获结果包含并推广了Ｂｅｄｆｏｒｄ，Ｄｅｋｋｉｎｇ及文志英，钟红柳等人的有关结果。     

关于对偶扩张代数有限维数的注记

没A是一个有限维代数，R为A的对偶扩张代数．本我们讨论R的有限维数findim R of R，证明了，在—般情况下findim R≠2findim A，这就回答了惠昌常教授所提的一个问题．     

一类随机Moran集的分形维数

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

广义自相似集的重fractal分解集的点态维数及packing维数

设Ｋ为广义自相似集，μ为支撑于Ｋ上的无穷乘积测度，本文中证明了Ｋ的重ｆｒａｃｔａｌ分解集Ｋα恰好由关于测度μ的点态维数为α的点所组成，并证明了Ｋα的ｐａｃｋｉｎｇ维数与其Ｈａｕｓｄｏｒｆｆ维数一致，从而Ｋα为在Ｔａｙｌｏｒ［９］意义下的ｆｒａｃｔａｌ集。     

平面上一类自相似集的共形维数

本文证明了平面上一类自相似集的共形维数为1.此外还证明了这些自相似集与任何Hausdorff维数为1的度量空间都不是拟对称等价的.这表明,对于这些自相似集而言,共形维数定义中的下确界不能达到.     

广义自相似集的维数研究

广义自相似集的维数研究华苏（清华大学应用数学系，北京１０００８４）ＯＮＴＨＥＤＩＭＥＮＳＩＯＮＯＦＧＥＮＥＲＡＬＩＺＥＤＳＥＬＲ－ＳＩＭＩＬＡＲＳＥＴＳ￥ＨＵＡＳＵ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＴｓｉｎｇｈｕａＵｎｉ...     

On the slopes of semistable representations of tame quivers

Stability conditions play an important role in the study of representations of a quiver. In the present paper, we study semistable representations of quivers. In particular, we describe the slopes of semistable representations of a tame quiver for a fixed stability condition.     

The Hausdorff dimension of a class of recurrent sets

In this paper we obtain a lower bound for the Hausdorff dimension of recurrent sets and, in a general setting, we show that a conjecture of Dekking [F.M. Dekking, Recurrent sets: A fractal formalism, Report 82-32, Technische Hogeschool, Delft, 1982] holds.     

Piecewise linear least squares approximations of Frobenius-Perron operators

We propose a piecewise linear numerical method based on least squares approximations for computing stationary density functions of Frobenius-Perron operators associated with piecewise C² and stretching mappings of the unit interval. We prove the weak convergence of the method for a class of Frobenius-Perron operators, and the numerical results show that it is also norm convergent and has a better convergence rate than the piecewise linear Markov approximation method.     

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.     

Tame roots of wild quivers

We study the tame behaviour of the representations of wild quivers Q via tame roots. A positive root d of Q is called a tame root if d is sincere and for any positive sub-root d^′ of d we have q(d^′)0, where q(d^′) is the Tits form of Q. We prove that a sincere root is a tame root if and only if for any decomposition of d into a sum of positive sub-roots d=d¹++d^s, there is at most one dⁱ with q(dⁱ)=0 and q(d^j)=1. This is the essential property of a tame root and it is an alternative way to define tame roots. Then we give the canonical decomposition of a tame root. At the end we prove our main result that for any wild graph, there are only finitely many tame roots.     

Hausdorff dimension of Julia set of a polynomial with a Siegel disk

Let f(z) = e2πiθz(1 z/d)d,θ∈R\Q be a polynomial. Ifθis an irrational number of bounded type, it is easy to see that f(z) has a Siegel disk centered at 0. In this paper, we will show that the Hausdorff dimension of the Julia set of f(z) satisfies Dim(J(f))<2.     

Hausdorff dimension of homogeneous perfect sets

Summary We introduce the notion of homogeneous perfect sets as a generalization of Cantor type sets and determine their exact dimension based on the length of their fundamental intervals and the gaps between them. Some earlier results regarding the dimension of Cantor type sets are shown to be special cases of our main theorem.     

Discrepancies between metric dimension and partition dimension of a connected graph

Let and be graphs where the set of vertices is the set of points of the integer lattice and the set of edges consists of all pairs of vertices whose city block and chessboard distances, respectively, are 1.In this paper it is shown that the partition dimensions of these graphs are 3 and 4, respectively, while their metric dimensions are not finite. Also, for every n3 there exists an induced subgraph of of order 3n-1 with metric dimension n and partition dimension 3. These examples will answer a question raised by Chartrand, Salehi and Zhang. Furthermore, graphs of order n9 having partition dimension n-2 are characterized, thus completing the characterization of graphs of order n having partition dimension 2, n, or n-1 given by Chartrand, Salehi and Zhang. The list of these graphs includes 23 members.