F. Harary, R.W. Robinson and A.J. Schwenk, Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc. Ser. A. 20 (1975) 483-503; Corrigenda, 41 (1986) 325. 7  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... In this section we consider related problems that arise when a generating function f(z) satisfies a functional equation f(z) G(z, f(z) Such equations arise frequently in graphical enumeration, and there is a standard procedure invented by Polya and developed by Otter that is almost algorithmic [188, 189] and routinely leads to them. Typically G(z, w) is analytic in z and w in a small neighborhood of (0, 0) Zeros of analytic functions in more than one dimension are not isolated, and by the implicit function theorem G(z, w) w is solvable for w as a function of 103 z, except for those points ....

F. Harary, R. W. Robinson, and A. J. Schwenk, Twenty--step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc. (Series A), 20 (1975), pp. 483--503.

....consist of a single tree. Here are some observations about certain types of trees. the electronic journal of combinatorics 7 (2000) #R33 6 ffl Unlabeled Trees: Let Tn (resp. t n ) be the number of unlabeled, n vertex, rooted (resp. unrooted) trees of some type. See Harary, Robinson, and Schwenk [15] for information on estimating Tn and t n . In many cases, it can be shown that Tn An Gamma3=2 R Gamman and t n bn Gamma5=2 R Gamman and so our theorem applies. ffl Labeled Trees: In a variety of cases the exponential generating function for the rooted enumerator satisfies T (x) ....

F. Harary, R. W. Robinson, and A. J. Schwenk, Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc., Ser. A 20 (1975) 483--503.

.... basic method used there was developed by Polya [32] and perfected by Otter [31] Their method is presented also in [16] and it is so well understood that a few years ago a paper was written with the title Twenty step algorithm for determining the asymptotic number of trees of various species [17]. The word algorithm in the title of that paper should not be interpreted literally; what those authors present is a sequence of steps, illustrated by examples, which are to be followed in enumerating unlabeled trees. If S n denotes the number of rooted trees of a particular kind with n ....

....behavior of the appropriate generating functions that are sufficient to obtain asymptotic estimates of the coefficients of these functions. Although the methodology used on the problems presented in this survey is not systematic enough to permit the writing of a paper with a title like that of [17], it is hoped that the variety of results and methods that have been discussed will be a convincing demonstration of the utility of nonlinear iteration methods and will lead to further research in that field. ....

F. Harary, R. W. Robinson, and A. J. Schwenk, Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austr. Math. Soc., Ser. A., 20 (1975), 483-503.

....from the analysis of singularities for implicitly defined generating functions. The reader should turn to the literature on graphical enumerations [41] and especially to a paper by Harary, Robinson and Schwenk where a subclass of asymptotic problems on graph trees is shown to be decidable [42]. Labelled Iterative structures Algebraic logarithmic structures Exponentially singular structures Entire structures General LI structures Unlabelled Iterative structures Regular languages and finite automata General UI structures Labelled Recursive structures ....

.... Recursive structures Quadratic structures Algebraic structures; W structures Simple families of Meir and Moon [59] General LR structures Unlabelled Recursive structures Context free languages [30] Simple families of Meir and Moon [59] Graph trees of Harary et al. [42] General UR structures Figure 4: A classification of some families of structures 6 Conclusions A coherent class of elementary combinatorial problems can only lead to designated special asymptotic forms. We have mentioned in the introduction that properties definable by regular languages ....

Harary, F., Robinson, R. W., and Schwenk, A. J. Twenty-step algorithm for determining the asymptotic number of trees of various species. J. Austral. Math. Soc. (Series A) 20 (1975), 483--503.

....paper. As we expect the method will be unfamiliar to many readers, and as many of the papers concerned contain much very interesting, but for the present purposes distracting, additional material, we will briefly sketch the method. Further examples of its use, and justification, can be found in [18, 3, 8, 9, 6, 16, 30, 27, 31], as well as the already cited early paper of Riordan and Shannon In the applications of interest, the number of trees of a certain sort with n leaves will be determined by the (real, nonnegative) coefficient of x n in an exponential or ordinary generating series T (x) T 1 x T 2 x 2 ....

F. Harary, R. W. Robinson and A. J. Schwenk. Twenty--step algorithm for determining the asymptotic number of trees of various species. J. Austral. Math. Soc., Series A, 20:483--503, 1975.

No context found.

F. Harary, R.W. Robinson and A.J. Schwenk, Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc. Ser. A. 20 (1975) 483-503; Corrigenda, 41 (1986) 325. 7

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC