Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees

DOI10.1142/S179355712250187XMaRDI QIDQ5876836zbMATH OpenOpenAlexFDO

Authors Helmut Prodinger

Publication date 2 February 2023

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.06793

zbMATH Keywords

cubic equationternary treesmiddle edges

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Abstract: The sequence A120986 in the Encyclopedia of Integer Sequences counts ternary trees according to the number of nodes and the number of middle edges. Using a certain substition, the underlying cubic equation can be factored. This leads to an extension of the concept of $(3/2)$-ary trees, introduced by Knuth in his christmas lecture from 2014.

Recommendations

• scientific article; zbMATH DE number 4035870
• On the number of t-ary trees with a given path length
• A subclass of labeled ternary trees and its generalization
• Counting trees in graphs
• scientific article; zbMATH DE number 4025461
• Enumeration of spanning trees of middle graphs
• Counting labelled trees with given indegree sequence
• A new method for counting trees with vertex partition
• \((2,1)\)-Total number of trees with maximum degree three
• Enumerating k-way trees

Cites work

• On some problems about ternary paths: a linear algebra approach
• The On-Line Encyclopedia of Integer Sequences
• Walks confined in a quadrant are not always D-finite

Cited in

(2)

• Note on the number of rooted complete \(N\)-ary trees.
• A note on naturally embedded ternary trees

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5876836)