Introduction to Combinatorics

Regular price €62.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=John C. George
A01=Walter D. Wallis
Adjacency Matrix
advanced combinatorial problem solving
Author_John C. George
Author_Walter D. Wallis
Balanced Incomplete Block Design
Binomial Coefficients
Bipartite Graph
Category=PBD
Category=PBV
Chromatic Number
Coding Theory
Combinatorial Interest
Combinatorics
Complete Graph
Computer Algebra Systems
Connected Graph
Degree Sequence
EGF
Enumeration
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Euler Circuit
experimental design methods
extremal set theory
Fibonacci Numbers
generating functions
Graph Theory
Hamilton Cycle
Hamilton Path
Hasse Diagram
Idempotent Latin Squares
inclusion exclusion principle
Integers Modulo
Latin Squares
Mol
Orthogonal Latin Squares
Partial Latin Square
Probability
Ramsey theory
recurrence relations
Stirling Numbers
Straight Flush
Symmetric Balanced Incomplete Block Design

Product details

  • ISBN 9781032476995
  • Weight: 880g
  • Dimensions: 152 x 229mm
  • Publication Date: 21 Jan 2023
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
Secure checkout Fast Shipping Easy returns

What Is Combinatorics Anyway?

Broadly speaking, combinatorics is the branch of mathematics dealing

with different ways of selecting objects from a set or arranging objects. It

tries to answer two major kinds of questions, namely, counting questions: how many ways can a selection or arrangement be chosen with a particular set of properties; and structural

questions: does there exist a selection or arrangement of objects with a

particular set of properties?

The authors have presented a text for students at all levels of preparation.

For some, this will be the first course where the students see several real proofs.

Others will have a good background in linear algebra, will have completed the calculus

stream, and will have started abstract algebra.

The text starts by briefly discussing several examples of typical combinatorial problems

to give the reader a better idea of what the subject covers. The next

chapters explore enumerative ideas and also probability. It then moves on to

enumerative functions and the relations between them, and generating functions and recurrences.,

Important families of functions, or numbers and then theorems are presented.

Brief introductions to computer algebra and group theory come next. Structures of particular

interest in combinatorics: posets, graphs, codes, Latin squares, and experimental designs follow. The

authors conclude with further discussion of the interaction between linear algebra

and combinatorics.

Features



  • Two new chapters on probability and posets.




  • Numerous new illustrations, exercises, and problems.




  • More examples on current technology use




  • A thorough focus on accuracy




  • Three appendices: sets, induction and proof techniques, vectors and matrices, and biographies with historical notes,




  • Flexible use of MapleTM and MathematicaTM


W.D. Wallis is Professor Emeritus of Southern Illiniois University. John C George is Asscoiate Professor at Gordon State College.

More from this author