Discrete mathematics Books

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

Book Synopsis3-D Audio Using Loudspeakers is concerned with 3-D audio systems implemented using a pair of conventional loudspeakers. 3-D Audio Using Loudspeakers discusses the theory, implementation, and testing of a head-tracked loudspeaker 3-D audio system.Table of ContentsPreface. 1. Introduction. 2. Background. 3. Theory and Implementation. 4. Physical Validation. 5. Psychophysical Validation. 6. Discussion. A: Inverting FIR Filters. References. Index.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

Book SynopsisFoundations of Diatonic Theory: A Mathematically Based Approach to Music Fundamentals is an introductory, undergraduate-level textbook that provides an easy entry point into the challenging field of diatonic set theory, a division of music theory that applies the techniques of discrete mathematics to the properties of diatonic scales. After introducing mathematical concepts that relate directly to music theory, the text concentrates on these mathematical relationships, firmly establishing a link between introductory pedagogy and recent scholarship in music theory. It then relates concepts in diatonic set theory directly to the study of music fundamentals through pedagogical exercises and instructions. Ideal for introductory music majors, the book requires only a general knowledge of mathematics, and the exercises are provided with solutions and detailed explanations. With its basic description of musical elements, this textbook is suitable for courses in music fundamentals, music theoTrade ReviewNot only does Foundations of Diatonic Theory accomplish its stated goals, but it does so in such a masterful way, and with such a refreshing approach, that after reading it, any course on music fundamentals, music and mathematics, or diatonic set theory taught without its perspective would feel incomplete. * GAMUT: Online Journal of the Music Theory Society of the Mid-Atlantic *Because of its innovative approach, Foundations of Diatonic Theory will come as a breath of fresh air for those who decide to incorporate it into fundamentals courses. It would also provide courses on music and mathematics, and on diatonic set theory, with a way of getting into the material that encourages students to think critically—a most desirable quality in a text, as critical thinking should be demanded of the student by any graduate or upper-division undergraduate course. If Johnson’s Montessori-style approach is contagious among the next generation of textbook authors, the benefits to theory students and instructors alike could be enormous. * GAMUT: Online Journal of the Music Theory Society of the Mid-Atlantic *Table of ContentsPart 1 Preface Part 2 Introduction Chapter 3 1. Spatial Relations and Musical Structures Chapter 4 2. Interval Patterns and Musical Structures Chapter 5 3. Triads and Seventh Chords and Their Structures Part 6 Conclusion Part 7 For Further Study Part 8 Notes Part 9 Sources Cited Part 10 Index

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

Book SynopsisGroundbreaking mathematician Gregory Chaitin gives us the first book to posit that we can prove how Darwin’s theory of evolution works on a mathematical level. For years it has been received wisdom among most scientists that, just as Darwin claimed, all of the Earth’s life-forms evolved by blind chance. But does Darwin’s theory function on a purely mathematical level? Has there been enough time for evolution to produce the remarkable biological diversity we see around us? It’s a question no one has yet answered—in fact, no one has attempted to answer it until now. In this illuminating and provocative book, Gregory Chaitin elucidates the mathematical scheme he’s developed that can explain life itself, and examines the works of mathematical pioneers John von Neumann and Alan Turing through the lens of biology. Fascinating and thought-provoking, Proving Darwin makes clear how biology may have found its greatest ally in mathematics

Read more less

Book Synopsis1 Group Representations.- 2 Representations of the Symmetric Group.- 3 Combinatorial Algorithms.- 4 Symmetric Functions.- 5 Applications and Generalizations.Trade ReviewFrom the reviews of the second edition: "This work is an introduction to the representation theory of the symmetric group. Unlike other books on the subject this text deals with the symmetric group from three different points of view: general representation theory, combinatorial algorithms and symmetric functions. ... This book is a digestible text for a graduate student and is also useful for a researcher in the field of algebraic combinatorics for reference." (Attila Maróti, Acta Scientiarum Mathematicarum, Vol. 68, 2002) "A classic gets even better. ... The edition has new material including the Novelli-Pak-Stoyanovskii bijective proof of the hook formula, Stanley’s proof of the sum of squares formula using differential posets, Fomin’s bijective proof of the sum of squares formula, group acting on posets and their use in proving unimodality, and chromatic symmetric functions." (David M. Bressoud, Zentralblatt MATH, Vol. 964, 2001)Table of Contents* Group Representations * Representations of the Symmetric Group * Combinatorial Algorithms * Symmetric Functions * Applications and Generalizations

