FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

First Course in Enumerative Combinatorics

Carl G. Wagner
    Product form
      FORMAT: Paperback / softback
      YOU COULD EARN 0 FUTURE RETAIL DISCOUNTS.

      This product is either out of print or out of stock. Add it to your wishlist and we will automatically let you know if it comes back into stock. Add to Wishlist

      ESTIMATED DELIVERY: Possibly out of print
      BUY NOW PAY LATER
      From R 0.00 per month!
      3x monthly payments of R 0.00 with
      4x fortnightly payments of R 0.00 with

      This product is either out of print or out of stock. Add it to your wishlist and we will automatically let you know if it comes back into stock. Add to Wishlist

      First Course in Enumerative Combinatorics provides an introduction to the fundamentals of enumeration for advanced undergraduates and beginning graduate students in the mathematical sciences. The book offers a careful and comprehensive account of the standard tools of enumeration—recursion, generating functions, sieve and inversion formulas, enumeration under group actions—and their application to counting problems for the fundamental structures of discrete mathematics, including sets and multisets, words and permutations, partitions of sets and integers, and graphs and trees. The author’s exposition has been strongly influenced by the work of Rota and Stanley, highlighting bijective proofs, partially ordered sets, and an emphasis on organizing the subject under various unifying themes, including the theory of incidence algebras. In addition, there are distinctive chapters on the combinatorics of finite vector spaces, a detailed account of formal power series, and combinatorial number theory.The reader is assumed to have a knowledge of basic linear algebra and some familiarity with power series. There are over 200 well-designed exercises ranging in difficulty from straightforward to challenging. There are also sixteen large-scale honors projects on special topics appearing throughout the text. The author is a distinguished combinatorialist and award-winning teacher, and he is currently Professor Emeritus of Mathematics and Adjunct Professor of Philosophy at the University of Tennessee. He has published widely in number theory, combinatorics, probability, decision theory, and formal epistemology. His Erdo?s number is 2. An instructor’s manual for this title is available electronically to those instructors who have adopted the textbook for classroom use. Please send email to textbooks@ams.org for more information.
      Format: Paperback / softback CONTRIBUTORS: Carl G. Wagner EAN: 9781470459956 COUNTRY: United States PAGES: WEIGHT: 0 g HEIGHT: 254 cm
      PUBLISHED BY: American Mathematical Society DATE PUBLISHED: 2020-11-01 CITY: GENRE: MATHEMATICS / Discrete Mathematics WIDTH: 178 cm SPINE:

      Book Themes:

      Discrete mathematics

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Carl G. Wagner, University of Tennessee, Knoxville, TN
      First Course in Enumerative Combinatorics provides an introduction to the fundamentals of enumeration for advanced undergraduates and beginning graduate students in the mathematical sciences. The book offers a careful and comprehensive account of the standard tools of enumeration—recursion, generating functions, sieve and inversion formulas, enumeration under group actions—and their application to counting problems for the fundamental structures of discrete mathematics, including sets and multisets, words and permutations, partitions of sets and integers, and graphs and trees. The author’s exposition has been strongly influenced by the work of Rota and Stanley, highlighting bijective proofs, partially ordered sets, and an emphasis on organizing the subject under various unifying themes, including the theory of incidence algebras. In addition, there are distinctive chapters on the combinatorics of finite vector spaces, a detailed account of formal power series, and combinatorial number theory.The reader is assumed to have a knowledge of basic linear algebra and some familiarity with power series. There are over 200 well-designed exercises ranging in difficulty from straightforward to challenging. There are also sixteen large-scale honors projects on special topics appearing throughout the text. The author is a distinguished combinatorialist and award-winning teacher, and he is currently Professor Emeritus of Mathematics and Adjunct Professor of Philosophy at the University of Tennessee. He has published widely in number theory, combinatorics, probability, decision theory, and formal epistemology. His Erdo?s number is 2. An instructor’s manual for this title is available electronically to those instructors who have adopted the textbook for classroom use. Please send email to textbooks@ams.org for more information.
      Format: Paperback / softback CONTRIBUTORS: Carl G. Wagner EAN: 9781470459956 COUNTRY: United States PAGES: WEIGHT: 0 g HEIGHT: 254 cm
      PUBLISHED BY: American Mathematical Society DATE PUBLISHED: 2020-11-01 CITY: GENRE: MATHEMATICS / Discrete Mathematics WIDTH: 178 cm SPINE:

      Book Themes:

      Discrete mathematics

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Carl G. Wagner, University of Tennessee, Knoxville, TN

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account