اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStructure of spanning trees on the two-dimensional Sierpinski gasket
269
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Consider spanning trees on the two-dimensional Sierpinski gasket SG(n) where stage $n$ is a non-negative integer. For any given vertex $x$ of SG(n), we derive rigorously the probability distribution of the degree $j in {1,2,3,4}$ at the vertex and its value in the infinite $n$ limit. Adding up such probabilities of all the vertices divided by the number of vertices, we obtain the average probability distribution of the degree $j$. The corresponding limiting distribution $phi_j$ gives the average probability that a vertex is connected by 1, 2, 3 or 4 bond(s) among all the spanning tree configurations. They are rational numbers given as $phi_1=10957/40464$, $phi_2=6626035/13636368$, $phi_3=2943139/13636368$, $phi_4=124895/4545456$.
قيم البحث
اقرأ أيضاً
We study the number of connected spanning subgraphs $f_{d,b}(n)$ on the generalized Sierpinski gasket $SG_{d,b}(n)$ at stage $n$ with dimension $d$ equal to two, three and four for $b=2$, and layer $b$ equal to three and four for $d=2$. The upper and
lower bounds for the asymptotic growth constant, defined as $z_{SG_{d,b}}=lim_{v to infty} ln f_{d,b}(n)/v$ where $v$ is the number of vertices, on $SG_{2,b}(n)$ with $b=2,3,4$ are derived in terms of the results at a certain stage. The numerical values of $z_{SG_{d,b}}$ are obtained.
We study the number of acyclic orientations on the generalized two-dimensional Sierpinski gasket $SG_{2,b}(n)$ at stage $n$ with $b$ equal to two and three, and determine the asymptotic behaviors. We also derive upper bounds for the asymptotic growth
constants for $SG_{2,b}$ and $d$-dimensional Sierpinski gasket $SG_d$.
We present the numbers of ice model and eight-vertex model configurations (with Boltzmann factors equal to one), I(n) and E(n) respectively, on the two-dimensional Sierpinski gasket SG(n) at stage $n$. For the eight-vertex model, the number of config
urations is $E(n)=2^{3(3^n+1)/2}$ and the entropy per site, defined as $lim_{v to infty} ln E(n)/v$ where $v$ is the number of vertices on SG(n), is exactly equal to $ln 2$. For the ice model, the upper and lower bounds for the entropy per site $lim_{v to infty} ln I(n)/v$ are derived in terms of the results at a certain stage. As the difference between these bounds converges quickly to zero as the calculated stage increases, the numerical value of the entropy can be evaluated with more than a hundred significant figures accurate. The corresponding result of ice model on the generalized two-dimensional Sierpinski gasket SG_b(n) with $b=3$ is also obtained. For the generalized vertex model on SG_3(n), the number of configurations is $2^{(8 times 6^n +7)/5}$ and the entropy per site is equal to $frac87 ln 2$. The general upper and lower bounds for the entropy per site for arbitrary $b$ are conjectured.
We derive exactly the number of Hamiltonian paths H(n) on the two dimensional Sierpinski gasket SG(n) at stage $n$, whose asymptotic behavior is given by $frac{sqrt{3}(2sqrt{3})^{3^{n-1}}}{3} times (frac{5^2 times 7^2 times 17^2}{2^{12} times 3^5 tim
es 13})(16)^n$. We also obtain the number of Hamiltonian paths with one end at a certain outmost vertex of SG(n), with asymptotic behavior $frac {sqrt{3}(2sqrt{3})^{3^{n-1}}}{3} times (frac {7 times 17}{2^4 times 3^3})4^n$. The distribution of Hamiltonian paths on SG(n) with one end at a certain outmost vertex and the other end at an arbitrary vertex of SG(n) is investigated. We rigorously prove that the exponent for the mean $ell$ displacement between the two end vertices of such Hamiltonian paths on SG(n) is $ell log 2 / log 3$ for $ell>0$.
We construct a strongly local regular Dirichlet form on the golden ratio Sierpinski gasket, which is a self-similar set without any finitely ramified cell structure, via a study on the trace of electrical networks on an infinite graph. The Dirichlet
form is self-similar in the sense of an infinite iterated function system, and is decimation invariant with respect to a graph-directed construction. A theorem of uniqueness is also provided. Lastly, the associated process satisfies the two-sided sub-Gaussian heat kernel estimate.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
