國立虎尾科技大學 |

Discrete structures

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Discrete structures/ by Andreas Klappenecker, Hyunyoung Lee.
作者:	Klappenecker, Andreas.
其他作者:	Lee, Hyunyoung.
出版者:	Cham :Springer Nature Switzerland : : 2025.,
面頁冊數:	xv, 423 p. :ill. (some col.), digital ; : 24 cm.;
Contained By:	Springer Nature eBook
標題:	Mathematical Applications in Computer Science. -
電子資源:	https://doi.org/10.1007/978-3-031-73434-2
ISBN:	9783031734342

Discrete structures
Klappenecker, Andreas.

Discrete structures[electronic resource] /by Andreas Klappenecker, Hyunyoung Lee. - Cham :Springer Nature Switzerland :2025. - xv, 423 p. :ill. (some col.), digital ;24 cm. - Undergraduate texts in mathematics,2197-5604. - Undergraduate texts in mathematics..

Preface -- Notation -- I. Discrete Structures -- 1. Introduction -- 2. Mathematical Arguments -- 3. Sets -- 4. Proof by Induction -- 5. Equivalence Relations -- 6. Partial Orders and Lattices -- 7. Floor and Ceiling Functions -- 8. Number Theory -- II. Summation and Asymptotics -- 10. Asymptotic Analysis -- III. Combinatorics -- 11. Counting -- 12. Generating Functions -- 13. Recurrence Relations -- 14. Graphs -- 15. Probability -- Bibliography -- Index.

The aim of this text is to introduce discrete mathematics to beginning students of mathematics or computer science. It does this by bringing some coherency into the seemingly incongruent subjects that compose discrete math, such as logic, set theory, algebra, and combinatorics. It emphasizes their theoretical foundations and illustrates proofs along the way. The book prepares readers for the analysis of algorithms by discussing asymptotic analysis and a discrete calculus for sums. The book also deduces combinatorial methods from the foundations that are laid out. Unlike other texts on this subject, there is a greater emphasis on foundational material that leads to a better understanding. To further assist the reader in grasping and practicing concepts, roughly 690 exercises are provided at various levels of difficulty. Readers are encouraged to study the examples in the text and solve as many of the exercises as possible. The text is intended for freshman or sophomore undergraduate students in mathematics, computer science, or similar majors. The assumed background is precalculus. The chapter dependency chart included is designed to help students, independent readers, and instructors follow a systematic path for learning and teaching the material, with the option to explore material in later chapters.

ISBN: 9783031734342

Standard No.: 10.1007/978-3-031-73434-2doiSubjects--Topical Terms:

815331
Mathematical Applications in Computer Science.

LC Class. No.: QA297.4

Dewey Class. No.: 511.1

Discrete structures
LDR:02810nam a2200337 a 4500 001 1161524
003 DE-He213
005 20250218115238.0
006 m d
007 cr nn 008maaau
008 251029s2025 sz s 0 eng d
020 $a 9783031734342 $q (electronic bk.)
020 $a 9783031734335 $q (paper)
024 7 $a 10.1007/978-3-031-73434-2 $2 doi
035 $a 978-3-031-73434-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA297.4
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
090 $a QA297.4 $b .K63 2025
100 1 $a Klappenecker, Andreas. $3 1488453
245 1 0 $a Discrete structures $h [electronic resource] / $c by Andreas Klappenecker, Hyunyoung Lee.
260 $a Cham : $c 2025. $b Springer Nature Switzerland : $b Imprint: Springer,
300 $a xv, 423 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Undergraduate texts in mathematics, $x 2197-5604
505 0 $a Preface -- Notation -- I. Discrete Structures -- 1. Introduction -- 2. Mathematical Arguments -- 3. Sets -- 4. Proof by Induction -- 5. Equivalence Relations -- 6. Partial Orders and Lattices -- 7. Floor and Ceiling Functions -- 8. Number Theory -- II. Summation and Asymptotics -- 10. Asymptotic Analysis -- III. Combinatorics -- 11. Counting -- 12. Generating Functions -- 13. Recurrence Relations -- 14. Graphs -- 15. Probability -- Bibliography -- Index.
520 $a The aim of this text is to introduce discrete mathematics to beginning students of mathematics or computer science. It does this by bringing some coherency into the seemingly incongruent subjects that compose discrete math, such as logic, set theory, algebra, and combinatorics. It emphasizes their theoretical foundations and illustrates proofs along the way. The book prepares readers for the analysis of algorithms by discussing asymptotic analysis and a discrete calculus for sums. The book also deduces combinatorial methods from the foundations that are laid out. Unlike other texts on this subject, there is a greater emphasis on foundational material that leads to a better understanding. To further assist the reader in grasping and practicing concepts, roughly 690 exercises are provided at various levels of difficulty. Readers are encouraged to study the examples in the text and solve as many of the exercises as possible. The text is intended for freshman or sophomore undergraduate students in mathematics, computer science, or similar majors. The assumed background is precalculus. The chapter dependency chart included is designed to help students, independent readers, and instructors follow a systematic path for learning and teaching the material, with the option to explore material in later chapters.
650 2 4 $a Mathematical Applications in Computer Science. $3 815331
650 0 $a Discrete mathematics. $3 1254302
700 1 $a Lee, Hyunyoung. $3 1488454
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
830 0 $a Undergraduate texts in mathematics. $3 881276
856 4 0 $u https://doi.org/10.1007/978-3-031-73434-2
950 $a Mathematics and Statistics (SpringerNature-11649)