Read more less

Book SynopsisA Course in Topological Combinatorics is the first undergraduate textbook on the field of topological combinatorics, a subject that has become an active and innovative research area in mathematics over the last thirty years with growing applications in math, computer science, and other applied areas.Trade Review“This book is an excellent introduction into the subject. … The book contains a lot of figures and each chapter ends with a group of exercises which help the reader in understanding the hard constructions and proofs. The book may serve for a one- or two-semester undergraduate course depending on the preliminary knowledges of the students.” (János Kincses, Acta Scientiarum Mathematicarum, Vol. 81 (3-4), 2015)“The present book … presents a sequence of combinatorial themes which have shown an affinity for topological methods … . This book is filled with extremely attractive mathematics … and bringing topology into the play of combinatorics and graph theory is a wonderfully elegant manoeuvre. Here it is carried out coherently, and on a pretty grand scale, and we are thus afforded the opportunity to encounter (algebraic) topology in a very seductive uniform context. What a marvelous thing!” (Michael Berg, MAA Reviews, July, 2013)“In the book’s four main chapters, Longueville (Univ. of Applied Sciences, Germany) addresses fair-division problems; graph coloring; graph property evasiveness; and embeddings and mappings. … Basic results of algebraic topology already have powerful consequences for analysis, but the subject’s arcana can look like art for art’s sake. The author’s charting of a novel application domain for a core subject makes this book an essential acquisition. Summing Up: Essential. Upper-division undergraduates and above.” (D. V. Feldman, Choice, Vol. 50 (8), April, 2013)“Topological combinatorics is concerned with the applications of the many powerful techniques of algebraic topology to problems in combinatorics. … The present book aims to give a clear and vivid presentation of some of the most beautiful and accessible results from the area. The text, based upon some courses by the author at Freie Universität Berlin, is designed for an advanced undergraduate student.” (Hirokazu Nishimura, zbMATH, Vol. 1273, 2013)Table of ContentsPreface.- List of Symbols and Typical Notation.- 1 Fair-Division Problems.- 2 Graph-Coloring Problems.- 3 Evasiveness of Graph Properties.- 4 Embedding and Mapping Problems.- A Basic Concepts from Graph Theory.- B Crash Course in Topology.- C Partially Ordered Sets, Order Complexes, and Their Topology.- D Groups and Group Actions.- E Some Results and Applications from Smith Theory.- References.- Index.

Read more less

Book SynopsisThe highlights of the book are three main theorems in the combinatorial theory of convex polytopes, known as the Dehn-Sommerville Relations, the Upper Bound Theorem and the Lower Bound Theorem.Table of Contents1 Convex Sets.- A7;1. The Affine Structure of ?d.- A7;2. Convex Sets.- A7;3. The Relative Interior of a Convex Set.- A7;4. Supporting Hyperplanes and Halfspaces.- A7;5. The Facial Structure of a Closed Convex Set.- A7;6. Polarity.- 2 Convex Polytopes.- A7;7. Polytopes.- A7;8. Polyhedral Sets.- A7;9. Polarity of Polytopes and Polyhedral Sets.- A7;10. Equivalence and Duality of Polytopes.- A7;11. Vertex-Figures.- A7;12. Simple and Simplicial Polytopes.- A7;13. Cyclic Polytopes.- A7;14. Neighbourly Polytopes.- A7;15. The Graph of a Polytope.- 3 Combinatorial Theory of Convex Polytopes.- A7;16. Eulerߣs Relation.- A7;17. The Dehn-Sommerville Relations.- A7;18. The Upper Bound Theorem.- A7;19. The Lower Bound Theorem.- A7;20. McMullenߣs Conditions.- Appendix 1 Lattices.- Appendix 2 Graphs.- Appendix 3 Combinatorial Identities.- Bibliographical Comments.- List of Symbols.

Read more less

