Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Combinatorial Methods with Computer Applications - Jonathan L. Gross

Combinatorial Methods with Computer Applications

Buch | Hardcover
726 Seiten
2007
Chapman & Hall/CRC (Verlag)
978-1-58488-743-0 (ISBN)
CHF 199,95 inkl. MwSt
Covers core areas such as sequences, recursions, generating functions, evaluation of sums, and graphs. This book discusses topics like partitions and polynomials, algebraic counting, and designs.
Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.

After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation expressions, binomial coefficients, partitions and permutations, and integer methods. The author then focuses on graph theory, covering topics such as trees, isomorphism, automorphism, planarity, coloring, and network flows. The final chapters discuss automorphism groups in algebraic counting methods and describe combinatorial designs, including Latin squares, block designs, projective planes, and affine planes. In addition, the appendix supplies background material on relations, functions, algebraic systems, finite fields, and vector spaces.

Paving the way for students to understand and perform combinatorial calculations, this accessible text presents the discrete methods necessary for applications to algorithmic analysis, performance evaluation, and statistics as well as for the solution of combinatorial problems in engineering and the social sciences.

Columbia University, New York, USA

Preface. Introduction to Combinatorics. Sequences. Solving Recurrences. Evaluating Sums. Subsets and Binomials. Partitions and Permutations. Integer Operators. Graph Fundamentals. Graph Theory Topics. Graph Enumeration. Designs. Appendix. Bibliography. Solutions and Hints. Indices.

Erscheint lt. Verlag 11.12.2007
Reihe/Serie Discrete Mathematics and Its Applications
Zusatzinfo 287 Illustrations, black and white
Sprache englisch
Maße 178 x 254 mm
Gewicht 1315 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 1-58488-743-5 / 1584887435
ISBN-13 978-1-58488-743-0 / 9781584887430
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95