Discrete mathematics Books

Book Synopsis

Read more less

Book Synopsis

Read more less

Book SynopsisDiscrete Mathematics with Ducks, Second Edition is a gentle introduction for students who find the proofs and abstractions of mathematics challenging. At the same time, it provides stimulating material that instructors can use for more advanced students. The first edition was widely well received, with its whimsical writing style and numerous exercises and materials that engaged students at all levels. The new, expanded edition continues to facilitate effective and active learning. It is designed to help students learn about discrete mathematics through problem-based activities. These are created to inspire students to understand mathematics by actively practicing and doing, which helps students better retain what they've learned. As such, each chapter contains a mixture of discovery-based activities, projects, expository text, in-class exercises, and homework problems. The author's lively and friendly writing style is apTable of ContentsPreface for Instructors and Other TeachersPreface for Students and Other LearnersTheme: The Basics1 Counting and Proofs2 Sets and Logic3 Graphics and Functions4 Induction5 Algorithms with CiphersTheme I Supplement6 Binomial Coefficients and Pascal’s Triangle7 Balls and Boxes and PIE: Counting Techniques8 Recurrences9 Cutting Up Food: Counting and GeometryIII Theme: Graph Theory10 Trees11 Euler’s Formula and Applications12 Graph Traversals13 Graph ColoringTheme III Supplement: Problems on the Theme of Graph TheoryIV Other Material14 Probability and Expectation15 Fun with Cardinality16 Number Theory17 Computational ComplexityA Solutions to Check Yourself ProblemsB Solutions to Bonus Check-Yourself ProblemsC The Greek Alphabet and Some Uses for Some LettersD List of SymbolsBibliographyIndex

Read more less

Book SynopsisProfessor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for "his advancement of our understanding of the complexity of computation in a significant and profound way." This volume includes a selection of seminal papers embodying the work that led to this award, exemplifying Cook's synthesis of ideas and techniques from logic and the theory of computation including NP-completeness, proof complexity, bounded arithmetic, and parallel and space-bounded computation. These papers are accompanied by contributed articles by leading researchers in these areas, which convey to a general reader the importance of Cook's ideas and their enduring impact on the research community. The book also contains biographical material, Cook's Turing Award lecture, and an interview. Together these provide a portrait of Cook as a recognized leader and innovator in mathematics and computer science, as well as a gentle mentor and colleague.

Read more less

Book SynopsisTrade Review"Discrete Mathematics is adequately written and well-documented.... This book presents the material on the topic in a cogently coherent manner thereby serving and justifying the purpose of writing books such as this one. The classroom-tested pedagogy and its 400 examples speak a lot about the kind and amount of sweat that must have gone into it." --zbMATH OpenTable of ContentsPart I: Logic 1. Propositional Logic 2. Predicate Logic Part II: Set Theory and Related Topics 3. Sets 4. Matrices 5. Relations 6. Functions 7. Boolean Algebra Part III: Proof Methods 8. Sequences 9. Recursion 10. Induction 11. General Proof Methods Part IV: Number Theory and Applications 12. Elementary Number Theory 13. Cryptography Part V: Probability 14. Counting Methods 15. Discrete Probability 16. Discrete Random Variables Part VI: Graph Theory 17. Graphs 18. Trees 19. Network Models Part VII: Algorithms and Finite State Machines 20. Algorithms

Read more less

Book SynopsisHow many possible sudoku puzzles are there? In the lottery, what is the chance that two winning balls have consecutive numbers? Who invented Pascal''s triangle? (it was not Pascal)Combinatorics, the branch of mathematics concerned with selecting, arranging, and listing or counting collections of objects, works to answer all these questions. Dating back some 3000 years, and initially consisting mainly of the study of permutations and combinations, its scope has broadened to include topics such as graph theory, partitions of numbers, block designs, design of codes, and latin squares. In this Very Short Introduction Robin Wilson gives an overview of the field and its applications in mathematics and computer theory, considering problems from the shortest routes covering certain stops to the minimum number of colours needed to colour a map with different colours for neighbouring countries.ABOUT THE SERIES: The Very Short Introductions series from Oxford University Press contains hundreds of titles in almost every subject area. These pocket-sized books are the perfect way to get ahead in a new subject quickly. Our expert authors combine facts, analysis, perspective, new ideas, and enthusiasm to make interesting and challenging topics highly readable.Trade ReviewClear and beautifully written ... this book is much more than a simple introduction ... [Its] great strength is that while examining a number of important concepts in detail, the author does so ... without using complicated abstract formulae. * Mathematics Today *Table of Contents1: What is combinatorics? 2: Four types of problem 3: Permutations and combinations 4: A combinatorial zoo 5: Tilings and polyhedra 6: Graphs 7: Square arrays 8: Designs and geometry 9: Partitions Further Reading Index

Read more less

Book SynopsisThe Nature of Complex Networks provides a systematic introduction to the statistical mechanics of complex networks and the different theoretical achievements in the field that are now finding strands in common.The book presents a wide range of networks and the processes taking place on them, including recently developed directions, methods, and techniques. It assumes a statistical mechanics view of random networks based on the concept of statistical ensembles but also features the approaches and methods of modern random graph theory and their overlaps with statistical physics.This book will appeal to graduate students and researchers in the fields of statistical physics, complex systems, graph theory, applied mathematics, and theoretical epidemiology.Trade ReviewThe current volume by Dorogovtsev and Mendes takes quite a broad view of complex networks to include the analysis of finite and infinite graphs, directed and undirected graphs, multigraphs, hypergraphs, and even simplicial complexes, as networks scale according to increasing N or in some other fashion. The writing style is that of physics and especially statistical mechanics with frequent connections made to physical concepts such as Bose-Einstein condensation...The current volume can especially serve as a useful reference on complex networks from a physics perspective. * Lenwood S. Heath, MathSciNet *Table of ContentsPreface 1: First insight 2: Graphs 3: Classical random graphs 4: Equilibrium networks 5: Evolving networks 6: Connected components 7: Epidemics and spreading phenomena 8: Networks of networks 9: Spectra and communities 10: Walks and search 11: Temporal networks 12: Cooperative systems on networks 13: Inference and reconstruction 14: What's next? Further Reading Appendices A-G References

Read more less

Book Synopsis

Read more less

Book SynopsisTable of Contents1. Introduction to Neutrosophic Probability 2. Introduction to Neutrosophic Statistics 3. Applications Applications of Neutrosophic Statistics to Medicine Applications of Neutrosophic Statistics to Cognitive Data Applications of Neutrosophic Statistics to Bioinformatics

Read more less

Book SynopsisA CHOICE Outstanding Academic Title, the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, third edition continues to clearly show the usefulness of this subject for both students and researchers.The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic.Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications.Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated. A completely new technique from extremal comTable of ContentsForewardPreface to the First EditionPreface to the Second EditionPreface to the Third EditionAcknowledgementsIntroduction: No Way around It.1.In One Line and Close: Permutations as Linear Orders2.In One Line and Anywhere: Permutations as Linear Orders- Inversions3.In Many Circles: Permutations as Products of Cycles4.In Any Way but This: Pattern Avoidance—the Basics5.In This Way, but Nicely: Pattern Avoidance-Follow Up6.Mean and Insensitive: Random Permutations7.Permutations and the Rest: Algebraic Combinatorics of Permutations8.Get Them All: Algorithms and Permutations9.How Did We Get Here? Permutations as Genome RearrangementsDo Not Look Just Yet: Solutions to Odd-Numbered ExercisesReferencesList of Frequently Used NotationIndex

Read more less

Book SynopsisThe interplay continues to grow between graph theory and a wide variety of models and applications in mathematics, computer science, operations research, and the natural and social sciences.Topics in Graph Theory is geared toward the more mathematically mature student. The first three chapters provide the basic definitions and theorems of graph theory and the remaining chapters introduce a variety of topics and directions for research. These topics draw on numerous areas of theoretical and applied mathematics, including combinatorics, probability, linear algebra, group theory, topology, operations research, and computer science. This makes the book appropriate for a first course at the graduate level or as a second course at the undergraduate level.The authors build upon material previously published in Graph Theory and Its Applications, Third Edition, by the same authors. That text covers material for both an underTable of Contents1. Foundations. 2. Isomorphisms and Symmetry. 3. Trees and Connectivity. 4. Planarity and Kuratowski’s Theorem. 5. Drawing Graphs and Maps. 6. Graph Colorings. 7. Measurement and Mappings. 8. Analytic Graph Theory. 9. Graph Colorings and Symmetry. 10. Algebraic Specification of Graphs. 11. Nonplanar Layouts.