Table of Contents1. Basic definitions.- 2. The invariant bilinear form and the generalized Casimir operator.- 3. Integrable representations and the Weyl group of a Kac-Moody algebra.- 4. Some properties of generalized Cartan matrices.- 5. Real and imaginary roots.- 6. Affine Lie algebras: the normalized invariant bilinear form, the root system and the Weyl group.- 7. Affine Lie algebras: the realization (case k = 1).- 8. Affine Lie algebras: the realization (case k = 2 or 3). Application to the classification of finite order automorphisms.- 9. Highest weight modules over the Lie algebra g(A).- 10. Integrable highest weight modules: the character formula.- 11. Integrable highest weight modules: the weight system, the contravariant Hermitian form and the restriction problem.- 12. Integrable highest weight modules over affine Lie algebras. Application to ?-function identities.- 13. Affine Lie algebras, theta functions and modular forms.- 14. The principal realization of the basic representation. Application to the KdV-type hierarchies of non-linear partial differential equations.- Index of notations and definitions.- References.

Read more less

Trade Review“This book is an outstanding book on counting integer points of polytopes … . The book contains lots of exercises with very helpful hints. Another essential feature of the book is a vast collection of open problems on different aspects of integer point counting and related areas. … The book is reader-friendly written, self-contained and contains numerous beautiful illustrations. The reader is always accompanied with deep research jokes by famous researchers and valuable historical notes.” (Oleg Karpenkov, zbMATH 1339.52002, 2016)Reviews of the first edition:“You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics.”— MAA Reviews“The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the material, exercises, open problems and an extensive bibliography.”— Zentralblatt MATH“This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron.”— Mathematical Reviews“Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robins have written the perfect text for such a course.”— CHOICETable of ContentsPreface.- The Coin-Exchange Problem of Frobenius.- A Gallery of Discrete Volumes.- Counting Lattice Points in Polytopes: The Ehrhart Theory.- Reciprocity.- Face Numbers and the Dehn-Sommerville Relations in Ehrhartian Terms.- Magic Squares.- Finite Fourier Analysis.- Dedekind Sums.- The Decomposition of a Polytope into Its Cones.- Euler-MacLaurin Summation in Rd.- Solid Angles.- A Discrete Version of Green's Theorem Using Elliptic Functions.- Appendix A: Triangulations of Polytopes.- Appendix B: Hints for Selected Exercises.- References.- Index.- List of Symbols.-

Read more less

Trade Review“The present book gives a detailed treatment of the standard monomial theory (SMT) for the Grassmannians and their Schubert subvarieties along with several applications of SMT. It can be used as a reference book by experts and graduate students who study varieties with a reductive group action such as flag and toric varieties.” (Valentina Kiritchenko, zbMATH 1343.14001, 2016)“The book under review is more elementary; it is exclusively devoted to Grassmannians and their Schubert subvarieties. The book is divided into three parts. … This is a nicely written book, one that may appeal to students and researchers in related areas.” (Felipe Zaldivar, MAA Reviews, maa.org, December, 2015)Table of ContentsPreface.- 1. Introduction.- Part I. Algebraic Geometry—A Brief Recollection - 2. Preliminary Material.- 3. Cohomology Theory.- 4. Gröbner Bases.- Part II. Grassmannian and Schubert Varieties.- 5. The Grassmannian and Its Schubert Varieties.- 6. Further Geometric Properties of Schubert Varieties.- 7. Flat Degenerations.- Part III. Flag Varieties and Related Varieties.- 8. The Flag Variety: Geometric and Representation-Theoretic Aspects.- 9. Relationship to Classical Invariant Theory.- 10. Determinantal Varieties.- 11. Related Topics.- References.- List of Symbols.- Index.

Read more less

