國立虎尾科技大學 |

Lessons in Enumerative Combinatorics

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Lessons in Enumerative Combinatorics/ by Ömer Eğecioğlu, Adriano M. Garsia.
Author:	Eğecioğlu, Ömer.
other author:	Garsia, Adriano M.
Description:	XVI, 479 p. 329 illus., 3 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Discrete mathematics. -
Online resource:	https://doi.org/10.1007/978-3-030-71250-1
ISBN:	9783030712501

Lessons in Enumerative Combinatorics
Eğecioğlu, Ömer.

Lessons in Enumerative Combinatorics[electronic resource] /by Ömer Eğecioğlu, Adriano M. Garsia. - 1st ed. 2021. - XVI, 479 p. 329 illus., 3 illus. in color.online resource. - Graduate Texts in Mathematics,2902197-5612 ;. - Graduate Texts in Mathematics,222.

1. Basic Combinatorial Structures -- 2. Partitions and Generating Functions -- 3. Planar Trees and the Lagrange Inversion Formula -- 4. Cayley Trees -- 5. The Cayley–Hamilton Theorem -- 6. Exponential Structures and Polynomial Operators -- 7. The Inclusion-Exclusion Principle -- 8. Graphs, Chromatic Polynomials and Acyclic Orientations -- 9. Matching and Distinct Representatives.

This textbook introduces enumerative combinatorics through the framework of formal languages and bijections. By starting with elementary operations on words and languages, the authors paint an insightful, unified picture for readers entering the field. Numerous concrete examples and illustrative metaphors motivate the theory throughout, while the overall approach illuminates the important connections between discrete mathematics and theoretical computer science. Beginning with the basics of formal languages, the first chapter quickly establishes a common setting for modeling and counting classical combinatorial objects and constructing bijective proofs. From here, topics are modular and offer substantial flexibility when designing a course. Chapters on generating functions and partitions build further fundamental tools for enumeration and include applications such as a combinatorial proof of the Lagrange inversion formula. Connections to linear algebra emerge in chapters studying Cayley trees, determinantal formulas, and the combinatorics that lie behind the classical Cayley–Hamilton theorem. The remaining chapters range across the Inclusion-Exclusion Principle, graph theory and coloring, exponential structures, matching and distinct representatives, with each topic opening many doors to further study. Generous exercise sets complement all chapters, and miscellaneous sections explore additional applications. Lessons in Enumerative Combinatorics captures the authors' distinctive style and flair for introducing newcomers to combinatorics. The conversational yet rigorous presentation suits students in mathematics and computer science at the graduate, or advanced undergraduate level. Knowledge of single-variable calculus and the basics of discrete mathematics is assumed; familiarity with linear algebra will enhance the study of certain chapters.

ISBN: 9783030712501

Standard No.: 10.1007/978-3-030-71250-1doiSubjects--Topical Terms:

1254302
Discrete mathematics.

LC Class. No.: QA150-272

Dewey Class. No.: 511.1

Lessons in Enumerative Combinatorics
LDR:03690nam a22004095i 4500 001 1054154
003 DE-He213
005 20210908012610.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030712501 $9 978-3-030-71250-1
024 7 $a 10.1007/978-3-030-71250-1 $2 doi
035 $a 978-3-030-71250-1
050 4 $a QA150-272
072 7 $a PBD $2 bicssc
072 7 $a MAT008000 $2 bisacsh
072 7 $a PBD $2 thema
082 0 4 $a 511.1 $2 23
100 1 $a Eğecioğlu, Ömer. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1327062
245 1 0 $a Lessons in Enumerative Combinatorics $h [electronic resource] / $c by Ömer Eğecioğlu, Adriano M. Garsia.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVI, 479 p. 329 illus., 3 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Graduate Texts in Mathematics, $x 2197-5612 ; $v 290
505 0 $a 1. Basic Combinatorial Structures -- 2. Partitions and Generating Functions -- 3. Planar Trees and the Lagrange Inversion Formula -- 4. Cayley Trees -- 5. The Cayley–Hamilton Theorem -- 6. Exponential Structures and Polynomial Operators -- 7. The Inclusion-Exclusion Principle -- 8. Graphs, Chromatic Polynomials and Acyclic Orientations -- 9. Matching and Distinct Representatives.
520 $a This textbook introduces enumerative combinatorics through the framework of formal languages and bijections. By starting with elementary operations on words and languages, the authors paint an insightful, unified picture for readers entering the field. Numerous concrete examples and illustrative metaphors motivate the theory throughout, while the overall approach illuminates the important connections between discrete mathematics and theoretical computer science. Beginning with the basics of formal languages, the first chapter quickly establishes a common setting for modeling and counting classical combinatorial objects and constructing bijective proofs. From here, topics are modular and offer substantial flexibility when designing a course. Chapters on generating functions and partitions build further fundamental tools for enumeration and include applications such as a combinatorial proof of the Lagrange inversion formula. Connections to linear algebra emerge in chapters studying Cayley trees, determinantal formulas, and the combinatorics that lie behind the classical Cayley–Hamilton theorem. The remaining chapters range across the Inclusion-Exclusion Principle, graph theory and coloring, exponential structures, matching and distinct representatives, with each topic opening many doors to further study. Generous exercise sets complement all chapters, and miscellaneous sections explore additional applications. Lessons in Enumerative Combinatorics captures the authors' distinctive style and flair for introducing newcomers to combinatorics. The conversational yet rigorous presentation suits students in mathematics and computer science at the graduate, or advanced undergraduate level. Knowledge of single-variable calculus and the basics of discrete mathematics is assumed; familiarity with linear algebra will enhance the study of certain chapters.
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Discrete Mathematics. $3 796600
650 2 4 $a Mathematical Logic and Foundations. $3 669393
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
700 1 $a Garsia, Adriano M. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1327061
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030712495
776 0 8 $i Printed edition: $z 9783030712518
776 0 8 $i Printed edition: $z 9783030712525
830 0 $a Graduate Texts in Mathematics, $x 0072-5285 ; $v 222 $3 1254915
856 4 0 $u https://doi.org/10.1007/978-3-030-71250-1
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)