Read more less

Book SynopsisRecent developments are covered Contains over 100 figures and 250 exercises Includes complete proofsTrade ReviewFrom the reviews: "The book under review constitutes a self-contained introduction to the use of combinatorial methods in commutative algebra. … Concrete calculations and examples are used to introduce and develop concepts. Numerous exercises provide the opportunity to work through the material and end of chapter notes comment on the history and development of the subject. The authors have provided us with a useful reference and an effective text book." (R. J. Shank, Zentralblatt MATH, Vol. 1090 (16), 2006)Table of ContentsMonomial Ideals.- Squarefree monomial ideals.- Borel-fixed monomial ideals.- Three-dimensional staircases.- Cellular resolutions.- Alexander duality.- Generic monomial ideals.- Toric Algebra.- Semigroup rings.- Multigraded polynomial rings.- Syzygies of lattice ideals.- Toric varieties.- Irreducible and injective resolutions.- Ehrhart polynomials.- Local cohomology.- Determinants.- Plücker coordinates.- Matrix Schubert varieties.- Antidiagonal initial ideals.- Minors in matrix products.- Hilbert schemes of points.

Read more less

Book Synopsis1 Notation and prerequisites.- 1.1 Algebra.- 1.2 Topology.- 1.3 Additional notes and comments.- 2 Convex sets.- 2.1 Definition and elementary properties.- 2.2 Support and separation.- 2.3 Convex hulls.- 2.4 Extreme and exposed points; faces and poonems.- 2.5 Unbounded convex sets.- 2.6 Polyhedral sets.- 2.7 Remarks.- 2.8 Additional notes and comments.- 3 Polytopes.- 3.1 Definition and fundamental properties.- 3.2 Combinatorial types of polytopes; complexes.- 3.3 Diagrams and Schlegel diagrams.- 3.4 Duality of polytopes.- 3.5 Remarks.- 3.6 Additional notes and comments.- 4 Examples.- 4.1 The d-simplex.- 4.2 Pyramids.- 4.3 Bipyramids.- 4.4 Prisms.- 4.5 Simplicial and simple polytopes.- 4.6 Cubical polytopes.- 4.7 Cyclic polytopes.- 4.8 Exercises.- 4.9 Additional notes and comments.- 5 Fundamental properties and constructions.- 5.1 Representations of polytopes as sections or projections.- 5.2 The inductive construction of polytopes.- 5.3 Lower semicontinuity of the functions fk(P).- 5.4 Gale-transforms and Gale-diagrams.- 5.5 Existence of combinatorial types.- 5.6 Additional notes and comments.- 6 Polytopes with few vertices.- 6.1 d-Polytopes with d + 2 vertices.- 6.2 d-Polytopes with d + 3 vertices.- 6.3 Gale diagrams of polytopes with few vertices.- 6.4 Centrally symmetric polytopes.- 6.5 Exercises.- 6.6 Remarks.- 6.7 Additional notes and comments.- 7 Neighborly polytopes.- 7.1 Definition and general properties.- 7.2 % MathType!MTEF!2!1!+-% feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeaaciGaaiaabeqaamaabaabaaGcbaWaamWaaeaadG% aGmUaaaeacaYOaiaiJigdaaeacaYOaiaiJikdaaaacbiGaiaiJ-rga% aiaawUfacaGLDbaaaaa!40CC!$$\left[ {\frac{1}{2}d} \right]$$-Neighborly d-polytopes.- 7.3 Exercises.- 7.4 Remarks.- 7.5 Additional notes and comments.- 8 Euler's relation.- 8.1 Euler's theorem.- 8.2 Proof of Euler's theorem.- 8.3 A generalization of Euler's relation.- 8.4 The Euler characteristic of complexes.- 8.5 Exercises.- 8.6 Remarks.- 8.7 Additional notes and comments.- 9 Analogues of Euler's relation.- 9.1 The incidence equation.- 9.2 The Dehn-Sommerville equations.- 9.3 Quasi-simplicial polytopes.- 9.4 Cubical polytopes.- 9.5 Solutions of the Dehn-Sommerville equations.- 9.6 The f-vectors of neighborly d-polytopes.- 9.7 Exercises.- 9.8 Remarks.- 9.9 Additional notes and comments.- 10 Extremal problems concerning numbers of faces.- 10.1 Upper bounds for fi, i ? 1, in terms of fo.- 10.2 Lower bounds for fi, i ? 1, in terms of fo.- 10.3 The sets f(P3) and f(PS3).- 10.4 The set fP4).- 10.5 Exercises.- 10.6 Additional notes and comments.- 11 Properties of boundary complexes.- 11.1 Skeletons of simplices contained in ?(P).- 11.2 A proof of the van Kampen-Flores theorem.- 11.3 d-Connectedness of the graphs of d-polytopes.- 11.4 Degree of total separability.- 11.5 d-Diagrams.- 11.6 Additional notes and comments.- 12 k-Equivalence of polytopes.- 12.1 k-Equivalence and ambiguity.- 12.2 Dimensional ambiguity.- 12.3 Strong and weak ambiguity.- 12.4 Additional notes and comments.- 13 3-Polytopes.- 13.1 Steinitz's theorem.- 13.2 Consequences and analogues of Steinitz's theorem.- 13.3 Eberhard's theorem.- 13.4 Additional results on 3-realizable sequences.- 13.5 3-Polytopes with circumspheres and circumcircles.- 13.6 Remarks.- 13.7 Additional notes and comments.- 14 Angle-sums relations; the Steiner point.- 14.1 Gram's relation for angle-sums.-14.2 Angle-sums relations for simplicial polytopes.- 14.3 The Steiner point of a polytope (by G. C. Shephard).- 14.4 Remarks.- 14.5 Additional notes and comments.- 15 Addition and decomposition of polytopes.- 15.1 Vector addition.- 15.2 Approximation of polytopes by vector sums.- 15.3 Blaschke addition.- 15.4 Remarks.- 15.5 Additional notes and comments.- 16 Diameters of polytopes (by Victor Klee).- 16.1 Extremal diameters of d-polytopes.- 16.2 The functions ? and ?b.- 16.3 Wv Paths.- 16.4 Additional notes and comments.- 17 Long paths and circuits on polytopes.- 17.1 Hamiltonian paths and circuits.- 17.2 Extremal path-lengths of polytopes.- 17.3 Heights of polytopes.- 17.4 Circuit codes.- 17.5 Additional notes and comments.- 18 Arrangements of hyperplanes.- 18.1 d-Arrangements.- 18.2 2-Arrangements.- 18.3 Generalizations.- 18.4 Additional notes and comments.- 19 Concluding remarks.- 19.1 Regular polytopes and related notions.- 19.2 k-Content of polytopes.- 19.3 Antipodality and related notions.- 19.4 Additional notes and comments.- Tables.- Addendum.- Errata for the 1967 edition.- Additional Bibliography.- Index of Terms.- Index of Symbols.Trade Review"The appearance of Grünbaum's book Convex Polytopes in 1967 was a moment of grace to geometers and combinatorialists. The special spirit of the book is very much alive even in those chapters where the book's immense influence made them quickly obsolete. Some other chapters promise beautiful unexplored land for future research. The appearance of the new edition is going to be another moment of grace. Kaibel, Klee and Ziegler were able to update the convex polytope saga in a clear, accurate, lively, and inspired way." (Gil Kalai, The Hebrew University of Jerusalem) "The original book of Grünbaum has provided the central reference for work in this active area of mathematics for the past 35 years...I first consulted this book as a graduate student in 1967; yet, even today, I am surprised again and again by what I find there. It is an amazingly complete reference for work on this subject up to that time and continues to be a major influence on research to this day." (Louis J. Billera, Cornell University) "The original edition of Convex Polytopes inspired a whole generation of grateful workers in polytope theory. Without it, it is doubtful whether many of the subsequent advances in the subject would have been made. The many seeds it sowed have since grown into healthy trees, with vigorous branches and luxuriant foliage. It is good to see it in print once again." (Peter McMullen, University College London) From the reviews of the second edition: "Branko Grünbaum’s book is a classical monograph on convex polytopes … . As was noted by many researchers, for many years the book provided a central reference for work in the field and inspired a whole generation of specialists in polytope theory. … Every chapter of the book is supplied with a section entitled ‘Additional notes and comments’ … these notes summarize the most important developments with respect to the topics treated by Grünbaum. … The new edition … is an excellent gift for all geometry lovers." (Alexander Zvonkin, Mathematical Reviews, 2004b)Table of Contents1 Notation and prerequisites.- 1.1 Algebra.- 1.2 Topology.- 1.3 Additional notes and comments.- 2 Convex sets.- 2.1 Definition and elementary properties.- 2.2 Support and separation.- 2.3 Convex hulls.- 2.4 Extreme and exposed points; faces and poonems.- 2.5 Unbounded convex sets.- 2.6 Polyhedral sets.- 2.7 Remarks.- 2.8 Additional notes and comments.- 3 Polytopes.- 3.1 Definition and fundamental properties.- 3.2 Combinatorial types of polytopes; complexes.- 3.3 Diagrams and Schlegel diagrams.- 3.4 Duality of polytopes.- 3.5 Remarks.- 3.6 Additional notes and comments.- 4 Examples.- 4.1 The d-simplex.- 4.2 Pyramids.- 4.3 Bipyramids.- 4.4 Prisms.- 4.5 Simplicial and simple polytopes.- 4.6 Cubical polytopes.- 4.7 Cyclic polytopes.- 4.8 Exercises.- 4.9 Additional notes and comments.- 5 Fundamental properties and constructions.- 5.1 Representations of polytopes as sections or projections.- 5.2 The inductive construction of polytopes.- 5.3 Lower semicontinuity of the functions fk(P).- 5.4 Gale-transforms and Gale-diagrams.- 5.5 Existence of combinatorial types.- 5.6 Additional notes and comments.- 6 Polytopes with few vertices.- 6.1 d-Polytopes with d + 2 vertices.- 6.2 d-Polytopes with d + 3 vertices.- 6.3 Gale diagrams of polytopes with few vertices.- 6.4 Centrally symmetric polytopes.- 6.5 Exercises.- 6.6 Remarks.- 6.7 Additional notes and comments.- 7 Neighborly polytopes.- 7.1 Definition and general properties.- 7.2 % MathType!MTEF!2!1!+- % feaagaart1ev2aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeaaciGaaiaabeqaamaabaabaaGcbaWaamWaaeaadG % aGmUaaaeacaYOaiaiJigdaaeacaYOaiaiJikdaaaacbiGaiaiJ-rga % aiaawUfacaGLDbaaaaa!40CC! $$ \left[ {\frac{1} {2}d} \right] $$-Neighborly d-polytopes.- 7.3 Exercises.- 7.4 Remarks.- 7.5 Additional notes and comments.- 8 Euler’s relation.- 8.1 Euler’s theorem.- 8.2 Proof of Euler’s theorem.- 8.3 A generalization of Euler’s relation.- 8.4 The Euler characteristic of complexes.- 8.5 Exercises.- 8.6 Remarks.- 8.7 Additional notes and comments.- 9 Analogues of Euler’s relation.- 9.1 The incidence equation.- 9.2 The Dehn-Sommerville equations.- 9.3 Quasi-simplicial polytopes.- 9.4 Cubical polytopes.- 9.5 Solutions of the Dehn-Sommerville equations.- 9.6 The f-vectors of neighborly d-polytopes.- 9.7 Exercises.- 9.8 Remarks.- 9.9 Additional notes and comments.- 10 Extremal problems concerning numbers of faces.- 10.1 Upper bounds for fi, i ? 1, in terms of fo.- 10.2 Lower bounds for fi, i ? 1, in terms of fo.- 10.3 The sets f(P3) and f(PS3).- 10.4 The set fP4).- 10.5 Exercises.- 10.6 Additional notes and comments.- 11 Properties of boundary complexes.- 11.1 Skeletons of simplices contained in ?(P).- 11.2 A proof of the van Kampen-Flores theorem.- 11.3 d-Connectedness of the graphs of d-polytopes.- 11.4 Degree of total separability.- 11.5 d-Diagrams.- 11.6 Additional notes and comments.- 12 k-Equivalence of polytopes.- 12.1 k-Equivalence and ambiguity.- 12.2 Dimensional ambiguity.- 12.3 Strong and weak ambiguity.- 12.4 Additional notes and comments.- 13 3-Polytopes.- 13.1 Steinitz’s theorem.- 13.2 Consequences and analogues of Steinitz’s theorem.- 13.3 Eberhard’s theorem.- 13.4 Additional results on 3-realizable sequences.- 13.5 3-Polytopes with circumspheres and circumcircles.- 13.6 Remarks.- 13.7 Additional notes and comments.- 14 Angle-sums relations; the Steiner point.- 14.1 Gram’s relation for angle-sums.- 14.2 Angle-sums relations for simplicial polytopes.- 14.3 The Steiner point of a polytope (by G. C. Shephard).- 14.4 Remarks.- 14.5 Additional notes and comments.- 15 Addition and decomposition of polytopes.- 15.1 Vector addition.- 15.2 Approximation of polytopes by vector sums.- 15.3 Blaschke addition.- 15.4 Remarks.- 15.5 Additional notes and comments.- 16 Diameters of polytopes (by Victor Klee).- 16.1 Extremal diameters of d-polytopes.- 16.2 The functions ? and ?b.- 16.3 Wv Paths.- 16.4 Additional notes and comments.- 17 Long paths and circuits on polytopes.- 17.1 Hamiltonian paths and circuits.- 17.2 Extremal path-lengths of polytopes.- 17.3 Heights of polytopes.- 17.4 Circuit codes.- 17.5 Additional notes and comments.- 18 Arrangements of hyperplanes.- 18.1 d-Arrangements.- 18.2 2-Arrangements.- 18.3 Generalizations.- 18.4 Additional notes and comments.- 19 Concluding remarks.- 19.1 Regular polytopes and related notions.- 19.2 k-Content of polytopes.- 19.3 Antipodality and related notions.- 19.4 Additional notes and comments.- Tables.- Addendum.- Errata for the 1967 edition.- Additional Bibliography.- Index of Terms.- Index of Symbols.