Book SynopsisThe Coin-Exchange Problem of Frobenius.- A Gallery of Discrete Volumes.- Counting Lattice Points in Polytopes: The Ehrhart Theory.- Reciprocity.- Face Numbers and the DehnSommerville Relations in Ehrhartian Terms.- Magic Squares.- Finite Fourier Analysis.- Dedekind Sums.- Zonotopes.- h-Polynomials and h*-Polynomials.- The Decomposition of a Polytope Into Its Cones.- EulerMaclaurin Summation in Rd.- Solid Angles.- A Discrete Version of Green's Theorem Using Elliptic Functions.Trade Review“This book is an outstanding book on counting integer points of polytopes … . The book contains lots of exercises with very helpful hints. Another essential feature of the book is a vast collection of open problems on different aspects of integer point counting and related areas. … The book is reader-friendly written, self-contained and contains numerous beautiful illustrations. The reader is always accompanied with deep research jokes by famous researchers and valuable historical notes.” (Oleg Karpenkov, zbMATH 1339.52002, 2016)Reviews of the first edition:“You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics.”— MAA Reviews“The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the material, exercises, open problems and an extensive bibliography.”— Zentralblatt MATH“This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron.”— Mathematical Reviews“Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robins have written the perfect text for such a course.”— CHOICETable of ContentsPreface.- The Coin-Exchange Problem of Frobenius.- A Gallery of Discrete Volumes.- Counting Lattice Points in Polytopes: The Ehrhart Theory.- Reciprocity.- Face Numbers and the Dehn-Sommerville Relations in Ehrhartian Terms.- Magic Squares.- Finite Fourier Analysis.- Dedekind Sums.- The Decomposition of a Polytope into Its Cones.- Euler-MacLaurin Summation in Rd.- Solid Angles.- A Discrete Version of Green's Theorem Using Elliptic Functions.- Appendix A: Triangulations of Polytopes.- Appendix B: Hints for Selected Exercises.- References.- Index.- List of Symbols.-

Read more less

Book SynopsisA practical guide simplifying discrete math for curious minds and demonstrating its application in solving problems related to software development, computer algorithms, and data scienceKey Features Apply the math of countable objects to practical problems in computer science Explore modern Python libraries such as scikit-learn, NumPy, and SciPy for performing mathematics Learn complex statistical and mathematical concepts with the help of hands-on examples and expert guidance Book DescriptionDiscrete mathematics deals with studying countable, distinct elements, and its principles are widely used in building algorithms for computer science and data science. The knowledge of discrete math concepts will help you understand the algorithms, binary, and general mathematics that sit at the core of data-driven tasks. Practical Discrete Mathematics is a comprehensive introduction for those who are new to the mathematics of countable objects. This book will help you get up to speed with using discrete math principles to take your computer science skills to a more advanced level. As you learn the language of discrete mathematics, you'll also cover methods crucial to studying and describing computer science and machine learning objects and algorithms. The chapters that follow will guide you through how memory and CPUs work. In addition to this, you'll understand how to analyze data for useful patterns, before finally exploring how to apply math concepts in network routing, web searching, and data science. By the end of this book, you'll have a deeper understanding of discrete math and its applications in computer science, and be ready to work on real-world algorithm development and machine learning.What you will learn Understand the terminology and methods in discrete math and their usage in algorithms and data problems Use Boolean algebra in formal logic and elementary control structures Implement combinatorics to measure computational complexity and manage memory allocation Use random variables, calculate descriptive statistics, and find average-case computational complexity Solve graph problems involved in routing, pathfinding, and graph searches, such as depth-first search Perform ML tasks such as data visualization, regression, and dimensionality reduction Who this book is forThis book is for computer scientists looking to expand their knowledge of discrete math, the core topic of their field. University students looking to get hands-on with computer science, mathematics, statistics, engineering, or related disciplines will also find this book useful. Basic Python programming skills and knowledge of elementary real-number algebra are required to get started with this book.Table of ContentsTable of Contents Key Concepts, Notation, Set Theory, Relations, and Functions Formal Logic and Constructing Mathematical Proofs Computing with Base-n Numbers Combinatorics Using SciPy Elements of Discrete Probability Computational Algorithms in Linear Algebra Computational Requirements for Algorithms Storage and Feature Extraction of Graphs, Trees, and Networks Searching Data Structures and Finding Shortest Paths Regression Analysis with NumPy and Scikit-Learn Web Searches with PageRank Principal Component Analysis with Scikit-Learn

Read more less

