论文信息 - The basic concepts of Polya's theory of enumeration, with application to the structural classification of mechanisms

The basic concepts of Polya's theory of enumeration, with application to the structural classification of mechanisms

Abstract The purpose of these notes is essentially tutorial: to present to engineers the basic concepts of Polya's theory in a self-contained manner. Following a review of preliminary concepts (permutations, groups and graphs), Polya's “Hauptsatz” is stated without proof and its use illustrated with reference to the structural classification of mechanisms.

Ferdinand Freudenstein | F. Freudenstein

[1] John Riordan,et al. Introduction to Combinatorial Analysis , 1958 .

[2] John Riordan,et al. The Combinatorial Significance of a Theorem of Pólya , 1957 .

[3] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[4] de Ng Dick Bruijn. Pólya's theory of counting , 1964 .

[5] F. Harary. THE NUMBER OF LINEAR, DIRECTED, ROOTED, AND CONNECTED GRAPHS , 1955 .

[6] Frank Erskine Crossley. On an unpublished work of Alt , 1966 .

[7] Trevor H. Davies,et al. Structural analysis of plane linkages by Franke's condensed notation , 1966 .

[8] O. Ore,et al. Graphs and Their Uses , 1964 .

[9] L. S. Woo,et al. Type Synthesis of Plane Linkages , 1967 .

[10] F. Freudenstein,et al. On a theory for the type synthesis of mechanisms , 1966 .

[11] O. Ore. Theory of Graphs , 1962 .