Discrete mathematics Books
Springer International Publishing AG The Stair-Step Approach in Mathematics
Book SynopsisThis book is intended as a teacher’s manual and as an independent-study handbook for students and mathematical competitors. Based on a traditional teaching philosophy and a non-traditional writing approach (the stair-step method), this book consists of new problems with solutions created by the authors. The main idea of this approach is to start from relatively easy problems and “step-by-step” increase the level of difficulty toward effectively maximizing students' learning potential. In addition to providing solutions, a separate table of answers is also given at the end of the book. A broad view of mathematics is covered, well beyond the typical elementary level, by providing more in depth treatment of Geometry and Trigonometry, Number Theory, Algebra, Calculus, and Combinatorics.Trade Review“This book is original, enticing, and highly stimulating, and it is a useful addition to the competition-oriented literature.” (Stephen Rout, The Mathematical Gazette, Vol. 104 (560), July, 2020)Table of ContentsGeometry and Trigonometry.- Number Theory.- Algebra.- Calculus.- Combinatorics.- Hints.- Solutions.- Answers.
£41.24
Springer Fachmedien Wiesbaden Grundlagen der Mathematischen Optimierung:
Book SynopsisDas Buch stellt wesentliche Ansätze, Ergebnisse und Methoden der linearen und ganzzahligen Optimierung dar. Ziel ist es, eine solide mathematische Grundlage des Gebietes und seiner wichtigsten algorithmischen Ansätze zu entwickeln. Methodisch zentral ist der geometrische Zugang.Table of ContentsEinleitung. - Einstiege: Ungleichungssysteme und diskrete Strukturen. - Einstiege: Algorithmen und Komplexität. - Konvexitätstheorie - Der Simplex-Algorithmus. - LP-Dualität.
£32.99
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Improved Bonferroni Inequalities via Abstract
Book SynopsisThis introduction to the recent theory of abstract tubes describes the framework for establishing improved inclusion-exclusion identities and Bonferroni inequalities, which are provably at least as sharp as their classical counterparts while involving fewer terms. All necessary definitions from graph theory, lattice theory and topology are provided. The role of closure and kernel operators is emphasized, and examples are provided throughout to demonstrate the applicability of this new theory. Applications are given to system and network reliability, reliability covering problems and chromatic graph theory. Topics also covered include Zeilberger's abstract lace expansion, matroid polynomials and Möbius functions.Table of Contents1. Introduction and Overview.- 2. Preliminaries.- 3.Bonferroni Inequalities via Abstract Tubes.- 4. Abstract Tubes via Closure and Kernel Operators.- 5. Recursive Schemes.- 6. Reliability Applications.- 7. Combinatorial Applications and Related Topics.- Bibliography.- Index.
£31.99
Springer Spektrum Mathematik in Theorie und Praxis
Book SynopsisInterview.- Mathematische Konzepte in der Finanzwirtschaft und deren Anwendung.- Kombinatorik: Die Kunst, "alles auf einen Blick zu erkennen.
£21.84
Springer Verlag Il concetto di curvatura: Genesi, sviluppo e intreccio fisico-matematico
Book SynopsisQuesto breve libro propone con uno spirito via via d’immagine storiografica e di dettaglio matematico, la nascita e l’evoluzione del concetto di curvatura: le sue origini ancestrali nella meccanica, nell’astronomia, nella geodesia, e infine, chiaramente nella geometria. Gli aspetti tecnici, a volte estremamente semplici, altre volte complessi, sono sempre accompagnati da spiegazioni che si sperano esaurienti.È ben noto che su entrambi i versanti culturali proposti nel libro, molto si è scritto e ad altissimo livello; qui, c’è un tentativo di sintesi, della storiografia e della matematica sul tema della curvatura. Il racconto del filo che intercorre tra Huygens, Gauss, Riemann, Christoffel, Ricci Curbastro, Levi-Civita e infine Einstein, è stato sicuramente già ben proposto sul versante puramente storico o in quello prettamente matematico: è una speranza che la narrazione qui presentata, con questi punti di vista intrecciati, sia infine soddisfacente. Il tentativo andava fatto. L’augurio forte è che gli argomenti narrati risultino coinvolgenti per il lettore, spingendolo ad esplorare autonomamente altri aspetti magari nascosti nelle pieghe della nozione di curvatura e del mondo che ci vive attorno. Il volume muove inizialmente dal racconto di qualche frammento di cosmologia antica e medioevale. Tutto ciò è solo apparentemente estraneo al corpo vivo della materia: ritroveremo per esempio che la concezione cosmologica di Dante, riassunta qui matematicamente, propose un universo come un’ipersfera 3-dimensionale che, quasi incidentalmente, risulterà proprio il modello cosmologico offerto da Einstein nel 1917 per il suo universo chiuso e statico. Ed è proprio la curvatura che domina quella scena, oggetto matematico protagonista della teoria della relatività generale einsteniana. I personaggi prima elencati vengono comunque narrati anche nelle loro salienti vicende umane, a volte altamente drammatiche, come accadde per esempio per Riemann e Tullio Levi-Civita. In un certo senso, la storia della curvatura accompagna la storia dell’umanità.Benché inizialmente sia stato generato da un disegno didattico, il volume è indirizzato ad un pubblico non necessariamente studentesco, con una cultura scientifica di base.Table of Contents1 Tracce di cosmologia.- 2 Prima di Gauss.- 3 Gauss.- 4 Riemann.- 5 Christoffel.- 6 Ricci Curbastro.- 7 Levi-Civita.- 8 Tracce di geometria differenziale.- 9 Einstein.
£21.84
Birkhauser Verlag AG The Seventh European Conference on Combinatorics,
Book SynopsisIn the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.Table of Contents90 to 100 extended abstracts accepted by the Program Committee of Eurocomb 2013, formed by 24 experts in the field, for presentation at the forthcoming Conference Eurocomb 2013, Pisa, September 3-9, 2013.
£24.69
Birkhauser Verlag AG Geometry, Structure and Randomness in
Book SynopsisThis book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include: graph representations, structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.Table of ContentsImre Bárány: Tensors, colours, octahedral.- Maria Chudnovsky: Cliques and stable sets in undirected graphs.- Mauro Di Nasso: A taste of nonstandard methods in combinatorics of numbers.- Béla Bollobás, Zoltán Füredi, Ida Kantor, G. O. H. Katona and Imre Leader: A coding problem for pairs of subsets.- Jirí Matousek: String graphs and separators.- Jaroslav Nesetril and Patrice Ossona de Mendez: On first-order definable colorings.- Ryan Schwartz and József Solymosi: Combinatorial applications of the subspace theorem.- Peter Hegarty and Dmitry Zhelezov: Can connected commuting graphs of finite groups have arbitrarily large diameter?
£24.69
Hindustan Book Agency Combinatorial Techniques
£46.80
Springer Verlag, Singapore Synergies in Analysis, Discrete Mathematics, Soft
Book SynopsisThis book contains select papers on mathematical analysis and modeling, discrete mathematics, fuzzy sets, and soft computing. All the papers were presented at the international conference on FIM28-SCMSPS20 virtually held at Sri Sivasubramaniya Nadar (SSN) College of Engineering, Chennai, India, and Stella Maris College (Autonomous), Chennai, from November 23–27, 2020. The conference was jointly held with the support of the Forum for Interdisciplinary Mathematics. Both the invited articles and submitted papers were broadly grouped under three heads: Part 1 on analysis and modeling (six chapters), Part 2 on discrete mathematics and applications (six chapters), and Part 3 on fuzzy sets and soft computing (three chapters).Table of ContentsPART I ANALYSIS AND MODELLINGThe Second- and Third-order Hermitian Toeplitz Determinants for Some Subclasses of Analytic Functions Associated with Exponential Function,P.Gurusamy, R. Jayasankar and S. SivasubramanianSome Results on a Starlike Class with Respect to $(j, m) $-symmetric FunctionsK. Renuka Devi, S. Sivasubramanian, Hamid Shamsan and S. LathaExperimental Evaluation of Four Intermediate Filters to Improve the Motion Field EstimationVanel Lazcano and Claudio Isa-MohorOn the $s^{th}$ Derivative of a PolynomialBarchand Chanam and Kshetrimayum KrishnadasOn the Problem of Pricing a Double Barrier Option in a Modified Black–Scholes Environment G. Venkiteswaran and S. UdayabaskaranCaputo Sequential Fractional Differential Equations with ApplicationsAghalaya S. Vatsala and Govinda PageniPART II DISCRETE MATHEMATICS AND APPLICATIONSHerscovici’s Conjecture on Product of Some Complete Bipartite GraphsA. Lourdusamy and S. Saratha NellainayakiOn Fault-Tolerant Metric Dimension of Heptagonal Circular Ladder and Its Related GraphsSunny Kumar Sharma and Vijay Kumar BhatBKS Fuzzy Inference Employing h-ImplicationsSayantan Mandal and Balasubramaniam Jayaram Note on Distributivity of Different String Operations over Language SetsUjjwal Kumar Mishra, Kalpana Mahalingam and Rama RaghavanA Generalization of Chi-binding FunctionsM. A. Shalu and T. P. SandhyaA Short Proof of Ore’s f-factor Theorem using FlowsSriraman Sridharan and Patrick VilamajoPART III FUZZY SETS AND SOFT COMPUTINGA Decision-making Problem Involving Soft Fuzzy Number Valued Information System: Energy Efficient Light Emitting Diode BlubsFelbin C. Kennedy, Masilla Moses Kennedy, Arul Roselet Meryline S. andJayachandiran M.Role of Single-valued Linear Octagonal Neutrosophic Numbers in Multi-attribute Decision-making ProblemsSubasri S., Arul Roselet Meryline S. and Felbin C. Kennedy
£82.49
Springer Fundamental Discrete Structures
Book SynopsisMathematical Logic.- Sets and Relations.- Functions.- Methods of Proofs.- Elementary Combinatorics.- Recurrences and Generating Functions.- Graph Theory.- Algebraic Systems.- Posets, Lattices and Boolean Algebras.- Automata Theory and Formal Languages.- Some Further Applications.
£56.99
Springer Verlag, Singapore Treks into Intuitive Geometry
Book SynopsisThis book is written in a style that uncovers the mathematical theories hidden in our daily lives, using examples of patterns that appear in nature, arts, traditional crafts, as well as mathematical mechanics in architectural techniques.
£999.99
Association of Computing Machinery,U.S. Logic, Automata, and Computational Complexity:
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.
£59.50
Taylor & Francis Ltd Combinatorics of Permutations
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
£105.00
Taylor & Francis Ltd Volumetric Discrete Geometry Discrete Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£104.50
Taylor & Francis Ltd Discrete Structures and Their Interactions
a huge range and FREE tracked UK delivery on ALL orders.
£58.89
Taylor & Francis Ltd Agents Games and Evolution Strategies at Work and Play
a huge range and FREE tracked UK delivery on ALL orders.
£58.89
Taylor & Francis Ltd Diophantine Analysis
a huge range and FREE tracked UK delivery on ALL orders.
£58.89
Taylor & Francis Ltd Proceedings of the Eighth International Conference on Difference Equations and Applications
a huge range and FREE tracked UK delivery on ALL orders.
£58.89
Taylor & Francis Ltd Restricted Congruences in Computing
a huge range and FREE tracked UK delivery on ALL orders.
£24.51
Taylor & Francis Ltd Bornologies and Lipschitz Analysis
a huge range and FREE tracked UK delivery on ALL orders.
£80.74
Taylor & Francis Ltd Topics in Graph Theory
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.
£73.14
Taylor & Francis Ltd Methods for the Summation of Series
a huge range and FREE tracked UK delivery on ALL orders.
£199.50
Taylor & Francis Ltd An Introduction to Bond Graph Modeling with Applications
a huge range and FREE tracked UK delivery on ALL orders.
£114.00
Taylor & Francis Ltd An Introduction to Bond Graph Modeling with Applications
a huge range and FREE tracked UK delivery on ALL orders.
£43.69
Taylor & Francis Ltd Real Analysis
a huge range and FREE tracked UK delivery on ALL orders.
£43.99
Taylor & Francis Ltd Discrete Mathematics for Computer Science
a huge range and FREE tracked UK delivery on ALL orders.
£47.49
Taylor & Francis Ltd Abstract Calculus
a huge range and FREE tracked UK delivery on ALL orders.
£147.25
Taylor & Francis Ltd The Elements of Advanced Mathematics
Book SynopsisThis book has enjoyed considerable use and appreciation during its first four editions. With hundreds of students having learned out of early editions, the author continues to find ways to modernize and maintain a unique presentation.What sets the book apart is the excellent writing style, exposition, and unique and thorough sets of exercises. This edition offers a more instructive preface to assist instructors on developing the course they prefer. The prerequisites are more explicit and provide a roadmap for the course. Sample syllabi are included.As would be expected in a fifth edition, the overall content and structure of the book are sound.This new edition offers a more organized treatment of axiomatics. Throughout the book, there is a more careful and detailed treatment of the axioms of set theory. The rules of inference are more carefully elucidated.Additional new features include: An emphasis on the artTrade ReviewThe great strength of the book overall and of the chapters I read is a very accessible writing style, and extremely good exercises. The mix of discussion of advanced topics alongside the presentation of more elementary material is excellent. This is a product of having a highly accomplished and knowledgeable mathematician writing a textbook intended for not-so-advanced students.--David Walnut, George Washington UniversityTable of Contents1. Basic Logic 2. Methods of Proof 3. Set Theory 4. Relations and Functions 5. Group Theory 6. Number Systems 7. More on the Real Number System 8. A Glimpse of Topology 9. Elementary Number Theory 10. Zero-Knowledge Proofs and Cryptography 11. An Example of an Axiomatic Theory
£80.74
Taylor & Francis Ltd The Baseball Mysteries
The Baseball Mysteries: Challenging Puzzles for Logical Detectives is a book of baseball puzzles, logical baseball puzzles. To jump in, all you need is logic and a casual fan's knowledge of the game. The puzzles are solved by reasoning from the rules of the game and a few facts.The logic in the puzzles is like legal reasoning. A solution must argue from evidence (the facts) and law (the rules). Unlike legal arguments, however, a solution must reach an unassailable conclusion.There are many puzzle books. But there's nothing remotely like this book. The puzzles here, while rigorously deductive, are firmly attached to actual events, to struggles that are reported in the papers every day.The puzzles offer a unique and scintillating connection between abstract logic and gritty reality.Actually, this book offers the reader an unlimited number of puzzles. Once you've solved a few of the challenges here, every boxscore you see in the pap
£23.99
Taylor & Francis Ltd Numerical Techniques in MATLAB
Book SynopsisIn this book, various numerical methods are discussed in a comprehensive way. It delivers a mixture of theory, examples and MATLAB practicing exercises to help the students in improving their skills. To understand the MATLAB programming in a friendly style, the examples are solved. The MATLAB codes are mentioned in the end of each topic. Throughout the text, a balance between theory, examples and programming is maintained.Key Features Methods are explained with examples and codes System of equations has given full consideration Use of MATLAB is learnt for every method This book is suitable for graduate students in mathematics, computer science and engineering.Table of Contents1. Common Commands Used in Matlab. 2. System of Linear Equations. 3. Polynomial Interpolation. 4. Root Finding Methods. 5. Numerical Integration. 6. Solution of Initial Value Problems. 7. Boundary Value Problems.
£87.39
Taylor & Francis Ltd Real Analysis
Book SynopsisReal Analysis: An Undergraduate Problem Book for Mathematicians, Applied Scientists, and Engineers is a classical Real Analysis/Calculus problem book. This topic has been a compulsory subject for every undergraduate studying mathematics or engineering for a very long time. This volume contains a huge number of engaging problems and solutions, as well as detailed explanations of how to achieve these solutions. This latter quality is something that many problem books lack, and it is hoped that this feature will be useful to students and instructors alike. FeaturesHundreds of problems and solutions Can be used as a stand-alone problem book, or in conjunction with the author's textbook, Real Analysis: An Undergraduate Textbook for Mathematicians, Applied Scientists, and Engineers,ISBN 9781032481487 Perfect resource for undergraduate students studying a first course in Calculus or Real Analysis
£52.24
Taylor & Francis Ltd Automata and Computability
Book SynopsisAutomata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory of automata and computation. The author uses illustrations, engaging examples, and historical remarks to make the material interesting and relevant for students. It incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda calculus. The book also shows how to sculpt automata by making the regular language conversion pipeline available through a simple command interface. A Jupyter notebook will accompany the book to feature code, YouTube videos, and other supplements to assist instructors and studentsFeatures Uses illustrations, engaging examples, and historical remarks to make the material accessible Incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda Trade Review"I have taught formal languages and automata theory for decades, and I have seen many, perhaps most, students struggle with the material because it is so abstract. I've often thought that computer science students would learn it better by programming it. Indeed, that's how I really learned these topics -- by implementing constructions directly in practical compiler generation and formal verification tools to do my research. Prof. Gopalakrishnan's approach is to have students learn by doing, while still going into greater depth than some purely pencil-and-paper courses." -Prof. David L. Dill, Donald E. Knuth Professor, Emeritus, in the School of Engineering, Stanford University "It is probably a safe assumption to make these days that many, if not most, computer science undergraduates have had programming experience, but few of them know the language of mathematics. Professor Gopalakrishnan’s book builds on the student’s experience in programming and animates the theory of automata, formal languages, and computability with actual programs which the student can easily modify and play with. Doing is the best way of learning. This book should enable the typical computer science student to acquire a more visceral, and therefore in the long run more useful, understanding of the theory." -Dr. Ching-Tsun Chou, Silicon Architecture Engineer, Intel Corporation "As a long-time researcher in programming languages and high-performance computing, I find the coverage of Automata and Computability in this book illuminating from a foundational perspective as well as timely from a practical perspective. In addition to classical topics such as automata theory and parsing, it allows a student to interactively study via Jupyter notebooks a wide range of topics including grammar disambiguation, Boolean satisfiability, Post Correspondence and Lambda Calculus --- all important topics for students who aspire to become proficient in computer science." -Vivek Sarkar, Professor, School of Computer Science & Stephen Fleming Chair for Telecommunications, College of Computing, Georgia Institute of Technology "I have taught formal languages and automata theory for decades, and I have seen many, perhaps most, students struggle with the material because it is so abstract. I've often thought that computer science students would learn it better by programming it. Indeed, that's how I really learned these topics -- by implementing constructions directly in practical compiler generation and formal verification tools to do my research. Prof. Gopalakrishnan's approach is to have students learn by doing, while still going into greater depth than some purely pencil-and-paper courses." -Prof. David L. Dill, Donald E. Knuth Professor, Emeritus, in the School of Engineering, Stanford University "It is probably a safe assumption to make these days that many, if not most, computer science undergraduates have had programming experience, but few of them know the language of mathematics. Professor Gopalakrishnan’s book builds on the student’s experience in programming and animates the theory of automata, formal languages, and computability with actual programs which the student can easily modify and play with. Doing is the best way of learning. This book should enable the typical computer science student to acquire a more visceral, and therefore in the long run more useful, understanding of the theory." -Dr. Ching-Tsun Chou, Silicon Architecture Engineer, Intel Corporation "As a long-time researcher in programming languages and high-performance computing, I find the coverage of Automata and Computability in this book illuminating from a foundational perspective as well as timely from a practical perspective. In addition to classical topics such as automata theory and parsing, it allows a student to interactively study via Jupyter notebooks a wide range of topics including grammar disambiguation, Boolean satisfiability, Post Correspondence and Lambda Calculus --- all important topics for students who aspire to become proficient in computer science." -Vivek Sarkar, Professor, School of Computer Science & Stephen Fleming Chair for Telecommunications, College of Computing, Georgia Institute of Technology Table of ContentsI Foundations 1 What Machines Think 2 Defining Languages: Patterns in Sets of Strings 3 Kleene Star: Basic Method of defining Repetitious Patterns II Machines 4 Basics of DFAs 5 Designing DFA 6 Operations on DFA 7 Nondeterministic Finite Automata 8 Regular Expressions and NFA 9 NFA to RE conversion 10 Derivative-based Regular Expression Matching 11 Context-Free Languages and Grammars 12 Pushdown Automata 13 Turing Machines III Concepts 14 Interplay Between Formal Languages 15 Post Correspondence, and Other Undecidability Proofs 16 NP-Completeness 17 Binary Decision Diagrams as Minimal DFA 18 Computability using Lambdas
£78.84
CRC Press Introduction to Number Theory
Book SynopsisIntroduction to Number Theory is a classroom-tested, student-friendly text that covers a diverse array of number theory topics, from the ancient Euclidean algorithm for finding the greatest common divisor of two integers to recent developments such as cryptography, the theory of elliptic curves, and the negative solution of Hilbertâs tenth problem. The authors illustrate the connections between number theory and other areas of mathematics, including algebra, analysis, and combinatorics. They also describe applications of number theory to real-world problems, such as congruences in the ISBN system, modular arithmetic and Eulerâs theorem in RSA encryption, and quadratic residues in the construction of tournaments. Ideal for a one- or two-semester undergraduate-level course, this Second Edition: Features a more flexible structure that offers a greater range of options for course design Adds new sections on the representations of integTrade ReviewPraise for the Previous Edition "The authors succeed in presenting the topics of number theory in a very easy and natural way, and the presence of interesting anecdotes, applications, and recent problems alongside the obvious mathematical rigor makes the book even more appealing. … a valid and flexible textbook for any undergraduate number theory course."—International Association for Cryptologic Research Book Reviews, May 2011 "… a welcome addition to the stable of elementary number theory works for all good undergraduate libraries."—J. McCleary, Vassar College, Poughkeepsie, New York, USA, from CHOICE, Vol. 46, No. 1, August 2009 "… a reader-friendly text. … provides all of the tools to achieve a solid foundation in number theory."—L’Enseignement Mathématique, Vol. 54, No. 2, 2008 The theory of numbers is a core subject of mathematics. The authors have written a solid update to the first edition (CH, Aug'09, 46-6857) of this classic topic. There is no shortage of introductions to number theory, and this book does not offer significantly different information. Nonetheless, the authors manage to give the subject a fresh, new feel. The writing style is simple, clear, and easy to follow for standard readers. The book contains all the essential topics of a first-semester course and enough advanced topics to fill a second. In particular, it includes several modern aspects of number theory, which are often ignored in other texts, such as the use of factoring in computer security, searching for large prime numbers, and connections to other branches of mathematics. Each section contains supplementary homework exercises of various difficulties, a crucial ingredient of any good textbook. Finally, much emphasis is placed on calculating with computers, a staple of modern number theory. Overall, this title should be considered by any student or professor seeking an excellent text on the subject. --A. Misseldine, Southern Utah University, Choice magazine 2016 Praise for the Previous Edition "The authors succeed in presenting the topics of number theory in a very easy and natural way, and the presence of interesting anecdotes, applications, and recent problems alongside the obvious mathematical rigor makes the book even more appealing. … a valid and flexible textbook for any undergraduate number theory course."—International Association for Cryptologic Research Book Reviews, May 2011 "… a welcome addition to the stable of elementary number theory works for all good undergraduate libraries."—J. McCleary, Vassar College, Poughkeepsie, New York, USA, from CHOICE, Vol. 46, No. 1, August 2009 "… a reader-friendly text. … provides all of the tools to achieve a solid foundation in number theory."—L’Enseignement Mathématique, Vol. 54, No. 2, 2008 The theory of numbers is a core subject of mathematics. The authors have written a solid update to the first edition (CH, Aug'09, 46-6857) of this classic topic. There is no shortage of introductions to number theory, and this book does not offer significantly different information. Nonetheless, the authors manage to give the subject a fresh, new feel. The writing style is simple, clear, and easy to follow for standard readers. The book contains all the essential topics of a first-semester course and enough advanced topics to fill a second. In particular, it includes several modern aspects of number theory, which are often ignored in other texts, such as the use of factoring in computer security, searching for large prime numbers, and connections to other branches of mathematics. Each section contains supplementary homework exercises of various difficulties, a crucial ingredient of any good textbook. Finally, much emphasis is placed on calculating with computers, a staple of modern number theory. Overall, this title should be considered by any student or professor seeking an excellent text on the subject. --A. Misseldine, Southern Utah University, Choice magazine 2016 Table of ContentsIntroduction. Divisibility. Greatest Common Divisor. Primes. Congruences. Special Congruences. Primitive Roots. Cryptography. Quadratic Residues. Applications of Quadratic Residues. Sums of Squares. Further Topics in Diophantine Equations. Continued Fractions. Continued Fraction Expansions of Quadratic Irrationals. Arithmetic Functions. Large Primes. Analytic Number Theory. Elliptic Curves.
£96.99
Cambridge University Press Zeta Functions of Graphs A Stroll through the Garden 128 Cambridge Studies in Advanced Mathematics Series Number 128
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.
£59.84
Cambridge University Press Representation Theory of the Symmetric Groups The OkounkovVershik Approach Character Formulas and Partition Algebras 121 Cambridge Studies in Advanced Mathematics Series Number 121
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.
£83.59
Cambridge University Press Association Schemes Designed Experiments Algebra and Combinatorics 84 Cambridge Studies in Advanced Mathematics Series Number 84
a huge range and FREE tracked UK delivery on ALL orders.
£45.59
Cambridge University Press Aspects of Combinatorics A WideRanging Introduction
a huge range and FREE tracked UK delivery on ALL orders.
£47.49
Cambridge University Press Homotopy Theory of Higher Categories From Segal Categories to nCategories and Beyond 19 New Mathematical Monographs Series Number 19
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.
£73.14
Cambridge University Press Random Walk A Modern Introduction 123 Cambridge Studies in Advanced Mathematics Series Number 123
a huge range and FREE tracked UK delivery on ALL orders.
£71.24
Cambridge University Press Graph Structure and Monadic SecondOrder Logic A LanguageTheoretic Approach 138 Encyclopedia of Mathematics and its Applications Series Number 138
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.
£160.55
Cambridge University Press Polytopes and Graphs
a huge range and FREE tracked UK delivery on ALL orders.
£61.74
Cambridge University Press Boolean Networks as Predictive Models of Emergent Biological Behaviors
a huge range and FREE tracked UK delivery on ALL orders.
£17.00
Cambridge University Press Algebraic Combinatorics and the Monster Group
Book SynopsisThis text provides the current state of knowledge on, arguably, one of the most attractive and mysterious mathematical objects: the Monster group. Some 20 experts here share their expertise in this exciting field. Ideal for researchers and graduate students working in Combinatorial Algebra, Group theory and related areas.Trade Review'Describing the Monster group mathematical structures is the culmination of decades of work. Just as the largest Mathieu group framed the 24-dimensional Leech lattice, so also that lattice is the foundation for constructing the Moonshine Module and the Monster algebra, through which the Monster has become central in a theory with deep connections to modern physics. The first part of the book is a collection of five papers on the Monster and other algebraic structures, presented by international leaders in the area providing an outsider with the necessary content and concepts. It presents an account of the current status of the theory and available computational tools for studying the Monster and its algebras. The machinery for developing Majorana theory and axial algebras underpinning the Monster is based on Algebraic Combinatorics, to which the second part of this collection is devoted.' Cheryl Praeger, Emeritus Professor, University of Western Australia''Monstrous Moonshine', an unexpected correspondence involving the largest sporadic simple group, the classical modular function, and conformal field theory, was one of the greatest discoveries of the twentieth century. The modern approach, pioneered by Alexander Ivanov, involves Majorana algebras; the theory is clearly explained here. Among other jewels in the book is a geometric discussion of the Freudenthal - Tits 'magic square', linking the exceptional Lie algebras with the real, complex, quaternion and octonion number fields.' Peter Cameron, University of St AndrewsTable of ContentsPart I. The Monster: 1. Lectures on vertex algebras Atsushi Matsuo; 2. 3-Transposition groups arising in vertex operator algebras Hiroshi Yamauchi; 3. On holomorphic vertex operator algebras of central charge 24 Ching Hung Lam; 4. Maximal 2-local subgroups of the Monster and Baby Monster Ulrich Meierfrankenfeld and Sergey Shpectorov; 5. The future of Majorana theory II Alexander A. Ivanov; Part II. Algebraic Combinatorics: 6. The geometry of Freudenthal-Tits magic square Hendrik Van Maldegham; 7. On generation of polar Grassmanisns Ilaria Cardinali, Lucca Giuzzi and Antonio Pasini; 8. Ovoidal maximal subspaces of polar spaces Antonio Pasini and Hendrik Van Maldegham; 9. On the behaviour of regular unipotent elements from subsystem subgroups of type A_n with special highest weights Tatsiana S. Busel and Irina D. Suprunenko; 10. Some remarks on the parameter c_2 for a distance-regular graph with classical parameters Jack H. Koolen, Jongyook Park and Qianqian Yang; 11. Distance-regular graphs, the subconstituent algebra, and the q-polynomial property Paul Terwilliger; 12. Terwilliger algebras and the Weisfeiler-Leman stabilization Tatsuro Ito; 13. Extended doubling of self-complementary strongly regular graphs and an analogue for digraphs Takuya Ikuta and Akihiro Munemasa; 14. Using GAP package for research in graph theory, design theory and finite geometries Leonard H. Soicher.
£85.50
Cambridge University Press Basic Graph Theory
a huge range and FREE tracked UK delivery on ALL orders.
£57.00
Cambridge University Press Basic Graph Theory
a huge range and FREE tracked UK delivery on ALL orders.
£28.50
Cambridge University Press Equivariant Cohomology in Algebraic Geometry
Book Synopsis
£33.24
Cambridge University Press The Art of Working with the Mathieu Group M24
a huge range and FREE tracked UK delivery on ALL orders.
£99.00
Cambridge University Press Approximation Algorithms for Traveling Salesman
Book SynopsisThe Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful. This is the first book on approximation algorithms for the TSP, featuring a comprehensive collection of all major results and an overview of the most intriguing open problems. Many of the presented results have been discovered only recently, and some are published here for the first time, including better approximation algorithms for the asymmetric TSP and its path version. This book constitutes and advances the state of the art and makes it accessible to a wider audience. Featuring detailed proofs, over 170 exercises, and 100 color figures, this book is an excellent resource for teaching, self-study, and further research.
£112.50