Book SynopsisDrawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as well as proof of Hall's theorem. He concludes with the constructions of schedules and a brief introduction to block designs. Each chapter is backed by a number of examples, with straightforw ard applications of ideas and more challenging problems.Trade Review"Wie der Titel andeutet, handelt es sich bei diesem Buch um eine elementare Einführung in Denkweisen und Methoden der Diskreten Mathematik. Die fachlichen Voraussetzungen an den Leser sind minimal. Darauf aufbauend wird ein doch recht buntes Bild entwickelt, bestehend vor allem aus den wichtigsten Konzepten aus Kombinatorik und Graphentheorie sowie einigen spezielleren Themen wie Designs und Codes.... Der Vorteil besteht darin, dass auch dem mathematischen Laien auf knapp 200 Seiten ein durchaus einprägsames Bild von einem Zweig der Mathematik vermittelt wird, der in unserer Zeit u.a. durch die Allgegenwart der sogenannten Informationstechnologie extrem an Bedeutung gewonnen hat."Internationale Mathematische Nachrichten, Nr. 187, August 2001Table of Contents1. Counting and Binomial Coefficients.- 2. Recurrence.- 3. Introduction to Graphs.- 4. Travelling Round a Graph.- 5. Partitions and Colourings.- 6. The Inclusion Exclusion Principle.- 7. Latin Squares and Hall’s Theorem.- 8. Schedules and 1-Factorisations.- 9. Introduction to Designs.- Solutions.- Further Reading.

Read more less

Book SynopsisThis book provides a comprehensive, in-depth overview of elementary mathematics as explored in Mathematical Olympiads around the world. It expands on topics usually encountered in high school and could even be used as preparation for a first-semester undergraduate course. This third and last volume covers Counting, Generating Functions, Graph Theory, Number Theory, Complex Numbers, Polynomials, and much more.As part of a collection, the book differs from other publications in this field by not being a mere selection of questions or a set of tips and tricks that applies to specific problems. It starts from the most basic theoretical principles, without being either too general or too axiomatic. Examples and problems are discussed only if they are helpful as applications of the theory. Propositions are proved in detail and subsequently applied to Olympic problems or to other problems at the Olympic level.The book also explores some of the hardest problems presented at National and International Mathematics Olympiads, as well as many essential theorems related to the content. An extensive Appendix offering hints on or full solutions for all difficult problems rounds out the book.Table of Contents

Read more less

Book SynopsisThe goal of this monograph is to give an accessible introduction to nonstandard methods and their applications, with an emphasis on combinatorics and Ramsey theory. It includes both new nonstandard proofs of classical results and recent developments initially obtained in the nonstandard setting. This makes it the first combinatorics-focused account of nonstandard methods to be aimed at a general (graduate-level) mathematical audience. This book will provide a natural starting point for researchers interested in approaching the rapidly growing literature on combinatorial results obtained via nonstandard methods. The primary audience consists of graduate students and specialists in logic and combinatorics who wish to pursue research at the interface between these areas.Table of Contents- Part I Preliminaries. - Ultrafilters. - Nonstandard Analysis. - Hyperfinite Generators of Ultrafilters. - Many Stars: Iterated Nonstandard Extensions. - LoebMeasure. - Part II Ramsey Theory. - Ramsey’s Theorem. - The Theorems of van der Waerden and Hales-Jewett. - From Hindman to Gowers. - Partition Regularity of Equations. - Part III Combinatorial Number Theory. - Densities and Structural Properties. - Working in the Remote Realm. - Jin’s Sumset Theorem. - Sumset Configurations in Sets of Positive Density. - Near Arithmetic Progressions in Sparse Sets. - The Interval Measure Property. - Part IV Other Topics. - Triangle Removal and Szemerédi Regularity. - Approximate Groups. - Foundations of Nonstandard Analysis.

Read more less