Read more less

Book SynopsisProblems.- Arithmetic Functions.- Primes in Arithmetic Progressions.- The Prime Number Theorem.- The Method of Contour Integration.- Functional Equations.- Hadamard Products.- Explicit Formulas.- The Selberg Class.- Sieve Methods.- p-adic Methods.- Equidistribution.- Solutions.- Arithmetic Functions.- Primes in Arithmetic Progressions.- The Prime Number Theorem.- The Method of Contour Integration.- Functional Equations.- Hadamard Products.- Explicit Formulas.- The Selberg Class.- Sieve Methods.- p-adic Methods.- Equidistribution.Trade ReviewM.R. MurtyProblems in Analytic Number Theory"The reviewer strongly approves of the problem-based approach to learning, and recommends this book to any student of analytic number theory."—MATHEMATICAL REVIEWSFrom the reviews of the second edition:“This expanded and corrected second edition of this useful and interesting book has a new chapter on the topic of equidistribution. … this monograph gives important results and techniques for specific topics, together with many exercises. … I do enjoy this book … and I imagine when I take the graduate course in the subject that it will be of a greater benefit, which is why I offered such a high rating.” (Philosophy, Religion and Science Book Reviews, bookinspections.wordpress.com, July, 2013)"The second edition of the book has eleven chapters … . the book can be used both as a problem book (as its title shows) and also as a textbook (as the series in which the book is published shows). … is ideal as a text for a first course in analytic number theory, either at the senior undergraduate or the graduate level. … I believe that this book will be very useful for students, researchers and professors. It is well written … ." (Mehdi Hassani, MathDL, April, 2008)Table of ContentsProblems.- Arithmetic Functions.- Primes in Arithmetic Progressions.- The Prime Number Theorem.- The Method of Contour Integration.- Functional Equations.- Hadamard Products.- Explicit Formulas.- The Selberg Class.- Sieve Methods.- p-adic Methods.- Equidistribution.- Solutions.- Arithmetic Functions.- Primes in Arithmetic Progressions.- The Prime Number Theorem.- The Method of Contour Integration.- Functional Equations.- Hadamard Products.- Explicit Formulas.- The Selberg Class.- Sieve Methods.- p-adic Methods.- Equidistribution.

Read more less

Book SynopsisIn this monograph, new combinatorial and computational approaches in the study of RNA structures are presented which enhance both mathematics and computational biology.Trade ReviewFrom the reviews:“This book is devoted to the study of the structure of combinatorial models of the ribonucleic acid (RNA). … This book can serve as an introduction to the study of combinatorial computational biology as well as a reference of known results and state of the art in this topic.” (Ludovit Niepel, Zentralblatt MATH, Vol. 1207, 2011)Table of ContentsIntroduction.- Secondary Structures, Pseudoknot RNA and Beyond.- Folding Sequences into Structures.- Evolution of RNA Sequences.- Methods.- References.- Index.

