Combinatorics and Number Theory of Counting Sequences: Discrete Mathematics and Its Applications
Autor Istvan Mezoen Limba Engleză Paperback – 21 ian 2023
The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics.
In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too.
Features
- The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems.
- An extensive bibliography and tables at the end make the book usable as a standard reference.
- Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 304.28 lei 6-8 săpt. | |
CRC Press – 21 ian 2023 | 304.28 lei 6-8 săpt. | |
Hardback (1) | 1181.53 lei 6-8 săpt. | |
CRC Press – 20 aug 2019 | 1181.53 lei 6-8 săpt. |
Din seria Discrete Mathematics and Its Applications
- 8% Preț: 404.91 lei
- 8% Preț: 550.28 lei
- 20% Preț: 571.04 lei
- 8% Preț: 409.44 lei
- 9% Preț: 1497.66 lei
- 18% Preț: 784.12 lei
- 18% Preț: 1092.37 lei
- 15% Preț: 556.82 lei
- 20% Preț: 799.88 lei
- 18% Preț: 1126.20 lei
- 18% Preț: 718.18 lei
- 25% Preț: 1305.48 lei
- 26% Preț: 880.31 lei
- 18% Preț: 774.35 lei
- 15% Preț: 493.80 lei
- 15% Preț: 673.22 lei
- 20% Preț: 466.57 lei
- 26% Preț: 681.14 lei
- 15% Preț: 475.40 lei
- 26% Preț: 1181.53 lei
- 25% Preț: 1245.88 lei
- 22% Preț: 352.41 lei
- 15% Preț: 674.31 lei
- 25% Preț: 557.05 lei
- 20% Preț: 1624.73 lei
- 15% Preț: 672.13 lei
- 18% Preț: 1316.30 lei
- 31% Preț: 435.18 lei
- 15% Preț: 485.82 lei
- Preț: 459.90 lei
- 20% Preț: 1030.56 lei
- 31% Preț: 407.72 lei
- 8% Preț: 439.83 lei
- 20% Preț: 1374.85 lei
- 18% Preț: 1306.71 lei
- 25% Preț: 486.68 lei
- 25% Preț: 1232.12 lei
- 15% Preț: 657.86 lei
- 18% Preț: 771.24 lei
- 20% Preț: 816.24 lei
- 25% Preț: 601.99 lei
- 18% Preț: 831.09 lei
- 31% Preț: 1038.64 lei
- 31% Preț: 1175.56 lei
Preț: 304.28 lei
Preț vechi: 344.20 lei
-12% Nou
Puncte Express: 456
Preț estimativ în valută:
58.24€ • 60.54$ • 48.24£
58.24€ • 60.54$ • 48.24£
Carte tipărită la comandă
Livrare economică 04-18 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781032475356
ISBN-10: 1032475358
Pagini: 498
Ilustrații: 10
Dimensiuni: 156 x 234 x 30 mm
Greutate: 0.7 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
Seria Discrete Mathematics and Its Applications
ISBN-10: 1032475358
Pagini: 498
Ilustrații: 10
Dimensiuni: 156 x 234 x 30 mm
Greutate: 0.7 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
Seria Discrete Mathematics and Its Applications
Notă biografică
István Mező is a Hungarian mathematician. He obtained his PhD in 2010 at the University of Debrecen. He was working in this institute until 2014. After two years of Prometeo Professorship at the Escuela Politécnica Nacional (Quito, Ecuador) between 2012 and 2014 he moved to Nanjing, China, where he is now a full-time research professor.
Recenzii
This book provides an interesting introduction to combinatorics by employing number-theoretic techniques of counting sequences. The level of the presentation often seems elementary, as the author frequently throws out lagniappes suitable for high school students. The text unfolds in three parts. Part 1 covers set partitions, generating functions, Bell polynomials, log-concavity, log-convexity, Bernoulli and Cauchy numbers, ordered partitions, asymptotes, and related inequalities. Part 2 discusses generalizations of counting sequences in three chapters. The final part considers number theoretical properties, including congruences, by way of finite field methods and Diophantine results. Each chapter concludes with an "Outlook" section that gives suggestions about exploring additional topics not covered in the text. Mathematical proof is used throughout the exposition and tends to be "enumerative," again contributing to a sense that the author hopes to engage mathematical novices through this text. However, the more than 250 exercises included in the book are frequently challenging and always interesting. The bibliography comprises more than 600 entries. Anyone who can follow the text is likely to enjoy working through the book.
-D. P. Turner, Faulkner University
-D. P. Turner, Faulkner University
Cuprins
I Counting sequences related to set partitions and permutations
Set partitions and permutation cycles.
Generating functions
The Bell polynomials
Unimodality, log concavity and log convexity
The Bernoulli and Cauchy numbers
Ordered partitions
Asymptotics and inequalities
II Generalizations of our counting sequences
Prohibiting elements from being together
Avoidance of big substructures
Prohibiting elements from being together
Avoidance of big substructures
Avoidance of small substructures
III Number theoretical properties
Congurences
Congruences vial finite field methods
Diophantic results
Appendix
Set partitions and permutation cycles.
Generating functions
The Bell polynomials
Unimodality, log concavity and log convexity
The Bernoulli and Cauchy numbers
Ordered partitions
Asymptotics and inequalities
II Generalizations of our counting sequences
Prohibiting elements from being together
Avoidance of big substructures
Prohibiting elements from being together
Avoidance of big substructures
Avoidance of small substructures
III Number theoretical properties
Congurences
Congruences vial finite field methods
Diophantic results
Appendix
Descriere
Combinatorialists are seldom aware of number theoretical tools, and number theorists rarely aware of possible combinatorial applications. This book is accessible for both of the groups. The first part introduces important counting sequences. The second part shows how these sequences can be generalized to study new combinatorial problems