Book SynopsisThis easy-to-understand textbook introduces the mathematical language and problem-solving tools essential to anyone wishing to enter the world of computer and information sciences. Specifically designed for the student who is intimidated by mathematics, the book offers a concise treatment in an engaging style.The thoroughly revised third edition features a new chapter on relevance-sensitivity in logical reasoning and many additional explanations on points that students find puzzling, including the rationale for various shorthand ways of speaking and ‘abuses of language’ that are convenient but can give rise to misunderstandings. Solutions are now also provided for all exercises.Topics and features: presents an intuitive approach, emphasizing how finite mathematics supplies a valuable language for thinking about computation; discusses sets and the mathematical objects built with them, such as relations and functions, as well as recursion and induction; introduces core topics of mathematics, including combinatorics and finite probability, along with the structures known as trees; examines propositional and quantificational logic, how to build complex proofs from simple ones, and how to ensure relevance in logic; addresses questions that students find puzzling but may have difficulty articulating, through entertaining conversations between Alice and the Mad Hatter; provides an extensive set of solved exercises throughout the text.This clearly-written textbook offers invaluable guidance to students beginning an undergraduate degree in computer science. The coverage is also suitable for courses on formal methods offered to those studying mathematics, philosophy, linguistics, economics, and political science. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study.Table of ContentsPart I: Sets Collecting Things Together: Sets Comparing Things: Relations Associating One Item with Another: Functions Recycling Outputs as Inputs: Induction and Recursion Part II: Math Counting Things: Combinatorics Weighing the Odds: Probability Squirrel Math: Trees Part III: Logic Yea and Nay: Propositional Logic Something about Everything: Quantificational Logic Just Supposing: Proof and Consequence Sticking to the Point: Relevance in Logic

Read more less

Book SynopsisThis book provides a self-contained introduction to convex geometry in Euclidean space. After covering the basic concepts and results, it develops Brunn–Minkowski theory, with an exposition of mixed volumes, the Brunn–Minkowski inequality, and some of its consequences, including the isoperimetric inequality. Further central topics are then treated, such as surface area measures, projection functions, zonoids, and geometric valuations. Finally, an introduction to integral-geometric formulas in Euclidean space is provided. The numerous exercises and the supplementary material at the end of each section form an essential part of the book. Convexity is an elementary and natural concept. It plays a key role in many mathematical fields, including functional analysis, optimization, probability theory, and stochastic geometry. Paving the way to the more advanced and specialized literature, the material will be accessible to students in the third year and can be covered in one semester.Trade Review“‘Lectures on convex geometry’ is an excellent graduate book about convex geometry. … The book is very well-organized. … The presentation is clear, well-composed and illustrated. The problems at the end of each subchapter are carefully selected and revised. The whole text is readable, interesting and easy to learn from. … the book is excellent and it can serve the studies of the future generation students in convex geometry.” (Gergely Kiss, zbMATH 1487.52001, 2022)“The book is informative, very interesting, and mathematically accessible, and the authors have achieved the purpose that they outline above. As the title suggests, Lectures on convex geometry is well suited to be used as the prescribed textbook for graduate courses in convex geometry; this is because of its pedagogical style and the quality of the exercises. It will also be useful to students intending to pursue a research career in the area … .” (Daniel John Fresen, Mathematical Reviews, June, 2022)Table of ContentsPreface.- Preliminaries and Notation.- 1. Convex Sets.- 2. Convex Functions.- 3. Brunn-Minkowski Theory.- 4. From Area Measures to Valuations.- 5. Integral Geometric Formulas.-6. Solutions of Selected Exercises.- References.- Index.

Read more less

Book SynopsisThis book provides a self-contained introduction to convex geometry in Euclidean space. After covering the basic concepts and results, it develops Brunn–Minkowski theory, with an exposition of mixed volumes, the Brunn–Minkowski inequality, and some of its consequences, including the isoperimetric inequality. Further central topics are then treated, such as surface area measures, projection functions, zonoids, and geometric valuations. Finally, an introduction to integral-geometric formulas in Euclidean space is provided. The numerous exercises and the supplementary material at the end of each section form an essential part of the book. Convexity is an elementary and natural concept. It plays a key role in many mathematical fields, including functional analysis, optimization, probability theory, and stochastic geometry. Paving the way to the more advanced and specialized literature, the material will be accessible to students in the third year and can be covered in one semester.Trade Review“‘Lectures on convex geometry’ is an excellent graduate book about convex geometry. … The book is very well-organized. … The presentation is clear, well-composed and illustrated. The problems at the end of each subchapter are carefully selected and revised. The whole text is readable, interesting and easy to learn from. … the book is excellent and it can serve the studies of the future generation students in convex geometry.” (Gergely Kiss, zbMATH 1487.52001, 2022)“The book is informative, very interesting, and mathematically accessible, and the authors have achieved the purpose that they outline above. As the title suggests, Lectures on convex geometry is well suited to be used as the prescribed textbook for graduate courses in convex geometry; this is because of its pedagogical style and the quality of the exercises. It will also be useful to students intending to pursue a research career in the area … .” (Daniel John Fresen, Mathematical Reviews, June, 2022)Table of ContentsPreface.- Preliminaries and Notation.- 1. Convex Sets.- 2. Convex Functions.- 3. Brunn-Minkowski Theory.- 4. From Area Measures to Valuations.- 5. Integral Geometric Formulas.-6. Solutions of Selected Exercises.- References.- Index.