Read more less

Book SynopsisThis book presents and illustrates the main tools and ideas of algebraic graph theory, with a primary emphasis on current rather than classical topics. It is designed to offer self-contained treatment of the topic, with strong emphasis on concrete examples.Trade ReviewC. Godsil and G.F. Royle Algebraic Graph Theory "A welcome addition to the literature . . . beautifully written and wide-ranging in its coverage."—MATHEMATICAL REVIEWS "An accessible introduction to the research literature and to important open questions in modern algebraic graph theory"—L'ENSEIGNEMENT MATHEMATIQUETable of Contents* Graphs * Groups * Transitive Graphs * Arc-Transitive Graphs * Generalized Polygons and Moore Graphs * Homomorphisms * Kneser Graphs * Matrix Theory * Interlacing * Strongly Regular Graphs * Two-Graphs * Line Graphs and Eigenvalues * The Laplacian of a Graph * Cuts and Flows * The Rank Polynomial * Knots * Knots and Eulerian Cycles * Glossary of Symbols * Index

Read more less

Book Synopsis1 Elementary Concepts.- 2 Reduction of Positive Definite Forms.- 3 Indefinite Forms.- 3.1 Reduction, Cycles.- 3.2 Automorphs, Pell's Equation.- 3.3 Continued Fractions and Indefinite Forms.- 4 The Class Group.- 4.1 Representation and Genera.- 4.2 Composition Algorithms.- 4.3 Generic Characters Revisited.- 4.4 Representation of Integers.- 5 Miscellaneous Facts.- 5.1 Class Number Computations.- 5.2 Extreme Cases and Asymptotic Results.- 6 Quadratic Number Fields.- 6.1 Basic Algebraic Definitions.- 6.2 Algebraic Numbers and Quadratic Fields.- 6.3 Ideals in Quadratic Fields.- 6.4 Binary Quadratic Forms and Classes of Ideals.- 6.5 History.- 7 Composition of Forms.- 7.1 Nonfundamental Discriminants.- 7.2 The General Problem of Composition.- 7.3 Composition in Different Orders.- 8 Miscellaneous Facts II.- 8.1 The Cohen-Lenstra Heuristics.- 8.2 Decomposing Class Groups.- 8.3 Specifying Subgroups of Class Groups.- 9 The 2-Sylow Subgroup.- 9.1 Classical Results on the Pell Equation.- 9.2 ModernRTable of Contents1 Elementary Concepts.- 2 Reduction of Positive Definite Forms.- 3 Indefinite Forms.- 3.1 Reduction, Cycles.- 3.2 Automorphs, Pell’s Equation.- 3.3 Continued Fractions and Indefinite Forms.- 4 The Class Group.- 4.1 Representation and Genera.- 4.2 Composition Algorithms.- 4.3 Generic Characters Revisited.- 4.4 Representation of Integers.- 5 Miscellaneous Facts.- 5.1 Class Number Computations.- 5.2 Extreme Cases and Asymptotic Results.- 6 Quadratic Number Fields.- 6.1 Basic Algebraic Definitions.- 6.2 Algebraic Numbers and Quadratic Fields.- 6.3 Ideals in Quadratic Fields.- 6.4 Binary Quadratic Forms and Classes of Ideals.- 6.5 History.- 7 Composition of Forms.- 7.1 Nonfundamental Discriminants.- 7.2 The General Problem of Composition.- 7.3 Composition in Different Orders.- 8 Miscellaneous Facts II.- 8.1 The Cohen-Lenstra Heuristics.- 8.2 Decomposing Class Groups.- 8.3 Specifying Subgroups of Class Groups.- 8.3.1 Congruence Conditions.- 8.3.2 Exact and Exotic Groups.- 9 The 2-Sylow Subgroup.- 9.1 Classical Results on the Pell Equation.- 9.2 Modern Results.- 9.3 Reciprocity Laws.- 9.4 Special References for Chapter 9.- 10 Factoring with Binary Quadratic Forms.- 10.1 Classical Methods.- 10.2 SQUFOF.- 10.3 CLASNO.- 10.4 SPAR.- 10.4.1 Pollard p — 1.- 10.4.2 SPAR.- 10.5 CFRAC.- 10.6 A General Analysis.- Appendix 1:Tables, Negative Discriminants.- Appendix 2:Tables, Positive Discriminants.

Read more less

Book Synopsis

Read more less

Book SynopsisTable of Contents1: Discreteness 2: Basic set theory 3: Working with finite sets 4: Formal logic 5: Induction 6: Set structures 7: Elementary number theory 8: Codes and cyphers 9: Graphs and trees

Read more less

Book Synopsis

Read more less

Book SynopsisA clear and lucid bottom-up approach to the basic principles of evolutionary algorithms Evolutionary algorithms (EAs) are a type of artificial intelligence. EAs are motivated by optimization processes that we observe in nature, such as natural selection, species migration, bird swarms, human culture, and ant colonies. This book discusses the theory, history, mathematics, and programming of evolutionary optimization algorithms. Featured algorithms include genetic algorithms, genetic programming, ant colony optimization, particle swarm optimization, differential evolution, biogeography-based optimization, and many others. Evolutionary Optimization Algorithms: Provides a straightforward, bottom-up approach that assists the reader in obtaining a clear?but theoretically rigorous?understanding of evolutionary algorithms, with an emphasis on implementation Gives a careful treatment of recently developed EAs?including opposition-based learning, artiTable of ContentsAcknowledgments xxi Acronyms xxiii List of Algorithms xxvii Part I: Introduction to Evolutionary Optimization 1 Introduction 1 2 Optimization 11 Part II: Classic Evolutionary Algorithms 3 Generic Algorithms 35 4 Mathematical Models of Genetic Algorithms 63 5 Evolutionary Programming 95 6 Evolution Strategies 117 7 Genetic Programming 141 8 Evolutionary Algorithms Variations 179 Part III: More Recent Evolutionary Algorithms 9 Simulated Annealing 223 10 Ant Colony Optimization 241 11 Particle Swarm Optimization 265 12 Differential Evolution 293 13 Estimation of Distribution Algorithms 313 14 Biogeography-Based Optimization 351 15 Cultural Algorithms 377 16 Opposition-Based Learning 397 17 Other Evolutionary Algorithms 421 Part IV: Special Type of Optimization Problems 18 Combinatorial Optimization 449 19 Constrained Optimization 481 20 Multi-Objective Optimization 517 21 Expensive, Noisy and Dynamic Fitness Functions 563 Appendices A Some Practical Advice 607 B The No Free Lunch Theorem and Performance Testing 613 C Benchmark Optimization Functions 641 References 685 Topic Index 727

Read more less

Book SynopsisThis stimulating introduction to zeta (and related) functions of graphs develops the fruitful analogy between combinatorics and number theory - for example, the Riemann hypothesis for graphs - making connections with quantum chaos, random matrix theory, and computer science. Many well-chosen illustrations and exercises, both theoretical and computer-based, are included throughout.Trade Review'The book is very appealing through its informal style and the variety of topics covered and may be considered the standard reference book in this field.' Zentralblatt MATHTable of ContentsList of illustrations; Preface; Part I. A Quick Look at Various Zeta Functions: 1. Riemann's zeta function and other zetas from number theory; 2. Ihara's zeta function; 3. Selberg's zeta function; 4. Ruelle's zeta function; 5. Chaos; Part II. Ihara's Zeta Function and the Graph Theory Prime Number Theorem: 6. Ihara zeta function of a weighted graph; 7. Regular graphs, location of poles of zeta, functional equations; 8. Irregular graphs: what is the RH?; 9. Discussion of regular Ramanujan graphs; 10. The graph theory prime number theorem; Part III. Edge and Path Zeta Functions: 11. The edge zeta function; 12. Path zeta functions; Part IV. Finite Unramified Galois Coverings of Connected Graphs: 13. Finite unramified coverings and Galois groups; 14. Fundamental theorem of Galois theory; 15. Behavior of primes in coverings; 16. Frobenius automorphisms; 17. How to construct intermediate coverings using the Frobenius automorphism; 18. Artin L-functions; 19. Edge Artin L-functions; 20. Path Artin L-functions; 21. Non-isomorphic regular graphs without loops or multiedges having the same Ihara zeta function; 22. The Chebotarev Density Theorem; 23. Siegel poles; Part V. Last Look at the Garden: 24. An application to error-correcting codes; 25. Explicit formulas; 26. Again chaos; 27. Final research problems; References; Index.

