｛1,4,5｝自相似集的摄动和强分离参数集

对于自相似集Eλ=Eλ/5U(Eλ/5+λ/5)∪(Eλ/5+4/5),本文讨论了λ靠近3(对应于{1,4,5}集)时, Eλ的维数逼近性质,强分离性, Lipschitz等价性等.此外,还探讨了参数集{λ:Eλ不满足强分离条件}的几何结构.     

拟相似集的Hausdorff测度的特征

Siegfried GRAF在文献［1］中给出了自相似集上的Hausdorff测度(简称H-测度)的特征.John McLaughlin在文献［2］中引入了拟相似集的概念,K.J.Falconer又在文献［3］中讨论了拟相似集上H-测度和维数的性质.本文研究拟相似集上的H-测度的特征,并得出在一定条件下支撑于其上满足一定条件的测度与H-测度的等价性条件.     

关于自相似集的Hausdorff测度的一个判据及其应用

讨论了满足开集条件的自相似集。对于此类分形，用自然覆盖类估计它的Hausdorff测度只能得到一个上限，因而如何判断某一个上限就是它的Hausdorff测度的准确值是一个重要的问题。本文给出了一个判据。作为应用，统一处理了一类自相似集，得到了平面上的一个Cantor集－Cantor尘的Hausdorff测度的准确值，并重新计算了直线上的Cantor集以及一个Sierpinski地毯的Hausdorff测度。     

关于满足弱开集条件的自相似测度的局部维数的注记

对于自相似集合,已知开集条件与强开集条件是等价的,我们讨论了强开集条件的基些性质,并给出了自似测度局部维数研究的一个应用。     

RN中某些分形子集的Hausdorff维数与Hausdorff测度

给出了RN中某些分形子集的Hausdorff维数及其Hausdorff测度估计式.     

相伴于随机自相似分形的随机测度的强测度的收敛性

构造了随机自相似分形及其上的记忆函数,并得出了有关结论,在此基础上,我们可以定义一个随机概率测度dΦn(τ)=Kn(τ)dτ,Φn(τ)弱收敛于Φ,进一步可得到强测度序列Ψn(·)=EΦn(·),则{Ψn}弱收敛于Ψ=EΦ.     

一类Sierpinski垫的Hausdorff测度

设S_λ为压缩比为λ(λ≤1/3)的一类Sierpinski垫,s=-log_λ3为S_λ的Hausdorff维数,N为产生S_λ的所有基本三角形的集合.本文使用网测度方法,获得了S_λ的s-维Hausdorff测度的精确值H~s(S_λ)=1,同时证明了H~s(S_λ)可由S_λ关于网N的s-维Hausdorff测度H_N~s(S_λ)确定,获得了S_λ的非平凡的最佳覆盖.     

相伴于随机自相似分形的随机测度的强测度的收敛性(英文)

构造了随机自相似分形及其上的记忆函数,并得出了有关结论,在此基础上,我们可以定义一个随机概率测度dΦn(τ)=Kn(τ)dτ,Φn(τ)弱收敛于Φ,进一步可得到强测度序列Ψn(.)=EΦn(.),则{Ψn}弱收敛于Ψ=EΦ.     

关于自相似测度绝对连续的测度的点密度测度

本文研究了一类关于自相似测度绝对连续的概率测度的点密度测度的问题.利用迭代函数系,量子系数和H(o|¨)lder不等式,在自相似集满足强分离条件下,获得了此点密度测度,推广了自相似测度为Lebesgue测度的结果.     

Sierpinski垫片的Hausdorff测度

通过构造Sierpinski垫片的一个覆盖序列,得到它的Hausdorff测度的上限的一个递降序列。这个递降序列的极限是目前所知Sierpinski垫片的Hausdorff测度的最好上限。     

The estimate for mean values on prime numbers relative to \frac{4} {p} = \frac{1} {{n_1 }} + \frac{1} {{n_2 }} + \frac{1} {{n_3 }}

