A upper estimate function v(x) of Hausdorff measure H’(S) of Sierpinski Gas-ket is given. A mathematical representation of the upper approximate value uN(x)to u(x) and a simple algorithm of uN(x) based on lattice tra...A upper estimate function v(x) of Hausdorff measure H’(S) of Sierpinski Gas-ket is given. A mathematical representation of the upper approximate value uN(x)to u(x) and a simple algorithm of uN(x) based on lattice tracing technique are also derived. As a simple corollary, the estimation H’(S) min u15(n 10-5)=u15(0.50783)=0.81794’is obtained.展开更多
The upper estimation of Hausdorff measure for Sierpinski gasket has beengreatly hoprovd in Refs. [1, 2]. As the basis of these two works, the codingteclmique of the upper estimation seardsng for regular fractal sets o...The upper estimation of Hausdorff measure for Sierpinski gasket has beengreatly hoprovd in Refs. [1, 2]. As the basis of these two works, the codingteclmique of the upper estimation seardsng for regular fractal sets on computerdiscusses thoroughly in this paper through a troical example of Sierpinski gasket.展开更多
By farming a sequence of coverings of the Sierpinski gasket,a descending sequence of the upper limits of Hausdorff measure is obtained.The limit of the sequence is the best upper limit of the Hausdorff measure known s...By farming a sequence of coverings of the Sierpinski gasket,a descending sequence of the upper limits of Hausdorff measure is obtained.The limit of the sequence is the best upper limit of the Hausdorff measure known so far.展开更多
In this paper, we firstly define a decreasing sequence {Pn(S)} by the generation of the Sierpinski gasket where each Pn(S) can be obtained in finite steps. Then we prove that the Hausdorff measure Hs(S) of the Sierpin...In this paper, we firstly define a decreasing sequence {Pn(S)} by the generation of the Sierpinski gasket where each Pn(S) can be obtained in finite steps. Then we prove that the Hausdorff measure Hs(S) of the Sierpinski gasket S can be approximated by {Pn(S)} with Pn(S)/(l + l/2n-3)s≤Hs(S)≤ Pn(S). An algorithm is presented to get Pn(S) for n ≤5. As an application, we obtain the best lower bound of Hs(S) till now: Hs(S)≥0.5631.展开更多
This paper investigates a class of nonlinear elliptic equations on a fractal domain. We establish a strong Sobolev-type inequality which leads to the existence of multiple non-trivial solutions of △u+ c(x)u = f(x, u)...This paper investigates a class of nonlinear elliptic equations on a fractal domain. We establish a strong Sobolev-type inequality which leads to the existence of multiple non-trivial solutions of △u+ c(x)u = f(x, u), with zero Dirichlet boundary conditions on the Sierpihski gasket. Our existence results do not require any growth conditions of f(x,t) in t, in contrast to the classical theory of elliptic equations on smooth domains.展开更多
文摘A upper estimate function v(x) of Hausdorff measure H’(S) of Sierpinski Gas-ket is given. A mathematical representation of the upper approximate value uN(x)to u(x) and a simple algorithm of uN(x) based on lattice tracing technique are also derived. As a simple corollary, the estimation H’(S) min u15(n 10-5)=u15(0.50783)=0.81794’is obtained.
文摘The upper estimation of Hausdorff measure for Sierpinski gasket has beengreatly hoprovd in Refs. [1, 2]. As the basis of these two works, the codingteclmique of the upper estimation seardsng for regular fractal sets on computerdiscusses thoroughly in this paper through a troical example of Sierpinski gasket.
基金Project partially supported by the Foundation of Guangdong Province and the Foundation of Advanced Research Centre, Zhongshan University.
文摘By farming a sequence of coverings of the Sierpinski gasket,a descending sequence of the upper limits of Hausdorff measure is obtained.The limit of the sequence is the best upper limit of the Hausdorff measure known so far.
文摘In this paper, we firstly define a decreasing sequence {Pn(S)} by the generation of the Sierpinski gasket where each Pn(S) can be obtained in finite steps. Then we prove that the Hausdorff measure Hs(S) of the Sierpinski gasket S can be approximated by {Pn(S)} with Pn(S)/(l + l/2n-3)s≤Hs(S)≤ Pn(S). An algorithm is presented to get Pn(S) for n ≤5. As an application, we obtain the best lower bound of Hs(S) till now: Hs(S)≥0.5631.
基金This work was supported partially by the National Natural Science Foundation of China(Grant No.10371062).
文摘This paper investigates a class of nonlinear elliptic equations on a fractal domain. We establish a strong Sobolev-type inequality which leads to the existence of multiple non-trivial solutions of △u+ c(x)u = f(x, u), with zero Dirichlet boundary conditions on the Sierpihski gasket. Our existence results do not require any growth conditions of f(x,t) in t, in contrast to the classical theory of elliptic equations on smooth domains.