Read more less

Book SynopsisThe representation theory of the symmetric groups is a classical topic that has grown into a huge body of theory, with many important connections to other areas of mathematics and physics. This self-contained introduction comprises classical and modern topics, including an exhaustive exposition of the new Okounkov–Vershik approach.Trade Review"This beautifully written new book is a welcome addition... It is almost entirely self-contained, only assuming some basic group theory and linear algebra, yet it takes one to the forefront of recent advances in the area. It would be entirely suitable for a single semester or year-long graduate course, as it is replete with examples and exercises of varying difficulty. I suspect it will also find its way on to the shelf as a valuable reference work for researchers in the field, as it is an excellent complement to books of Kleshchev, Sagan, James, and James and Kerber." David John Hemmer, Mathematical ReviewsTable of ContentsPreface; 1. Representation theory of finite groups; 2. The theory of Gelfand–Tsetlin bases; 3. The Okounkov–Vershik approach; 4. Symmetric functions; 5. Content evaluation and character theory; 6. The Littlewood–Richardson rule; 7. Finite dimensional *-algebras; 8. Schur–Weyl dualities and the partition algebra; Bibliography; Index.

Read more less

Book SynopsisThe study of higher categories is attracting growing interest for its many applications in topology, algebraic geometry, mathematical physics and category theory. In this highly readable book, Carlos Simpson develops a full set of homotopical algebra techniques and proposes a working theory of higher categories. Starting with a cohesive overview of the many different approaches currently used by researchers, the author proceeds with a detailed exposition of one of the most widely used techniques: the construction of a Cartesian Quillen model structure for higher categories. The fully iterative construction applies to enrichment over any Cartesian model category, and yields model categories for weakly associative n-categories and Segal n-categories. A corollary is the construction of higher functor categories which fit together to form the (n+1)-category of n-categories. The approach uses Tamsamani's definition based on Segal's ideas, iterated as in Pelissier's thesis using modern technTable of ContentsPrologue; Acknowledgements; Part I. Higher Categories: 1. History and motivation; 2. Strict n-categories; 3. Fundamental elements of n-categories; 4. The need for weak composition; 5. Simplicial approaches; 6. Operadic approaches; 7. Weak enrichment over a Cartesian model category: an introduction; Part II. Categorical Preliminaries: 8. Some category theory; 9. Model categories; 10. Cartesian model categories; 11. Direct left Bousfield localization; Part III. Generators and Relations: 12. Precategories; 13. Algebraic theories in model categories; 14. Weak equivalences; 15. Cofibrations; 16. Calculus of generators and relations; 17. Generators and relations for Segal categories; Part IV. The Model Structure: 18. Sequentially free precategories; 19. Products; 20. Intervals; 21. The model category of M-enriched precategories; 22. Iterated higher categories; Part V. Higher Category Theory: 23. Higher categorical techniques; 24. Limits of weak enriched categories; 25. Stabilization; Epilogue; References; Index.

Read more less

Book SynopsisThe study of graph structure has advanced with great strides. This book unifies and synthesizes research over the last 25 years, detailing both theory and application. It will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.Trade Review'In its huge breadth and depth the authors manage to provide a comprehensive study of monadic second-order logic on graphs covering almost all aspects of the theory that can be presented from a language theoretical or algebraic point of view. There is currently no other textbook or any other source that matches the range of materials covered in this book. As such it is a fantastic resource for those who to study this area [and] will undoubtedly turn into the standard reference for this area.' Stephan Kreutzer, Mathematical ReviewsTable of ContentsForeword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words; 9. Relational structures; Conclusion and open problems; References; Index of notation; Index.

Read more less

Book SynopsisTrade Review"I want to share with everybody my enjoyment of this excellent textbook."---Narciso Marti-Oliet, European Math Society"Those teaching computer scientists who take discrete mathematics alongside other mathematics modules such as linear algebra and calculus (as is the case with the CS20 students at Harvard), and who need a book with an emphasis on proof, will likely and this book a very good choice for their students."---London Mathematical Society, Glenn Hawe

Read more less

Book SynopsisA rare opportunity to delve into Japanese Marxist economicsTrade Review'The contribution of Japanese writers to the study of Marxist Political Economy remains underestimated in the Anglophone world … Among the important achievements of Japanese writers is the capacity to shed original light not only on the ‘pure economics’ of Marx’s thinking but on his Political Economy in the broadest sense. Hiroshi Onishi’s book is an invaluable addition to the canon which the late Makoto Itoh helped establish. It serves both as a textbook and as a historical introduction to the entire development of modern capitalist society from its pre-capitalist origins to the present day from a Historical Materialist perspective, which all scholars and researchers will welcome. An indispensable read.' -- Alan Freeman, University of ManitobaTable of ContentsPreface 1. Human Being in Marxian Materialism: Human Beings, Nature, and Relations of Production 2. Capitalism as a Commodity Producing Society: Quantitative Character of Capitalistic Production, and Capital as Self-valorizing Value 3. Capitalism as the Industrial Society: Qualitative Character of Capitalistic Production, and Capital as Self-Valorizing Value 4. The Growth and Death of Capitalism: Accumulation Theory, A New Quality Created by Quantity 5. The Distribution of Produced Surplus Value among Industries and to Non-Productive Sectors 6. Pre-Capitalistic Economic Formations Addendum I: Decentralized Market Model of the Marxian Optimal Growth Theory Addendum II: Class-Dynamics Incorporated in the Marxian Optimal Growth Model Addendum III: A Conversion of the Analytical Marxist Model to Labor Hire Model to Express the Historical Trend of Firm Size Disparity Mathematical Appendix: How to Solve Dynamic Optimization Problems

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

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

Book SynopsisUses the theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms.Trade ReviewThis short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design. Mathematical Reviews Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort. Computing ReviewsTable of ContentsIntroduction, definitions, and examples Existence of a stable matching: the fundamental algorithm Principle of deferred decisions: coupon collecting Theoretical developments: application to the shortest path Searching a table by hashing; mean behavior of thefundamental algorithm Implementing the fundamental algorithm Research problems Annotated bibliography Appendix A. Later developments Appendix B. Solutions to exercises Index.

Read more less

Book SynopsisContrasts combinatorial games, which have complete information and no chance moves, with those of classical game theory. This book introduces a theory of numbers, including infinitesimals and transfinite numbers, which has emerged as a special case of the theory of games. It also describes impartial games.Table of ContentsWhat is a game? by R. K. Guy Numbers and games by J. H. Conway Impartial games by R. K. Guy More ways of combining games by J. H. Conway Introductory overview of mathematical go endgames by E. R. Berlekamp Games and codes by V. Pless Complexity of games by A. S. Fraenkel..., Welter's game, Sylver coinage, dots-and-boxes,... by R. J. Nowakowski Unsolved problems in combinatorial games by R. K. Guy Selected bibliography on combinatorial games and some related material by A. S. Fraenkel.

Read more less

Book SynopsisThere is a tradition in Russia that holds that mathematics can be both challenging and fun. One fine outgrowth of that tradition is the magazine, ""Kvant"", which has been enjoyed by many of the best students since its founding in 1970. This book presents a collection of articles from ""Kvant"".Table of ContentsTwo games with matchsticks by I. M. Yaglom Economics and linear inequalities by A. B. Katok Economics and linear inequalities (Continuation) by A. B. Katok Switching networks by R. V. Freivald Who will go to Rio? by G. M. Adel'son-Vel'skii, I. N. Bernshtein, and M. L. Gerver From the life of units by A. L. Toom Nonrepeating sequences by G. A. Gurevich Words with restrictions by A. M. Stepin and A. T. Tagi-Zade Planar switching circuits by S. Ovchinnikov Classification algorithms by P. Bleher and M. Kel'bert How to detect a counterfeit coin by G. Shestopal The generalized problem of counterfeit coins by M. Mamikon Truthtellers, liars, and deceivers by P. Bleher Solvable and unsolvable algorithmic problems by V. A. Uspenskii and A. L. Semenov Best bet for simpletons by P. A. Pevzner.

Read more less

Book SynopsisThe theory of graph coloring has existed for more than 150 years. This book states that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring.Table of ContentsIntroduction The lower chromatic number of a hypergraph Mixed hypergraphs and the upper chromatic number Uncolorable mixed hypergraphs Uniquely colorable mixed hypergraphs $\mathcal{C}$-perfect mixed hypergraphs Gaps in the chromatic spectrum Interval mixed hypergraphs Pseudo-chordal mixed hypergraphs Circular mixed hypergraphs Planar mixed hypergraphs Coloring block designs as mixed hypergraphs Modelling with mixed hypergraphs Bibliography List of figures Index.

