IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v55y2024i1d10.1007_s13226-022-00350-6.html
   My bibliography  Save this article

Some refined enumerations of hybrid binary trees

Author

Listed:
  • Lin Yang

    (Lanzhou University of Technology)

  • Feng-Yun Ren

    (Lanzhou University of Technology)

  • Sheng-Liang Yang

    (Lanzhou University of Technology)

Abstract

A hybrid binary tree is a complete binary tree where each internal node is labeled with 1 or 2, but with no left (1, 1)-edges. In this paper, we consider enumeration of the set of hybrid binary trees according to the number of internal nodes and some other combinatorial parameters. We present enumerative results by giving Riordan arrays, bivariate generating functions, as well as closed formulas. As a consequence, we obtain some new combinatorial matrices, one of which is analogous to the Borel triangle. We also present a bijection between the set of all hybrid binary trees with n internal nodes and the set of generalized Schröder paths from (0, 0) to (2n, 0) which are consist of up steps $$u=(1,1)$$ u = ( 1 , 1 ) , horizontal steps $$h=(2,0)$$ h = ( 2 , 0 ) , down steps $$d=(1,-1)$$ d = ( 1 , - 1 ) , and double up steps $$U =(2,2)$$ U = ( 2 , 2 ) , and never travel below the x-axis.

Suggested Citation

  • Lin Yang & Feng-Yun Ren & Sheng-Liang Yang, 2024. "Some refined enumerations of hybrid binary trees," Indian Journal of Pure and Applied Mathematics, Springer, vol. 55(1), pages 94-104, March.
    • Handle: RePEc:spr:indpam:v:55:y:2024:i:1:d:10.1007_s13226-022-00350-6
    DOI: 10.1007/s13226-022-00350-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-022-00350-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13226-022-00350-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:indpam:v:55:y:2024:i:1:d:10.1007_s13226-022-00350-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.