If n is a positive integer,let f （n） denote the number of positive integer solutions （n 1,n 2,n 3） of the Diophantine equation 4/n=1/n₁ + 1/n₂ + 1/n₃.For the prime number p,f （p） can be split into f 1 （p） + f 2 （p）,where f i （p） （i=1,2） counts those solutions with exactly i of denominators n 1,n 2,n 3 divisible by p.In this paper,we shall study the estimate for mean values ∑ p相似文献   

直线上分形的Hausdorff测度的一个算法

本文给出了直线上Marion集的Hausdorff测度的一个有效计算方法,并通过几个实例得出如何利用此方法计算出直线上分形的Hausdorff测度的精确值.     

$m$个$C_{3}$的并和$m$个$C_{4}$的并的点可区别 $E$-全染色

Let G be a simple graph. A total coloring f of G is called E-total-coloring if no two adjacent vertices of G receive the same color and no edge of G receives the same color as one of its endpoints. For E-total-coloring f of a graph G and any vertex u of G, let Cf （u） or C（u） denote the set of colors of vertex u and the edges incident to u. We call C（u） the color set of u. If C（u） ≠ C（v） for any two different vertices u and v of V（G）, then we say that f is a vertex-distinguishing E-total-coloring of G, or a VDET coloring of G for short. The minimum number of colors required for a VDET colorings of G is denoted by X^evt（G）, and it is called the VDET chromatic number of G. In this article, we will discuss vertex-distinguishing E-total colorings of the graphs mC3 and mC4.     

Finite Partially {0, 1}-Semiaffine Linear Spaces

In this paper finite, partially proper {0,1}-semiaffine, planes of order n are studied and completely characterized. Finite, partially {0}-semiaffine, planes are completely classified and finite, partially {1}-semiaffine, planes are classified for bn ²+n+1.     

Construction of Lagrangian Self-similar Solutions to the Mean Curvature Flow in \mathbb{C}^n

We give new examples of self-shrinking and self-expanding Lagrangian solutions to the Mean Curvature Flow (MCF). These are Lagrangian submanifolds in , which are foliated by (n − 1)-spheres (or more generally by minimal (n − 1)-Legendrian submanifolds of ), and for which the study of the self-similar equation reduces to solving a non-linear Ordinary Differential Equation (ODE). In the self-shrinking case, we get a family of submanifolds generalising in some sense the self-shrinking curves found by Abresch and Langer.     

Maximal three-independent subsets of {0, 1, 2} n

We consider a variant of the classical problem of finding the size of the largest cap in ther-dimensional projective geometry PG(r, 3) over the field IF₃ with 3 elements. We study the maximum sizef(n) of a subsetS of IF ₃ ⁿ with the property that the only solution to the equationx ₁+x₂+x₃=0 isx ₁=x₂=x₃. Letc _n=f(n)^1/n andc=sup{c ₁, c₂, ...}. We prove thatc>2.21, improving the previous lower bound of 2.1955 ...     

{0, 1/2}-Chvátal-Gomory cuts

Given the integer polyhedronP _t := conv{x ∈ℤ ⁿ :Ax⩽b}, whereA ∈ℤ ^{m × n} andb ∈ℤ ^m , aChvátal-Gomory (CG)cut is a valid inequality forP ₁ of the type λτAx⩽⌊λτb⌋ for some λ∈ℝ ₊ ^m such that λτA∈ℤ ⁿ . In this paper we study {0, 1/2}-CG cuts, arising for λ∈{0, 1/2} ^m . We show that the associated separation problem, {0, 1/2}-SEP, is equivalent to finding a minimum-weight member of a binary clutter. This implies that {0, 1/2}-SEP is NP-complete in the general case, but polynomially solvable whenA is related to the edge-path incidence matrix of a tree. We show that {0, 1/2}-SEP can be solved in polynomial time for a convenient relaxation of the systemAx<-b. This leads to an efficient separation algorithm for a subclass of {0, 1/2}-CG cuts, which often contains wide families of strong inequalities forP ₁. Applications to the clique partitioning, asymmetric traveling salesman, plant location, acyclic subgraph and linear ordering polytopes are briefly discussed.     

三分Cantor集自乘积的Hausdorff测度的估计

本文证明了三分Cantor集C自乘积集C×C的Hausdorff测度,满足1≤H~((log_3)~4)(C×C)≤1.502879.