Using linear forms to determine the set of integers realizable by (g_ 0,g_ 1, ,g_ n)-trees
Using linear forms to determine the set of integers realizable by \((g 0,g 1,\dots ,g n)\)-trees
The paper deals with the problem, how many leaves a tree can have whose internal nodes all have outvalences (number of immediate successors) out of \(g_ 0,g_ 1,...,g_ n\) and all of whose leaves are on the same level. Of particular interest is the conductor which is the least number, such that all \(N\geq k\) can occur as numbers of leaves for such trees. Since the number of leaves can be counted by \(1+(g_ 0-1)x_ 0+...+(g_ n-1)x_ n,\) where \(x_ i\) is the number of nodes of outvalence \(g_ i\), the integers in question are in intimate connection to the values the linear form \(\sum (g_ i-1)x_ i\) takes. Large intervals in the set of solutions are determined and bounds for the conductor are given.
- 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
- (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
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)