Read more less

Book SynopsisIntroduces readers to the language of generating functions, which is the main language of enumerative combinatorics. This book starts with definitions, simple properties, and many examples of generating functions. It discusses topics such as formal grammars, generating functions in several variables, and the exclusion-inclusion principle.Table of ContentsFormal power series and generating functions. Operations with formal power series. Elementary generating functions Generating functions for well-known sequences Unambiguous formal grammars. The Lagrange theorem Analytic properties of functions represented as power series and their asymptotics of their coefficients Generating functions of several variables Partitions and decompositions Dirichlet generating functions and the inclusion-exclusion principle Enumeration of embedded graphs Final and bibliographical remarks Bibliography Index.

Read more less

Book SynopsisBased on lectures given at the CBMS Workshop on the Combinatorics of Large Sparse Graphs, this work presents fresh perspectives in graph theory and helps to contribute to a sound scientific foundation for our understanding of discrete networks that permeate the information age.Table of ContentsGraph theory in the information age Old and new concentration inequalities A generative model--the preferential attachment scheme Duplication models for biological networks Random graphs with given expected degrees The rise of the giant component Average distance and the diameter Eigenvalues of the adjacency matrix of $G(\mathbf{w})$ The semi-circle law for $G(\mathbf{w})$ Coupling on-line and off-line analyses of random graphs The configuration model for power law graphs The small world phenomenon in hybrid graphs Bibliography Index.

Read more less

Book SynopsisStarts with necessary information about matrices, algebras, and groups. This title then proceeds to representations of finite groups. It includes several chapters dealing with representations and characters of symmetric groups and the closely related theory of symmetric polynomials.Table of ContentsMatrices Algebras Groups The Frobenius algebra The symmetric group Immanants and $S$-functions $S$-functions of special series The calculation of the characters of the symmetric group Group characters and the structure of groups Continuous matrix groups and invariant matrices Groups of unitary matrices Appendix Bibliography Supplementary bibliography Index.

Read more less

Book SynopsisOne of the most active areas in mathematics is the topic of 'additive combinatorics'. This book brings together key researchers from different areas, sharing their insights in articles meant to inspire mathematicians coming from various backgrounds.Table of ContentsAn introduction to additive combinatorics by A. Granville Elementary additive combinatorics by J. Solymosi Many additive quadruples by A. Balog An old new proof of Roth's theorem by E. Szemeredi Bounds on exponential sums over small multiplicative subgroups by P. Kurlberg Montreal notes on quadratic Fourier analysis by B. Green Ergodic methods in additive combinatorics by B. Kra The ergodic and combinatorial approaches to Szemeredi's theorem by T. Tao Cardinality questions about sumsets by I. Z. Ruzsa Open problems in additive combinatorics by E. S. Croot III and V. F. Lev Some problems related to sum-product theorems by M.-C. Chang Lattice points on circles, squares in arithmetic progressions and sumsets of squares by J. Cilleruelo and A. Granville Problems in additive number theory. I by M. B. Nathanson Double and triple sums modulo a prime by K. Gyarmati, S. Konyagin, and I. Z. Ruzsa Additive properties of product sets in fields of prime order by A. A. Glibichuk and S. V. Konyagin Many sets have more sums than differences by G. Martin and K. O'Bryant Devenport's constant for groups of the form $\mathbb{Z}_3\oplus\mathbb{Z}_3\oplus\mathbb{Z}_{3d}$ by G. Browmik and J.-C. Schlage-Puchta Some combinatorial group invariants and their generalizations with weights by S. D. Adhikari, R. Balasubramanian, and P. Rath.

Read more less

Book SynopsisFocuses on integrable systems and symmetries presents new results on applications of symmetries and integrability techniques to the case of equations defined on the lattice. This relatively new field has many applications, for example, in describing the evolution of crystals and molecular systems defined on lattices.Table of Contents Introduction Integrability and symmetries of nonlinear differential and difference equations in two independent variables Symmetries as integrability criteria Construction of lattice equations and their Lax pair Transformation groups for quad lattice equations Algebraic entropy of the nonautonomous Boll equations Translation from Russian of R. I. Yamilov, ''On the classification of discrete eqautions'', reference [841] No quad-graph equation can have a generalized symmetry given by the narita-Itoh-Bogoyavlensky equation Bibliography Subject Index

Read more less

Book SynopsisContains a collection of mathematical applications of linear algebra, mainly in combinatorics, geometry, and algorithms. Each chapter covers a single main result with motivation and full proof, and assumes only a modest background in linear algebra. The topics include Hamming codes, the matrix-tree theorem, the Lovász bound on the Shannon capacity, and a counterexample to Borsuk's conjecture.Trade ReviewFinding examples of "linear algebra in action" that are both accessible and convincing is difficult. Thirty-three Miniatures is an attempt to present some usable examples. . . . For me, the biggest impact of the book came from noticing the tools that are used. Many linear algebra textbooks, including the one I use, delay discussion of inner products and transpose matrices till later in the course, which sometimes means they don't get discussed at all. Seeing how often the transpose matrix shows up in Matousek's miniatures made me realize space must be made for it. Similarly, the theorem relating the rank of the product of two matrices to the ranks of the factors plays a big role here. Most linear algebra instructors would benefit from this kind of insight. . . . Thirty-three Miniatures would be an excellent book for an informal seminar offered to students after their first linear algebra course. It may also be the germ of many interesting undergraduate talks. And it's fun as well." - Fernando Q. Gouvêa, MAA Reviews"[This book] is an excellent collection of clever applications of linear algebra to various areas of (primarily) discrete/combinatiorial mathematics. ... The style of exposition is very lively, with fairly standard usage of terminologies and notations. ... Highly recommended." - ChoiceTable of Contents Preface Notation Fibonacci numbers, quickly Fibonacci numbers, the formula The clubs of Oddtown Same-size intersections Error-correcting codes Odd distances Are these distances Euclidean? Packing complete bipartite graphs Equiangular lines Where is the triangle? Checking matrix multiplication Tiling a rectangle by squares Three Petersens are not enough Petersen, Hoffman–Singleton, and maybe 57 Only two distances Covering a cube minus one vertex Medium-size intersection is hard to avoid On the difficulty of reducing the diameter The end of the small coins Walking in the yard Counting spanning trees In how many ways can a man tile a board? More bricks—more walls? Perfect matchings and determinants Turning a ladder over a finite field Counting compositions Is it associative? The secret agent and umbrella Shannon capacity of the union: a tale of two fields Equilateral sets Cutting cheaply using eigenvectors Rotating the cube Set pairs and exterior products Index

Read more less

Book SynopsisTable of ContentsAutomated theorem proving: a quarter century review by D. W. Loveland Citation to Hao Wang Computer theorem proving and artificial intelligence by H. Wang Citation to Lawrence Wos and Steven Winker Open questions solved with the assistance of AURA by L. Wos and S. Winker Some automatic proofs in analysis by W. W. Bledsoe Proof-checking, theorem-proving, and program verification by R. S. Boyer and J. S. Moore A mechanical proof of the turing completeness of pure LISP by R. S. Boyer and J. S. Moore Automating higher-order logic by P. B. Andrews, D. A. Miller, E. L. Cohen, and F. Pfenning Abelian group unification algorithms for elementary terms by D. Lankford, G. Butler, and B. Brady Combining satisfiability procedures by equality sharing by G. Nelson On the decision problem and the mechanization of theorem-proving in elementary geometry by W. Wen-Tsun Some recent advances in mechanical theorem-proving of geometries by W. Wen-Tsun Proving elementary geometry theorems using Wu's algorithm by S.-C. Chou Automated theory formation in mathematics by D. B. Lenat Student use of an interactive theorem prover by J. McDonald and P. Suppes.

Read more less

