Using linear forms to determine the set of integers realizable by (g_ 0,g_ 1, ,g_ n)-trees

DOI10.1016/0012-365X(83)90095-XzbMATHMaRDI QIDQ799683FDO

Authors Charles A. Jones

Publication date 1983

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

conductornumber of leaves

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Recommendations

• On the ``tree structure of natural numbers
• The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.
• On plane trees with a prescribed number of valency set realizations
• The proportion of trees that are linear
• Graphic sequences of trees and a problem of Frobenius

Cites work

• (g//0,g//1,\dots ,g//k)-trees and unary OL systems
• On a Problem of Partitions
• On a Problem of Partitions II
• On the correspondence between AVL trees and brother trees
• On the linear diophantine problem of Frobenius.
• Periodic oscillations of coefficients of power series that satisfy functional equations
• Representations of integers by linear forms in nonnegative integers

Cited in

(1)

• Types in the \(n\)-adic tree and minimal analytic gaps

This page was built for publication: Using linear forms to determine the set of integers realizable by \((g_ 0,g_ 1,\dots ,g_ n)\)-trees

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