In this volume, the editor presents reprints of most of the fundamental papers of Gian-Carlo Rota in the classical core of cominatorics. These include Part I, III, IV, VI and VII of the Foundation series on Mobius fuction, polynomials of binomial type, counting in vector spaces, generating functions and symmetric functions. Also reprinted are papers which are derived or related to the themes explored in these central papers. Rota's work, starting with the paper, "On the Foundations of Combinatorial Theory: I - Theory of Mobius Functions" (1964) has revolutionized the way we approach combinatorics; this volume is intended to be an introduction to his way of thinking about that subject. Kung has provided a substantial amount of new material on the impact that Rota's papers have had on combinatorics. Extensive survey articles are included in each chapter to guide the reader, both to the reprinted papers and to the works of others which have been inspired by these papers. There are also four prefatory essays describing Rota's special influence on combinatorics, particularly at the historical Bowdoin conference in 1970. This book is intended for experts as well as beginning graduate students (particularly as a source for research problems).
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
One of the most useful principles of enumeration in discrete probability and combinatorial theory is the celebrated principle of inclusion-exclusion (cf. FELLER, FRECHET, RIORDAN, RYSER). Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
full binomial type, incidence coalgebra, reduced incidence algebra, urnbral calculus, generalized arithmetic functions, hereditary bialgebras, umbral algebra, upper factorials, reluctant functions, bisection coefficients, bisymmetric function, cyclotomic identity, binomial enumeration, sum ranges over the set, umbral operator, lower factorials, doubly stochastic measures, polynomial symmetric functions, umbral calculus, algebras and combinatorial identities, incidence lattice, simplicial geometries, unrelated subset, rook polynomials, symmetric chain decomposition Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Theory Ser, Academic Press, Discrete Math, Massachusetts Institute of Technology, Los Alamos, Philip Hall, American Mathematical Society, Cambridge Univ, Lecture Notes, Rhode Island, Algebra Universalis, Department of Mathematics, Birkhoff-von Neumann Theorem, Coding Theorem, New Mexico, Polya's Theorem, Oxford Univ, California Press, Catherine Press Ltd, Marcel Dekker, All Rights Reserved, Birkhoff's Problem, Cambridge Philos, Garrett Birkhoff New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Front Flap | Table of Contents | First Pages | Back Flap | Back Cover | Surprise Me!
One of the most useful principles of enumeration in discrete probability and combinatorial theory is the celebrated principle of inclusion-exclusion (cf. FELLER, FRECHET, RIORDAN, RYSER). Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
full binomial type, incidence coalgebra, reduced incidence algebra, urnbral calculus, generalized arithmetic functions, hereditary bialgebras, umbral algebra, upper factorials, reluctant functions, bisection coefficients, bisymmetric function, cyclotomic identity, binomial enumeration, sum ranges over the set, umbral operator, lower factorials, doubly stochastic measures, polynomial symmetric functions, umbral calculus, algebras and combinatorial identities, incidence lattice, simplicial geometries, unrelated subset, rook polynomials, symmetric chain decomposition Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Theory Ser, Academic Press, Discrete Math, Massachusetts Institute of Technology, Los Alamos, Philip Hall, American Mathematical Society, Cambridge Univ, Lecture Notes, Rhode Island, Algebra Universalis, Department of Mathematics, Birkhoff-von Neumann Theorem, Coding Theorem, New Mexico, Polya's Theorem, Oxford Univ, California Press, Catherine Press Ltd, Marcel Dekker, All Rights Reserved, Birkhoff's Problem, Cambridge Philos, Garrett Birkhoff New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Front Flap | Table of Contents | First Pages | Back Flap | Back Cover | Surprise Me!
Citations (learn more)
This book cites 61
books:
See all 61 books this book cites
1
book
cites this book:
- Combinatorial Theory (Wiley Classics Library) by Marshall Hall on 6 pages
- Combinatorial Geometries (Encyclopedia of Mathematics and its Applications) by Neil White on 5 pages
- Ordered Sets (NATO Science Series C: (closed)) by Ivan Rival on 4 pages
- Introduction to Combinatorial Analysis (Dover Books on Mathematics) by John Riordan on page 72, page 260, and page 276
- Studies in Combinatorics (Maa Studies in Mathematics) by Gian-Carol Rota on page 212, page 578, and page 580
See all 61 books this book cites
- Gian-Carlo Rota on Analysis and Probability by Jean Dhombres on page 282
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