Read more less

Book SynopsisThis textbook can serve as a comprehensive manual of discrete mathematics and graph theory for non-Computer Science majors; as a reference and study aid for professionals and researchers who have not taken any discrete math course before. It can also be used as a reference book for a course on Discrete Mathematics in Computer Science or Mathematics curricula. The study of discrete mathematics is one of the first courses on curricula in various disciplines such as Computer Science, Mathematics and Engineering education practices. Graphs are key data structures used to represent networks, chemical structures, games etc. and are increasingly used more in various applications such as bioinformatics and the Internet. Graph theory has gone through an unprecedented growth in the last few decades both in terms of theory and implementations; hence it deserves a thorough treatment which is not adequately found in any other contemporary books on discrete mathematics, whereas about 40% of this textbook is devoted to graph theory. The text follows an algorithmic approach for discrete mathematics and graph problems where applicable, to reinforce learning and to show how to implement the concepts in real-world applications.Trade Review“This accessible reference book should be well received by undergraduate-level CS, engineering, and mathematics students.” (Soubhik Chakraborty, Computing Reviews, July 12, 2022)“The book under review is an elementary introduction to mathematical logic, set theory, discrete mathematics, number theory, probability theory and graph theory. Its undoubted advantage is its good algorithmic support. … I would recommend this book to students studying computer science at the bachelor’s level.” (I. M. Erusalimskiy, zbMATH 1477.68004, 2022)Table of ContentsPreface.- Part I: Fundamentals of Discrete Mathematics.- Logic.- Proofs.- Algorithms.- Set Theory.- Relations and Functions.- Sequences, Induction and Recursion.- Introduction to Number Theory.- Counting and Probability.- Boolean Algebra and Combinational Circuits.- Introduction to the Theory of Computation.- Part II: Graph Theory.- Introduction to Graphs.- Trees and Traversals.- Subgraphs.- Connectivity, Network Flows and Shortest Paths.- Graph Applications.- A:.- Pseudocode Conventions.- Index.

Read more less

Book SynopsisThis 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.Trade Review“The wide variety of slightly unusual topics makes the book an excellent resource for the instructor who wants to craft a combinatorics course that contains a diverse collection of attractive results … . The attentive student will certainly come away from a course based on this book with a solid understanding of the combinatorial way of thinking. … the book is an excellent resource for anyone teaching a class in combinatorics.” (Timothy Y. Chow, Mathematical Reviews, March, 2023)“A whole book whose backbone is enumeration by codifying the objects to be enumerated as words. … They do this in a skillfully structured fashion which makes the connections natural and unforced. … One of the remarkable features of this book is the care the authors have taken to make it reader-friendly and accessible to a wide range of students following a graduate mathematics course or an honours undergraduate course in mathematics and computer science.” (Josef Lauri, zbMATH 1478.05001, 2022)Table of Contents1. 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.

Read more less

This stimulating textbook presents a broad and accessible guide to the fundamentals of discrete mathematics, highlighting how the techniques may be applied to various exciting areas in computing. The text is designed to motivate and inspire the reader, encouraging further study in this important skill. Features: This book provides an introduction to the building blocks of discrete mathematics, including sets, relations and functions; describes the basics of number theory, the techniques of induction and recursion, and the applications of mathematical sequences, series, permutations, and combinations; presents the essentials of algebra; explains the fundamentals of automata theory, matrices, graph theory, cryptography, coding theory, language theory, and the concepts of computability and decidability; reviews the history of logic, discussing propositional and predicate logic, as well as advanced topics such as the nature of theorem proving; examines the field of software engineering, including software reliability and dependability and describes formal methods; investigates probability and statistics and presents an overview of operations research and financial mathematics.

Read more less

Book SynopsisPreface.- 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.

Read more less