Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-26T06:06:38.819Z Has data issue: false hasContentIssue false
  • English
  • Français

The generalization of Lagrange's expansion and the enumeration of trees

Published online by Cambridge University Press:  24 October 2008

I. J. Good
I. J. Good
Affiliation:
Trinity College, Oxford
Get access Rights & Permissions [Opens in a new window]

Extract

In a previous paper ((8)), the joint probability generating function was written down for the sizes of the generations in a tree consisting of c distinct species or colours. It was pointed out in (12) that a generalization of Lagrange's expansion could be applied in order to obtain explicit formulae in some circumstances. The techniques have received new application, to polymer chemistry, in (16), (15), and (17). This application should not be confused with the application of the enumeration of trees to that of isomers ((4), (2), (26)). It was further pointed out in (12) that the technique could be applied to some problems concerning the enumeration of ‘ordered’ (planar) trees. This idea is here developed further, and is applied also to ‘labelled’ trees ‘ordered within colours’. One of our objectives is to specify some circumstances in which iterated generating functions, and consequently also the generalization of Lagrange's expansion, are applicable. The examples show how the techniques can be applied almost automatically in order to deduce results, both old and new. The number of labelled ‘chromatic’ trees with c colours is found: Scoins gave the result for c = 2.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 61 , Issue 2 , April 1965 , pp. 499 - 517
Copyright
Copyright © Cambridge Philosophical Society 1965

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Berge, C.The theory of graphs and its applications (London and New York, 1952).Google Scholar
(2)Blair, C. M. and Henze, H. R.The number of structurally isomeric alcohols of the methanol series (and similar titles). J. Amer. Chem. Soc. 53 (1931), 3042–46, 3077–85; 54 (1932), 1098–1106, 1538–1545; 55 (1933), 680–685; 56 (1934), 157.Google Scholar
(3)Bott, R. and Mayberry, J. P. Matrices and trees. In Economic activity analysis (ed. Morgenstern, O.; London and New York, 1954).Google Scholar
(4)Cayley, A. On the theory of the analytical forms called trees (and other titles). Collected mathematical papers (Cambridge, 1889–1897): 2, 1–7; 3, 242–246; 4, 112–115; 9, 202–204, 427–460, 544–545; 10, 598–600; 11, 365–367; 13, 26–28. (These articles were originally published in the period 1857–1889.)Google Scholar
(5)Dawson, R. and Good, I. J.Exact Markov probabilities from oriented linear graphs. Ann. Math. Statist. 28 (1957), 946–956.Google Scholar
(6)Foulkes, H. O.On Redfield's group reduction functions. Canad. J. Math. 15 (1963), 272–284.Google Scholar
(7)Glickman, S.On the representation and enumeration of trees. Proc. Cambridge Philos. Soc. 59 (1963), 509–517.Google Scholar
(8)Good, I. J.The joint distribution for the sizes of the generations in a cascade process. Proc. Cambridge Philos. Soc. 51 (1955), 240–242. (Reprinted, with the correction of a misprint, as an appendix to (16).)Google Scholar
(9)Good, I. J.A new finite series for Legendre polynomials. Proc. Cambridge Philos. Soc. 51 (1955), 385–388.Google Scholar
(10)Good, I. J.Saddle-point methods for the multinomial distribution. Ann. Math. Statist. 28 (1957), 861–881. (Continued and corrected in (13).)CrossRefGoogle Scholar
(11)Good, I. J.Legendre polynomials and trinomial random walks. Proc. Cambridge Philos. Soc. 54 (1958), 39–42.CrossRefGoogle Scholar
(12)Good, I. J.Generalizations to several variables of Lagrange's expansion, with applications to stochastic processes. Proc. Cambridge Philos. Soc. 56 (1960), 367–380.Google Scholar
(13)Good, I. J.The multivariate saddle-point method and chi-squared for the multinomial distribution. Ann. Math. Statist. 32 (1961), 535–548.Google Scholar
(14)Good, I. J.A short proof of MacMahon's ‘Master Theorem’. Proc. Cambridge Philos. Soc. 58 (1962), 160.Google Scholar
(15)Good, I. J.Cascade theory and the molecular weight averages of the sol fraction. Proc. Roy. Soc. Ser. A, 272 (1963), 54–59.Google Scholar
(16)Gordon, M.Good's theory of cascade processes applied to the statistics of polymer distributions. Proc. Roy. Soc. Ser. A, 268 (1962), 240–259.Google Scholar
(17)Gordon, M. and Scantlebury, G. R. Non-random polycondensation: statistical theory of the substitution effect. (To appear.)Google Scholar
(18)Harary, F.Unsolved problems in the enumeration of graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960), 63–95.Google Scholar
(19)Harary, F. and Prins, G.The number of homeomorphically irreducible trees, and other species. Acta Math. 101 (1959), 141–162.Google Scholar
(20)Jeffreys, H and Jeffreys, B.Methods of mathematical physics (Cambridge, 1956).Google Scholar
(21)Kirchhoff, G.Ueber die Auflösung der Gleichungen, auf man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Annalen der Physik und Chemie (Poggendorff), 72 (1847), 497–508.Google Scholar
(22)Laplace, P. S.Mémoire sur l'usage du calcul aux différences partielles dans la théorie des suites. Mem. Acad. Roy. Sci. Paris (1777), 99–122. Also in Oeuves de Laplace, vol. ix (Paris, 1893).Google Scholar
(23)MacMahon, P. A.Combinatory analysis, vol. i (Cambridge, 1916; New York, 1960).Google Scholar
(24)Muir, T.A treatise on the theory of determinants (London, 1933; New York, 1960).Google Scholar
(25)Otter, R.The number of trees. Ann. of Math. 49 (1948), 583–599.Google Scholar
(26)Pólya, G.Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, und chemische Verbindungen. Acta Math. 68 (1937), 145–253.Google Scholar
(27)Redfield, J. H.The theory of group reduced distributions. Amer. J. Math. 49 (1927), 433–455.Google Scholar
(28)Riordan, J.The numbers of labelled coloured and chromatic trees. Acta Math. 97 (1957), 211–225.Google Scholar
(29)Riordan, J.An introduction to combinatorial analysis (New York and London, 1958).Google Scholar
(30)Scoins, H. I.The number of trees with nodes of alternate parity. Proc. Cambridge Philos. Soc. 58 (1962), 12–16.Google Scholar
(31)Uhlenbeck, G. E. and Ford, G. W. The theory of linear graphs with applications to the theory of the virial development of the properties of gases. In Studies in statistical mechanics, vol. i (ed. de Boer, J. and Uhlenbeck, G. E.; Amsterdam, 1962).Google Scholar