Author, Subjects, Keywords

Cited Author

 

 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

An Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting

Pah, C.H., (2008) An Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting. Bulletin of the Malaysian Mathematical Sciences Society, 31 (2). pp. 173-183. ISSN 0126-6705

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
119Kb

Official URL: http://math.usm.my/bulletin/pdf/v31n2/v31n2p7.pdf

Affiliations

International Islamic University Malaysia. Faculty of Science. Dept. of Computational and Theoretical Sciences

Abstract

In this paper, we consider a problem on finding the number of different single connected component containing a fixed root for a given number of vertices on semi-infinite Cayley tree. The solution of this problem is the well known Catalan numbers. The result is then extended to the complete graph. Then, we gave a suitable estimate for the given problem.

Item Type:Journal
Keywords:Cayley tree, phase transition, contour method, Catalan numbers
Subjects:Q Science, Computer Science
ID Code:3968

[1] R. J. Baxter, Exactly Solved Models in Statistical Mechanics, Academic, London, 1982.

[2] C. Borgs, Statistical Physics Expansion Methods in Combinatorics and Computer Science, http://research.microsoft.com/borgs/CBMS.pdf, March 22, 2004.

[3] R. L. Dobrushin, Existence of a phase transition in the two dimensional and three-dimensional Ising model. Soviet Phys. Doklady 10(1965), 111–113 .

[4] H.-O. Georgii, Gibbs Measures and Phase Transitions, Walte de Gruyter, Berlin, 1998.

[5] R. L. Graham, D. E. Knuth and O. Patashnik, Exercise 9.8 in Concrete Mathematics: A Foundation for Computer Science, Second ed., Reading, MA: Addison-Wesley, 1994.

[6] R. B. Griffiths, Peierls’ proof of spontaneous magnetization of a two-dimensional Ising ferro-

magnet. Phys. Rev. A136(1964), 437–439.

[7] R. A.Minlos, Introduction To Mathematical Statistical Physics, Amer.Math. Soc., Providence, RI, 2000.

[8] R. Peierls, On Ising model of ferro magnetism. Proc. Cambridge Phil. Soc. 32(1936), 477–481.

[9] S. Pemmaraju and S. Skiena, Computational Discrete Mathematics, Cambridge Univ. Press, Cambridge, 2003

[10] S. A. Pirogov and Ya. G. Sinai, Phase diagrams of classical lattice systems, I. Theor. Math. Phys. 25(1975), 1185–1192 .

[11] S. A. Pirogov and Ya. G. Sinai, Phase diagrams of classical lattice systems, II. Theor. Math. Phys. 26(1976), 39–49 .

[12] R. P. Stanley, Catalan addendum, http://math.mit.edu/rstan/ec/catadd.pdf, version of 6 October 2008; 72 pages.

[13] J. H. van Lint and R. M. Wilson, A course in combinatorics, Second edition, Cambridge Univ. Press, Cambridge, 2001.

[14] I. Vardi, Computational recreations in Mathematica, Addison-Wesley, Redwood City, CA, 1991.

Repository Staff Only: item control page