This volume offers an account of the theorems employed in combinatory analysis, showing their connections and uniting them as parts of a general doctrine. Topics include symmetric functions, theory of the compositions of numbers, distributions upon a chessboard, and partitions of multipartite numbers. 1915, 1916, and 1920 editions. Unabridged republication of two works combined in one volume: An Introduction to Combinatory Analysis, published by Cambridge University Press, 1920, and Combinatory Analysis, originally published in two volumes, Cambridge University Press, Cambridge, England, 1915, 1916.
Introduction to Combinatorial Analysis by John Riordan Introductory text surveys the theory of permutations and combinations associated with elementary algebra; the principle of inclusion and exclusion; and the theory of distributions and partitions in cyclic representation. Includes problems. 1958 edition.
Combinatorial Algorithms: Enlarged Second Edition by T. C. Hu, M. T. Shing This updated edition presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. Includes 153 black-and-white illustrations and 23 tables.
