اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The resistance between two nodes in some resistor networks has been studied extensively by mathematicians and physicists. Let $L_n$ be a linear hexagonal chain with $n$, 6-cycles. Then identifying the opposite lateral edges of $L_n$ in ordered way yields the linear hexagonal cylinder chain, written as $R_n$. We obtain explicit formulae for the resistance distance $r_{L_n}(i, j)$ (resp. $r_{R_n}(i,j)$) between any two vertices $i$ and $j$ of $L_n$ (resp. $R_n$). To the best of our knowledge ${L_n}_{n=1}^{infty}$ and ${R_n}_{n=1}^{infty}$ are two nontrivial families with diameter going to $infty$ for which all resistance distances have been explicitly calculated. We determine the maximum and the minimum resistance distances in $L_n$ (resp. $R_n$). The monotonicity and some asymptotic properties of resistance distances in $L_n$ and $R_n$ are given. As well we give formulae for the Kirchhoff indices of $L_n$ and $R_n$ respectively.
قيم البحث
اقرأ أيضاً
The quadrilateral graph Q(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 3, whereas the pentagonal graph W(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 4. In this
paper, closed-form formulas of resistance distance and Kirchhoff index for quadrilateral graph and pentagonal graph are obtained whenever G is an arbitrary graph.
Motivated by the notion of resistance distance on graph, we define a new resistance distance between two states on a given finite ergodic Markov chain based on its fundamental matrix. We prove a few equivalent formulations and discuss its relation wi
th other parameters of the Markov chain such as its group inverse, stationary distribution, eigenvalues or hitting time. In addition, building upon existing sum rules for the hitting time of Markov chain, we give sum rules of this new resistance distance of Markov chains that resembles the sum rules of the resistance distance on graph. This yields Markov chain counterparts of various classical formulae such as Fosters first formula or the Kirchhoff index formulae.
Ahlswede and Katona (1977) posed the following isodiametric problem in Hamming spaces: For every $n$ and $1le Mle2^{n}$, determine the minimum average Hamming distance of binary codes with length $n$ and size $M$. Fu, Wei, and Yeung (2001) used linea
r programming duality to derive a lower bound on the minimum average distance. However, their linear programming approach was not completely exploited. In this paper, we improve Fu-Wei-Yeungs bound by finding a better feasible solution to their dual program. For fixed $0<ale1/2$ and for $M=leftlceil a2^{n}rightrceil $, our feasible solution attains the asymptotically optimal value of Fu-Wei-Yeungs dual program as $ntoinfty$. Hence for $0<ale1/2$, all possible asymptotic bounds that can be derived by Fu-Wei-Yeungs linear program have been characterized. Furthermore, noting that the average distance of a code is closely related to weights of Fourier coefficients of a Boolean function, we also apply the linear programming technique to prove bounds on Fourier weights of a Boolean function of various degrees.
We show that a generic framework $(G,p)$ on the cylinder is globally rigid if and only if $G$ is a complete graph on at most four vertices or $G$ is both redundantly rigid and $2$-connected. To prove the theorem we also derive a new recursive constru
ction of circuits in the simple $(2,2)$-sparse matroid, and a characterisation of rigidity for generic frameworks on the cylinder when a single designated vertex is allowed to move off the cylinder.
In 1987, Affleck, Kennedy, Lieb, and Tasaki introduced the AKLT spin chain and proved that it has a spectral gap above the ground state. Their concurrent conjecture that the two-dimensional AKLT model on the hexagonal lattice is also gapped remains o
pen. In this paper, we show that the AKLT Hamiltonian restricted to an arbitrarily long chain of hexagons is gapped. The argument is based on explicitly verifying a finite-size criterion which is tailor-made for the system at hand. We also discuss generalizations of the method to the full hexagonal lattice.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
