This book introduces combinatorial analysis to the beginning student. The author begins with the theory of permutation and combinations and their applications to generating functions. In subsequent chapters, he presents Bell polynomials; the principle of inclusion and exclusion; the enumeration of permutations in cyclic representation; the theory of distributions; partitions, compositions, trees and linear graphs; and the enumeration of restricted permutations.

Originally published in 1980.

The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books while presenting them in durable paperback editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

This book introduces combinatorial analysis to the beginning student. The author begins with the theory of permutation and combinations and their applications to generating functions. In subsequent chapters, he presents Bell polynomials; the principle of inclusion and exclusion; the enumeration of permutations in cyclic representation; the theory of distributions; partitions, compositions, trees and linear graphs; and the enumeration of restricted permutations. Originally published in 1980. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Published for the fortieth anniversary of the final days of the Vietnam War, this is the suspenseful and moving tale of how John Riordan, an assistant manager of Citibank's Saigon branch, devised a daring plan to save 106 Vietnamese from the dangers of the Communist takeover.Riordan,who had served in the US Army after the Tet Offensive and had left the military behind for a career in international banking,was not the type to take dramatic action, but once the North Vietnamese Army closed in on Saigon in April 1975 and it was clear that Riordan's Vietnamese colleagues and their families would be stranded in a city teetering on total collapse, he knew he could not leave them behind. Defying the objections of his superiors and going against the official policy of the United States, Riordan went back into Saigon to save them.In fifteen harrowing trips to Saigon's airport, he maneuvered through the bureaucratic shambles, claiming that the Vietnamese were his wife and scores of children. It was a ruse that, at times, veered close to failure, yet against all odds, the improbable plan succeeded. At great risk, the Vietnamese left their lives behind to start anew in the United States, and now John is known to his grateful Vietnamese colleagues and hundreds of their American descendants as Papa. They Are All My Family is a vivid narrative of one man's ingenious strategy which transformed a time of enormous peril into a display of extraordinary courage. Reflecting on those fateful days in this account, John Riordan's modest heroism provides a striking contrast to America's ignominious retreat from the decade of conflict.

This introduction to combinatorial analysis defines the subject as "the number of ways there are of doing some well-defined operation." Chapter 1 surveys that part of the theory of permutations and combinations associated with elementary algebra, which leads to the extended treatment of generating functions in Chapter 2. Chapter 3 considers the principle of inclusion and exclusion, which is indispensable to the enumeration of permutations with restricted position given in Chapters 7 and 8. Chapter 4 examines the enumeration of permutations in cyclic representation, while Chapter 5 surveys the theory of distributions and Chapter 6 considers partitions, compositions, and the enumeration of trees and linear graphs. Each chapter includes a problem section. Unabridged republication of the edition published by John Wiley & Sons, Inc., Canada, 1958.