Book SynopsisContains the proceedings of the first DIMACS workshop. This work covers topics including multicommodity flows, graph matchings and colorings, the traveling salesman problem, integer programming and complexity theory. It is suitable for researchers in combinatorics and combinatorial optimization.Table of ContentsMatrix cones, projection representations, and stable set polyhedra by L. Lovasz and A. Schrijver A generalization of Lovasz's $\theta$ function by G. Narasimhan and R. Manber On cutting planes and matrices by A. M. H. Gerards Random volumes in the $n$-cube by M. E. Dyer, A. Furedi, and C. McDiarmid Test sets for integer programs, $\forall \exists$ sentences by R. Kannan Solvable classes of generalized traveling salesman problems by S. N. Kabadi and R. Chandrasekaran Handles and teeth in the symmetric traveling salesman polytope by D. Naddef On the complexity of branch and cut methods for the traveling salesman problem by W. Cook and M. Hartmann Existentially polytime theorems by K. Cameron and J. Edmonds The width-length inequality and degenerate projective planes by A. Lehman On Lehman's width-length characterization by P. D. Seymour Applications of polyhedral combinatorics to multicommodity flows and compact surfaces by A. Schrijver Vertex-disjoint simple paths of given homotopy in a planar graph by A. Frank and A. Schrijver On disjoint homotopic paths in the plane by A. Frank On the complexity of the disjoint paths problem (extended abstract) by M. Middendorf and F. Pfeiffer The paths-selection problem by M. Middendorf and F. Pfeiffer Planar multicommodity flows, max cut, and the Chinese postman problem by F. Barahona The cographic multiflow problem: An epilogue by A. Sebo Exact edge-colorings of graphs without prescribed minors by O. Marcotte On the chromatic index of multigraphs and a conjecture of Seymour, (II) by O. Marcotte Spanning trees of different weights by A. Schrijver and P. D. Seymour.

Read more less

Book SynopsisTrade ReviewWritten by an eminent expert as the first monograph on this topic, this book can be recommended to anybody working on large networks and their applications in mathematics, computer science, social sciences, biology, statistical physics or chip design." - Zentralblatt Math"This is an amazing book: readable, deep, and lively. It sets out this emerging area, makes connections between old classical graph theory and graph limits, and charts the course of the future." - Persi Diaconis, Stanford University"It is always exciting when a mathematical theory turns out to be connected to a variety of other topics. This is the case with the recently developed subject of graph limits, which exhibits tight relations with a wide range of areas including statistical physics, analysis, algebra, extremal graph theory, and theoretical computer science. The book Large Networks and Graph Limits contains a comprehensive study of this active topic and an updated account of its present status. The author, Laszls Lovasz, initiated the subject, and together with his collaborators has contributed immensely to its development during the last decade. This is a beautiful volume written by an outstanding mathematician who is also an excellent expositor." - Noga Alon, Tel Aviv University, Israel"Modern combinatorics is by no means an isolated subject in mathematics, but has many rich and interesting connections to almost every area of mathematics and computer science. The research presented in Lovasz's book exemplifies this phenomenon by taking one of the most quintessentially combinatorial of objects--the finite graph--and through the process of taking limits of sequences of such graphs, reveals and clarifies connections to measure theory, analysis, statistical physics, metric geometry, spectral theory, property testing, algebraic geometry, and even Hilbert's tenth and seventeenth problems. Indeed, this book presents a wonderful opportunity for a student in combinatorics to explore other fields of mathematics, or conversely for experts in other areas of mathematics to become acquainted with some aspects of graph theory." - Terence Tao, University of California, Los Angeles, CA"László Lovász has written an admirable treatise on the exciting new theory of graph limits and graph homomorphisms, an area of great importance in the study of large networks. It is an authoritative, masterful text that reflects Lovász's position as the main architect of this rapidly developing theory. The book is a must for combinatorialists, network theorists, and theoretical computer scientists alike." - Bela Bollobas, Cambridge University, UKTable of Contents Preface Part 1. Large graphs: An informal introduction Very large networks Large graphs in mathematics and physics Part 2. The algebra of graph homomorphisms Notation and terminology Graph parameters and connection matrices Graph homomorphisms Graph algebras and homomorphism functions Part 3. Limits of dense graph sequences Kernels and graphons The cut distance Szemerédi partitions Sampling Convergence of dense graph sequences Convergence from the right On the structure of graphons The space of graphons Algorithms for large graphs and graphons Extremal theory of dense graphs Multigraphs and decorated graphs Part 4. Limits of bounded degree graphs Graphings Convergence of bounded degree graphs Right convergence of bounded degree graphs On the structure of graphings Algorithms for bounded degree graphs Part 5. Extensions: A brief survey Other combinatorial structures Appendix A Bibliography Author index Subject index Notation index

Read more less

Book SynopsisTrade ReviewThis is one among the beautiful books on the subject of difference sets that I came across in the field of mathematics and especially in combinatorics because of its lucid style and simplicity...The present book overviews these subjects if not exhaustively but impressively with required theorems sometimes with full proofs and sometimes with comprehensive explanations and required examples. By the study of this book, one gains an opportunity to further explore the subject with confidence in different angles enriching one's vision for further research with the orientation of applications in the real-life situations as the authors mention such lines as well...This book lays a good foundation for the study of difference sets together with the subjects related to it and prepares the students for further extensive research." - Ratnakaram Nava Mohan, Zentralblatt MATH"It is a welcome addition to all undergraduate libraries." - CHOICE"This book would seem tailor-made as a text for a senior seminar or capstone course. It is clearly written, emphasizes motivation, contains lots of examples, has a good bibliography and contains a respectable number of exercises at the end of each chapter. ... Reading this book taught me some nice mathematics that I didn't know before, and it did so in an interesting, enjoyable way." - MAA ReviewsTable of ContentsTable of Contents: Introduction Designs Automorphisms of designs Introducing difference sets Bruck-Ryser-Chowla theorem Multipliers Necessary group conditions Difference sets from geometry Families from Hadamard matrices Representation theory Group characters Using algebraic number theory Applications Background Notation Hints and solutions to selected exercises Bibliography Index Index of parameters

Read more less

Book SynopsisThoroughly revised, updated, expanded, and reorganized to serve as a primary text for mathematics courses, Introduction to Set Theory, Third Edition covers the basics: relations, functions, orderings, finite, countable, and uncountable sets, and cardinal and ordinal numbers. It also provides five additional self-contained chapters, consolidates the material on real numbers into a single updated chapter affording flexibility in course design, supplies end-of-section problems, with hints, of varying degrees of difficulty, includes new material on normal forms and Goodstein sequences, and adds important recent ideas including filters, ultrafilters, closed unbounded and stationary sets, and partitions.Trade Review"The book remains an excellent text for a senior undergraduate or first-year graduate level course. There is sufficient material for instructors of widely differing views to assemble one-semester courses. . ..the chapter on the axiom of choice is particularly strong. "---Mathematical Reviews ". . .a fine text. . ..The proofs are both elegant and readable. "---American Mathematical Monthly ". . .offers many benefits including. . .interesting applications of abstract set theory to real analysis. . .enriching standard classroom material. "---L'Enseignement mathematique ". . .an excellent and much needed book. . .Especially valuable are a number of remarks sprinkled throughout the text which afford a glimpse of further developments. "---The Mathematical Intelligencer "The authors show that set theory is powerful enough to serve as an underlying framework for mathematics by using it to develop the beginnings of the theory of natural, rational, and real numbers. "---Quarterly Review of Applied Mathematics ". . .In the third edition, Chapter 11 has been expanded, and four new chapters have been added. "---Mathematical ReviewsTable of ContentsSets; relations, functions and orderings; natural numbers; finite, countable and uncountable sets; cardinal numbers; ordinal numbers; alephs; the axiom of choice; arithmetic of cardinal numbers; sets of real numbers; filters and ultrafilters; combinatorial set theory; large cardinals; the axiom of foundation; the axiomatic set theory.

Read more less

