اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAcyclic orientations on the Sierpinski gasket
169
0
0.0
(
0
)
تأليف
Shu-Chiuan Chang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 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.
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 it
s 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 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.
The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. We study the number of independent sets $m_{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 for $d=2$. The upper and lower bounds for the asymptotic growth constant, defined as $z_{SG_{d,b}}=lim_{v to infty} ln m_{d,b}(n)/v$ where $v$ is the number of vertices, on these Sierpinski gaskets are derived in terms of the results at a certain stage. The numerical values of these $z_{SG_{d,b}}$ are evaluated with more than a hundred significant figures accurate. We also conjecture the upper and lower bounds for the asymptotic growth constant $z_{SG_{d,2}}$ with general $d$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
