Corpus ID: 115157782

Single Polygon Counting for $m$ Fixed Nodes in Cayley Tree: Two Extremal Cases

  title={Single Polygon Counting for \$m\$ Fixed Nodes in Cayley Tree: Two Extremal Cases},
  author={F. Mukhamedov and C. H. Pah and M. Saburov},
  journal={arXiv: Number Theory},
  • F. Mukhamedov, C. H. Pah, M. Saburov
  • Published 2010
  • Mathematics, Physics
  • arXiv: Number Theory
  • We denote a polygon as a connected component in Cayley tree of order 2 containing certain number of fix vertices. We found an exact formula for a polygon counting problem for two cases, in which, for the first case the polygon contain a full connected component of a Cayley tree and for the second case the polygon contain two fixed vertices. From these formulas, which is in the form of finite linear combination of Catalan numbers, one can find the asymptotic estimation for a counting problem. 
    1 Citations

    Figures from this paper.


    An Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting
    • 3
    • PDF
    Correspondences between plane trees and binary sequences
    • 91
    A Natural Extension of Catalan Numbers
    • 3
    • PDF
    Self-Describing Sequences and the Catalan Family Tree
    • Zoran Sunik
    • Mathematics, Computer Science
    • Electron. J. Comb.
    • 2003
    • 6
    • PDF
    Catalan Numbers, Their Generalization, and Their Uses
    • 223
    • PDF
    Staircase tilings and k-Catalan structures
    • 39
    • PDF
    Permutations avoiding an increasing number of length-increasing forbidden subsequences
    • 41
    • PDF
    Catalan-like Numbers and Determinants
    • M. Aigner
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. A
    • 1999
    • 95
    Identities involving Narayana polynomials and Catalan numbers
    • 35
    • PDF
    The On-Line Encyclopedia of Integer Sequences
    • N. Sloane
    • Mathematics, Computer Science
    • Electron. J. Comb.
    • 1994
    • 4,816
    • Highly Influential
    • PDF