Book SynopsisEmphasizing the creative nature of mathematics, this conversational textbook guides students through the process of discovering a proof as they transition to advanced mathematics. Using several strategies, students will develop the thinking skills needed to tackle mathematics when there is no clear algorithm or recipe to follow.Trade Review'Every student in the sciences should be exposed to the basic language of modern mathematics, and standard courses such as calculus or linear algebra do not play this role. The ideal textbook for such a course should not attempt to be encyclopedic and should not assume special prerequisites. It should cover a carefully chosen selection of topics efficiently, engagingly, thoroughly, without being overbearing. Fuchs' text fits this description admirably. The level is right, the math is rock solid, the writing is very pleasant. The book talks to the reader, without ever sounding patronizing. A vast selection of problems, many including solutions, will be splendidly helpful both in a classroom setting and for self-study.' Paolo Aluffi, Florida State University'This well-written text strikes a good balance between conciseness and clarity. Students are led from looking more deeply into familiar topics, such as the quadratic formula, to an understanding of the nature, structure, and methods of proof. The examples and problems are a strong point. I look forward to teaching from it.' Eric Gottlieb, Rhodes College'Fuchs' text is an excellent addition to the 'transitions to proof' literature. I will use it when I next teach such a course. Except for the excellent 'Additional Topics' sections, the content is standard, but the spiraling presentation and helpful narrative around proofs are what truly elevate this text. Fuchs has made every attempt to connect the structure and rigor of mathematics with the intuition of the student. For example, the notion of function arises in three different chapters, with two increasingly rigorous 'provisional definitions,' before a complete definition is given within a wider discussion of relations. I anticipate this approach resonating with students. Fuchs' Chapter 3, which introduces logic and proof strategies, is the most usable presentation of the material I have seen or used. The practice of mathematics and mathematical thinking is communicated well, while opportunities for confusion and obfuscation via a blizzard of symbols are minimized.' Ryan Grady, Montana State University'This book is a must-have resource for an undergraduate mathematics student or interested reader to learn the fundamental topics in how to prove things. The text is thorough and of top quality, yet it is conversational and easy to absorb. Maybe the most important quality, it offers advice about how to approach problems, making it perfect for an introduction to proofs class.' Andrew McEachern, York University, Canada'This is a great choice of textbook for any course introducing undergraduates to mathematical proofs. What makes this book stand out are the early chapters, as well as the 'Additional Topics,' both with accompanying exercises. The book begins by gently introducing proof-based thinking by posing well-motivated prompts and exercises concerning familiar arithmetic of real numbers and the integers. It then introduces fields as a playground to practice working with axioms and drawing (sometimes surprising) conclusions from them. The book proceeds with introducing formal logic, mathematical induction, set theory, and relations on sets. The book's design nicely enables framing classes around a choice sampling among the abundant exercises. The book's 'Additional Topics' can serve to engage those students with a brimming imagination and who are already familiar with basic notions of proofs.' David Ayala, Montana State University'Fuchs' Introduction to Proofs and Proof Strategies is an excellent textbook choice for an undergraduate proof-writing course. The author takes a friendly and conversational approach, giving many worked examples throughout each section. Furthermore, each section is replete with exercises for the reader, along with fully worked solutions at chapter's end. This is exactly the 'get your hands dirty' approach students and readers will benefit greatly from!' Frank Patane, Samford University'The book Introduction to Proofs and Proof Strategies by Shay Fuchs takes the problem-solving approach to the forefront by accompanying the reader in the construction and deconstruction of proofs through numerous examples and challenging exercises. The fundamental principles of mathematics are introduced in a creative and innovative way, making learning an enjoyable journey.' Roberto Bruni, Università di Pisa'This textbook is easy to read and designed to enhance students' problem-solving skills in their first year of university. The book really stands out due to the variety and quality of exercises at the end of each chapter. The latter chapters dive into more advanced topics for interested students.' Marina Tvalavadze, University of Toronto MississaugaTable of ContentsContents; Preface; Part I. Core Material; 1. Numbers, Quadratics and Inequalities; 2. Sets, Functions and the Field Axioms; 3. Informal Logic and Proof Strategies; 4. Mathematical Induction; 5. Bijections and Cardinality; 6. Integers and Divisibility; 7. Relations; Part II. Additional Topics; 8. Elementary Combinatorics; 9. Preview of Real Analysis – Limits and Continuity; 10. Complex Numbers; 11. Preview of Linear Algebra; Notes; References; Index.

Read more less

Book SynopsisRichard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This updated edition provides the only comprehensive high-level treatment of enumerative combinatorics, including the theory of symmetric functions, with over 150 new exercises and solutions.Trade Review'This is one of the great books; readable, deep and full of gems. It brings algebraic combinatorics to life. I teach out of it and feel that if I can get my students to 'touch Stanley' I have given them a gift for life.' Persi Diaconis, Stanford University'It is wonderful to celebrate the completion of the second edition of Richard Stanley's Enumerative Combinatorics, one of the finest mathematical works of all time. He has added nearly 200 exercises, together with their answers, to what was already a uniquely masterful summary of a vast and beautiful theory. When paired with the second edition of Volume 1, his two classic volumes will surely be a timeless treasure for generations to come.' Donald E. Knuth, Stanford University'An updated classic with a mesmerizing array of interconnected examples. Through Stanley's masterful exposition, the current and future generations of mathematicians will learn the inherent beauty and pleasures of enumeration.' June Huh, Princeton University'I have used Richard Stanley's books on Enumerative Combinatorics numerous times for the combinatorics classes I have taught. This new edition contains many new exercises, which will no doubt be extremely useful for the next generation of combinatorialists.' Anne Schilling, University of California, Davis'Richard Stanley's Enumerative Combinatorics, in two volumes, is an essential reference for researchers and graduate students in the field of enumeration. Volume 2, newly revised, includes comprehensive coverage of composition and inversion of generating functions, exponential and algebraic generating functions, and symmetric functions. The treatment of symmetric functions is especially noteworthy for its thoroughness and accessibility. Engaging problems and solutions, and detailed historical notes, add to the value of this book. It provides an excellent introduction to the subject for beginners while also offering advanced researchers new insights and perspectives.' Ira Gessel, Brandeis UniversityTable of ContentsPreface to Second Edition; Preface; 5. Trees and the Composition of Generating Functions; 6. Algebraic Generating Functions; 7. Symmetric Functions; Appendices: References; Index.

Read more less

Book SynopsisThis graduate level textbook covers classical and modern developments in graph theory and additive combinatorics, presenting arguments as a cohesive whole. Students will appreciate the chapter summaries, many figures and exercises, as well as the complementary set of lecture videos freely available through MIT OpenCourseWare.Trade Review'Yufei Zhao does great mathematics and has an uncanny ability to explain the deepest results with clear understandable prose. For anyone interested in the seminal ideas (and their interrelationships) of recent decades - pseudorandomness, graphons, graph regularity, to name a few - this is the book to read and savor.' Joel Spencer, New York University'This impeccable book should quickly become a classic text in discrete maths. A huge selection of topics is treated elegantly, with beautiful illustrations, and in just the `right' amount of detail to arouse the interest of the reader and leave them well placed to find out more. In particular, the second half of the book is a superb introduction to additive combinatorics, which I will happily recommend to any student in this area.' Ben Green, Oxford University'This charming text gives an accessible introduction to the connected topics of extremal graph theory and modern additive combinatorics. The focus is very strongly on presenting intuition and restricting attention to the simplest possible instances of methods or classes of results, rather than aiming for maximal generality or the strongest statements; instead, references are given for further reading, or for the proofs of important theorems that are only stated here. Being highly suitable for advanced undergraduates or beginning graduate students, it fills a niche that is currently not occupied by other texts in these highly active areas of current mathematical research.' Terry Tao, University of California, Los Angeles'A valuable and readable unified treatment of a fast-moving area of combinatorics from one of the world's experts - sure to become a standard resource.' Jordan Ellenberg, University of Wisconsin-Madison'Yufei Zhao's book is a wonderful book about graph theory, additive combinatorics, and their surprising connections, involving a major theme of modern mathematics: the interplay between structure and randomness. In both areas, the book can take the curious reader, whether an advanced undergraduate or a professional mathematician, on a joyous journey from the very basics to state-of-the-art research. Yufei Zhao himself is a major player in modern research in both these areas and his presentation is a tour de force.' Gil Kalai, Hebrew University of Jerusalem and Reichman University'This is a beautiful treatment of extremal graph theory and additive combinatorics, focusing on the fruitful interplay between the two. The book covers the classical results as well as recent developments in this active area. It is a fascinating manuscript that would appeal to students and researchers with an interest in discrete mathematics, theoretical computer number theory, and related areas.' Noga Alon, Princeton University'This is a wonderful, well-written account of additive combinatorics from the graph theoretic perspective. Zhao skillfully ties in this approach to the usual statements and gives a thorough development of the subject. This book is indispensable for any serious researcher in this area. Beginners will find a thorough account of the subject with plenty of motivation. The more experienced reader will appreciate the authors' insights and elegant development of some difficult ideas.' Andrew Granville, University of MontréalTable of ContentsPreface; Notation and Conventions; Appetizer: triangles and equations; 1. Forbidding a subgraph; 2. Graph regularity method; 3. Pseudorandom graphs; 4. Graph limits; 5. Graph homomorphism inequalities; 6. Forbidding 3-term arithmetic progressions; 7. Structure of set addition; 8. Sum-product problem; 9. Progressions in sparse pseudorandom sets; References; Index.

Read more less