Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userIce model and eight-vertex model on the two-dimensional Sierpinski gasket
279
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 configurations 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.
rate research
Read More
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 times 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 show that holomorphic Parafermions exist in the eight vertex model. This is done by extending the definition from the six vertex model to the eight vertex model utilizing a parameter redefinition. These Parafermions exist on the critical plane and integrable cases of the eight vertex model. We show that for the case of staggered eight vertex model, these Parafermions correspond to those of the Ashkin-Teller model. Furthermore, the loop representation of the eight vertex model enabled us to show a connection with the O(n) model which is in agreement with the six vertex limit found as a special case of the O(n) model.
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$.
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 present the number of dimers $N_d(n)$ on the Sierpinski gasket $SG_d(n)$ at stage $n$ with dimension $d$ equal to two, three, four or five, where one of the outmost vertices is not covered when the number of vertices $v(n)$ is an odd number. The entropy of absorption of diatomic molecules per site, defined as $S_{SG_d}=lim_{n to infty} ln N_d(n)/v(n)$, is calculated to be $ln(2)/3$ exactly for $SG_2(n)$. The numbers of dimers on the generalized Sierpinski gasket $SG_{d,b}(n)$ with $d=2$ and $b=3,4,5$ are also obtained exactly. Their entropies are equal to $ln(6)/7$, $ln(28)/12$, $ln(200)/18$, respectively. The upper and lower bounds for the entropy are derived in terms of the results at a certain stage for $SG_d(n)$ with $d=3,4,5$. As the difference between these bounds converges quickly to zero as the calculated stage increases, the numerical value of $S_{SG_d}$ with $d=3,4,5$ can be evaluated with more than a hundred significant figures accurate.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
