Discrete mathematics Books
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Graph Theory
Book SynopsisThis standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.” Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity.” Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theory.” Bulletin of the Institute of Combinatorics and its Applications “Succeeds dramatically ... a hell of a good book.” MAA Reviews “A highlight of the book is what is by far the best account in print of the Seymour-Robertson theory of graph minors.” Mathematika “ ... like listening to someone explain mathematics.” Bulletin of the AMSTrade Review“RD’s attempt provides readers a very valuable and rich learning experience. I will definitely recommend this book to my students and colleagues for knowledge enrichment and advancement.” (V. Yegnanarayanan, zbMATH 1375.05002, 2018)“Graph theory provides a very comprehensive description of different topics in graph theory. This book can definitely be counted as one of the classics in this subject. The highlight is its wide coverage of topics in graph theory, ranging from the fundamentals to very advanced topics. … The book ranks highly in terms of standards, originality, and class. … I have no doubt that this book will be a real asset for all graph theorists and those studying graph theory at all levels.” (Sudev Naduvath, Computing Reviews, March, 2018)Table of ContentsThe Basics.- Matching Covering and Packing.- Connectivity.- Planar Graphs.- Colouring.- Flows.- Extremal Graph Theory.- Infinite Graphs.- Ramsey Theory for Graphs.- Hamilton Cycles.- Random Graphs.- Graph Minors.
£61.74
Springer Spektrum Diskrete Mathematik
Book Synopsis1 Grundlagen der Kombinatorik.- 2 Existenzaussagen.- 3 Erzeugende Funktionen.- 4 Die Inzidenzalgebra.- 5 Abzählen von Isomorphieklassen.- 6 Hypergraphen.- 7 Die Probabilistische Methode.- 8 Codes.- 9 Blockpläne.
£24.99
Birkhauser Verlag AG Polynomial Identity Rings
Book SynopsisThese lecture notes treat polynomial identity rings from both the combinatorial and structural points of view. The greater part of recent research in polynomial identity rings is about combinatorial questions, and the combinatorial part of the lecture notes gives an up-to-date account of recent research. On the other hand, the main structural results have been known for some time, and the emphasis there is on a presentation accessible to newcomers to the subject.Trade ReviewFrom the reviews: “The book under review consists of two excellent monographs on the PI-theory by two leading researchers, V. Drensky and E. Formanek … In summary, both expositions are very well written, and the book is recommended both for graduate students and researchers.” (MATHEMATICAL REVIEWS)Table of ContentsA Combinatorial Aspects in PI-Rings.- Vesselin Drensky.- 1 Basic Properties of PI-algebras.- 2 Quantitative Approach to PI-algebras.- 3 The Amitsur-Levitzki Theorem.- 4 Central Polynomials for Matrices.- 5 Invariant Theory of Matrices.- 6 The Nagata-Higman Theorem.- 7 The Shirshov Theorem for Finitely Generated PI-algebras.- 8 Growth of Codimensions of PI-algebras.- B Polynomial Identity Rings.- Edward Formanek.- 1 Polynomial Identities.- 2 The Amitsur-Levitzki Theorem.- 3 Central Polynomials.- 4 Kaplansky’s Theorem.- 5 Theorems of Amitsur and Levitzki on Radicals.- 6 Posner’s Theorem.- 7 Every PI-ring Satisfies a Power of the Standard Identity.- 8 Azumaya Algebras.- 9 Artin’s Theorem.- 10 Chain Conditions.- 11 Hilbert and Jacobson PI-Rings.- 12 The Ring of Generic Matrices.- 13 The Generic Division Ring of Two 2 x 2 Generic Matrices.- 14 The Center of the Generic Division Ring.- 15 Is the Center of the Generic Division Ring a Rational Function Field?.
£31.99
Birkhauser Verlag AG Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge
Book SynopsisIn July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact. This volume includes contributions to these and other topics from many of the participants.Table of ContentsClaude Berge — Sculptor of Graph Theory.- ?-path-connectivity and mk-generation: an Upper Bound on m.- Automated Results and Conjectures on Average Distance in Graphs.- Brambles, Prisms and Grids.- Dead Cell Analysis in Hex and the Shannon Game.- Ratios of Some Domination Parameters in Graphs and Claw-free Graphs.- Excessive Factorizations of Regular Graphs.- Odd Pairs of Cliques.- Recognition of Perfect Circular-arc Graphs.- On Edge-maps whose Inverse Preserves Flows or Tensions.- On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs.- Generalized Colourings (Matrix Partitions) of Cographs.- A Note on [k, l]-sparse Graphs.- Even Pairs in Bull-reducible Graphs.- Kernels in Orientations of Pretransitive Orientable Graphs.- Nonrepetitive Graph Coloring.- A Characterization of the 1-well-covered Graphs with no 4-cycles.- A Graph-theoretical Generalization of Berge’s Analogue of the Erd?s-Ko-Rado Theorem.- Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs.- Precoloring Extension on Chordal Graphs.- On the Enumeration of Bipartite Minimum Edge Colorings.- Kempe Equivalence of Colorings.- Acyclic 4-choosability of Planar Graphs with Girth at Least 5.- Automorphism Groups of Circulant Graphs — a Survey.- Hypo-matchings in Directed Graphs.- On Reed’s Conjecture about ?,? and ?.- On the Generalization of the Matroid Parity Problem.- Reconstruction of a Rank 3 Oriented Matroids from its Rank 2 Signed Circuits.- The Normal Graph Conjecture is True for Circulants.- Two-arc Transitive Near-polygonal Graphs.- Open Problems.
£85.49
Birkhauser Verlag AG The Geometry of the Word Problem for Finitely
Book SynopsisThe origins of the word problem are in group theory, decidability and complexity. But through the vision of M. Gromov and the language of filling functions, the topic now impacts the world of large-scale geometry. This book contains accounts of many recent developments in Geometric Group Theory and shows the interaction between the word problem and geometry continues to be a central theme. It contains many figures, numerous exercises and open questions.Table of ContentsDehn Functions and Non-Positive Curvature.- The Isoperimetric Spectrum.- Dehn Functions of Subgroups of CAT(0) Groups.- Filling Functions.- Filling Functions.- Relationships Between Filling Functions.- Example: Nilpotent Groups.- Asymptotic Cones.- Diagrams and Groups.- Dehn’s Problems and Cayley Graphs.- Van Kampen Diagrams and Pictures.- Small Cancellation Conditions.- Isoperimetric Inequalities and Quasi-Isometries.- Free Nilpotent Groups.- Hyperbolic-by-free groups.
£21.59
Birkhauser Verlag AG Counting Surfaces: CRM Aisenstadt Chair lectures
Book SynopsisThe problem of enumerating maps (a map is a set of polygonal "countries" on a world of a certain topology, not necessarily the plane or the sphere) is an important problem in mathematics and physics, and it has many applications ranging from statistical physics, geometry, particle physics, telecommunications, biology, ... etc. This problem has been studied by many communities of researchers, mostly combinatorists, probabilists, and physicists. Since 1978, physicists have invented a method called "matrix models" to address that problem, and many results have been obtained.Besides, another important problem in mathematics and physics (in particular string theory), is to count Riemann surfaces. Riemann surfaces of a given topology are parametrized by a finite number of real parameters (called moduli), and the moduli space is a finite dimensional compact manifold or orbifold of complicated topology. The number of Riemann surfaces is the volume of that moduli space. More generally, an important problem in algebraic geometry is to characterize the moduli spaces, by computing not only their volumes, but also other characteristic numbers called intersection numbers.Witten's conjecture (which was first proved by Kontsevich), was the assertion that Riemann surfaces can be obtained as limits of polygonal surfaces (maps), made of a very large number of very small polygons. In other words, the number of maps in a certain limit, should give the intersection numbers of moduli spaces.In this book, we show how that limit takes place. The goal of this book is to explain the "matrix model" method, to show the main results obtained with it, and to compare it with methods used in combinatorics (bijective proofs, Tutte's equations), or algebraic geometry (Mirzakhani's recursions).The book intends to be self-contained and accessible to graduate students, and provides comprehensive proofs, several examples, and gives the general formula for the enumeration of maps on surfaces of any topology. In the end, the link with more general topics such as algebraic geometry, string theory, is discussed, and in particular a proof of the Witten-Kontsevich conjecture is provided.Trade Review“This book brings together details of topological recursion from many different papers and organizes them in an accessible way. … this book will be an invaluable resource for mathematicians learning about topological recursion.” (Daniel D. Moskovich, Mathematical Reviews, February, 2017) “The author explains how matrix models and counting surfaces are related and aims at presenting to mathematicians and physicists the random matrix approach to quantum gravity. … The book is an outstanding monograph of a recent research trend in surface theory.” (Gert Roepstorff, zbMATH 1338.81005, 2016)Table of ContentsI Maps and discrete surfaces.- II Formal matrix integrals.- III Solution of Tutte-loop equations.- IV Multicut case.- V Counting large maps.- VI Counting Riemann surfaces.- VII Topological recursion and symplectic invariants.- VIII Ising model.- Index.- Bibliography.
£82.49
Logos Verlag Berlin GmbH Stirling Polynomials in Several Indeterminates
Book Synopsis
£42.87
Springer Verlag, Japan Geometric Aspects of General Topology
Book SynopsisThis book is designed for graduate students to acquire knowledge of dimension theory, ANR theory (theory of retracts), and related topics. These two theories are connected with various fields in geometric topology and in general topology as well. Hence, for students who wish to research subjects in general and geometric topology, understanding these theories will be valuable. Many proofs are illustrated by figures or diagrams, making it easier to understand the ideas of those proofs. Although exercises as such are not included, some results are given with only a sketch of their proofs. Completing the proofs in detail provides good exercise and training for graduate students and will be useful in graduate classes or seminars.Researchers should also find this book very helpful, because it contains many subjects that are not presented in usual textbooks, e.g., dim X × I = dim X + 1 for a metrizable space X; the difference between the small and large inductive dimensions; a hereditarily infinite-dimensional space; the ANR-ness of locally contractible countable-dimensional metrizable spaces; an infinite-dimensional space with finite cohomological dimension; a dimension raising cell-like map; and a non-AR metric linear space. The final chapter enables students to understand how deeply related the two theories are.Simplicial complexes are very useful in topology and are indispensable for studying the theories of both dimension and ANRs. There are many textbooks from which some knowledge of these subjects can be obtained, but no textbook discusses non-locally finite simplicial complexes in detail. So, when we encounter them, we have to refer to the original papers. For instance, J.H.C. Whitehead's theorem on small subdivisions is very important, but its proof cannot be found in any textbook. The homotopy type of simplicial complexes is discussed in textbooks on algebraic topology using CW complexes, but geometrical arguments using simplicial complexes are rather easy.Trade ReviewFrom the book reviews:“This excellent book is designed for different graduate courses in geometric topology, as well as in general topology. At the same time it contains complete proofs of results interesting also for the specialist in geometric topology … .” (Vesko Valov, Mathematical Reviews, September, 2014)
£98.99
Mathematical Society of Japan Schubert Calculus - Osaka 2012
Book SynopsisThis volume is the proceedings of the 5th MSJ Seasonal Institute 'Schubert Calculus' held at Osaka City University, September 17th-27th, 2012. It is recommended for all researchers and graduate students who are interested in Schubert calculus and its many connections and applications to related areas of mathematics, such as geometric representation theory, combinatorial aspects of algebraic varieties arising in Lie theory, and equivariant topology. Alain Lascoux, who is one of the pioneers of modern Schubert calculus, and a contributor of this volume, passed away during the time of editing process of the proceedings. The volume is dedicated to him.Published by Mathematical Society of Japan and distributed by World Scientific Publishing Co. for all markets except North America
£122.40
Mathematical Society of Japan 50th Anniversary Of Grobner Bases, The -
Book SynopsisThe discovery of the algorithm by Bruno Buchberger on July 1965, so-called the Buchberger algorithm, to compute Gröbner bases of ideals of the polynomial ring had led the birth of the exciting research area called 'Computer Algebra' in the modern mathematics. The 8th Mathematical Society of Japan Seasonal Institute (MSJ SI 2015) entitled 'The 50th Anniversary of Gröbner Bases' was held on July 2015, which is the 50th year following the discovery of the Buchberger algorithm. This volume is the proceedings of MSJ SI 2015 and consists of 14 papers related with computer algebra, algebraic statistics, D-modules, convex polytopes and toric ideals. These papers enable the reader to look over the current trends on Gröbner bases. Especially, young researchers can reach a treasury of fascinating research problems which are pending. Foreword was contributed by Bruno Buchberger, where a secret story on the discovery of the Buchberger algorithm is stated.Published by Mathematical Society of Japan and distributed by World Scientific Publishing Co. for all markets except North America
£57.00
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.
£23.39
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?
£23.39
BPB Publications Theory of Computation Simplified: Simulate
Book Synopsis
£31.34
I K International Publishing House Pvt. Ltd A Textbook on Discrete Mathematics
Book SynopsisThis book attempts to put together all the essential topics of discrete mathematical structures for easy reference. The undergraduate students of computer science and engineering, postgraduate students of computer applications and computer science and engineering will find this book very useful. It contains several multiple-choice questions under each chapter which will be useful for those who aspire to write the GATE examination. This book could be a good textbook for undergraduate students of Computer Science, Computer Science and Engineering and postgraduate students of Computer Applications.
£28.45
World Scientific Publishing Co Pte Ltd Perfect Codes And Related Structures
Book SynopsisIn this monograph, we develop the theory of one of the most fascinating topics in coding theory, namely, perfect codes and related structures. Perfect codes are considered to be the most beautiful structure in coding theory, at least from the mathematical side. These codes are the largest ones with their given parameters. The book develops the theory of these codes in various metrics — Hamming, Johnson, Lee, Grassmann, as well as in other spaces and metrics. It also covers other related structures such as diameter perfect codes, quasi-perfect codes, mixed codes, tilings, combinatorial designs, and more. The goal is to give the aspects of all these codes, to derive bounds on their sizes, and present various constructions for these codes.The intention is to offer a different perspective for the area of perfect codes. For example, in many chapters there is a section devoted to diameter perfect codes. In these codes, anticodes are used instead of balls and these anticodes are related to intersecting families, an area that is part of extremal combinatorics. This is one example that shows how we direct our exposition in this book to both researchers in coding theory and mathematicians interested in combinatorics and extremal combinatorics. New perspectives for MDS codes, different from the classic ones, which lead to new directions of research on these codes are another example of how this book may appeal to both researchers in coding theory and mathematicians.The book can also be used as a textbook, either on basic course in combinatorial coding theory, or as an advance course in combinatorial coding theory.
£128.25
World Scientific Publishing Co Pte Ltd Computability Theory And Foundations Of
Book SynopsisThis volume features the latest scientific developments in the fields of computability theory and logical foundations of mathematics as well as applications. The scope involves the topics of Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory.
£85.50
World Scientific Publishing Co Pte Ltd Introduction To Data Science
Book SynopsisThe book systematically introduces the basic contents of data science, including data preprocessing and basic methods of data analysis, handling special problems (e.g. text analysis), deep learning, and distributed systems.In addition to systematically introducing the basic content of data science from a theoretical point of view, the book also provides a large number of data analysis practice cases.
£121.50
World Scientific Publishing Co Pte Ltd Linear Algebra For Data Science
Book SynopsisThis book serves as an introduction to linear algebra for undergraduate students in data science, statistics, computer science, economics, and engineering. The book presents all the essentials in rigorous (proof-based) manner, describes the intuition behind the results, while discussing some applications to data science along the way.The book comes with two parts, one on vectors, the other on matrices. The former consists of four chapters: vector algebra, linear independence and linear subspaces, orthonormal bases and the Gram-Schmidt process, linear functions. The latter comes with eight chapters: matrices and matrix operations, invertible matrices and matrix inversion, projections and regression, determinants, eigensystems and diagonalizability, symmetric matrices, singular value decomposition, and stochastic matrices. The book ends with the solution of exercises which appear throughout its twelve chapters.
£66.50
World Scientific Publishing Co Pte Ltd Starting Category Theory
Book SynopsisOne of the central highlights of this work is the exploration of the Yoneda lemma and its profound implications, during which intuitive explanations are provided, as well as detailed proofs, and specific examples. This book covers aspects of category theory often considered advanced in a clear and intuitive way, with rigorous mathematical proofs. It investigates universal properties, coherence, the relationship between categories and graphs, and treats monads and comonads on an equal footing, providing theorems, interpretations and concrete examples. Finally, this text contains an introduction to monoidal categories and to strong and commutative monads, which are essential tools in current research but seldom found in other textbooks.Starting Category Theory serves as an accessible and comprehensive introduction to the fundamental concepts of category theory. Originally crafted as lecture notes for an undergraduate course, it has been developed to be equally well-suited for individuals pursuing self-study. Most crucially, it deliberately caters to those who are new to category theory, not requiring readers to have a background in pure mathematics, but only a basic understanding of linear algebra.
£121.50
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
£98.99
World Scientific Publishing Co Pte Ltd Discrete Approximation Theory
Book SynopsisIn this monograph, we present the authors' recent work of the last seven years in Approximation Theory. Chapters are self-contained and can be read independently and advanced courses can be taught out of this book. Here our generalized discrete singular operators are of the following types: Picard, Gauss-Weierstrass and Poisson-Cauchy operators. We treat both the unitary and non-unitary, univariate and multivariate cases of these operators, which are not necessarily positive operators. The book's results are expected to find applications in many areas of pure and applied mathematics, and statistics. As such, it is suitable for researchers, graduate students, and seminars of related subjects, and serves well as an invaluable resource for all science libraries.
£110.70
World Scientific Publishing Co Pte Ltd Basic Discrete Mathematics: Logic, Set Theory,
Book SynopsisThis lively introductory text exposes the student in the humanities to the world of discrete mathematics. A problem-solving based approach grounded in the ideas of George Pólya are at the heart of this book. Students learn to handle and solve new problems on their own. A straightforward, clear writing style and well-crafted examples with diagrams invite the students to develop into precise and critical thinkers. Particular attention has been given to the material that some students find challenging, such as proofs. This book illustrates how to spot invalid arguments, to enumerate possibilities, and to construct probabilities. It also presents case studies to students about the possible detrimental effects of ignoring these basic principles. The book is invaluable for a discrete and finite mathematics course at the freshman undergraduate level or for self-study since there are full solutions to the exercises in an appendix.'Written with clarity, humor and relevant real-world examples, Basic Discrete Mathematics is a wonderful introduction to discrete mathematical reasoning.'- Arthur Benjamin, Professor of Mathematics at Harvey Mudd College, and author of The Magic of Math
£61.75
World Scientific Publishing Co Pte Ltd Truly Nonlinear Oscillations: Harmonic Balance,
Book SynopsisThis unique book provides a concise presentation of many of the fundamental strategies for calculating approximations to the oscillatory solutions of “truly nonlinear” (TNL) oscillator equations. The volume gives a general overview of the author's work on harmonic balance, iteration and combined linearization-averaging methods. However, full discussions are also presented on parameter expansion procedures and a first-order averaging technique for TNL oscillators. The calculational basis of each method is clarified by applying them to a set of standard TNL oscillator equations. This allows a direct comparison to be made among the various methods.The book is self-contained and therefore suitable for both classroom use and self-study by students and professionals who desire to learn, understand, and apply these technique to the field of nonlinear oscillations.Table of ContentsBackground and General Comments; Establishing Periodicity; Harmonic Balance; Parameter Expansions; Iteration Methods; Averaging Methods; Comparative Analysis.
£85.50
World Scientific Publishing Co Pte Ltd Advances In Interdisciplinary Applied Discrete
Book SynopsisIn the past 50 years, discrete mathematics has developed as a far-reaching and popular language for modeling fundamental problems in computer science, biology, sociology, operations research, economics, engineering, etc. The same model may appear in different guises, or a variety of models may have enough similarities such that same ideas and techniques can be applied in diverse applications.This book focuses on fields such as consensus and voting theory, clustering, location theory, mathematical biology, and optimization that have seen an upsurge of new and exciting works over the past two decades using discrete models in modern applications. Featuring survey articles written by experts in these fields, the articles emphasize the interconnectedness of the mathematical models and techniques used in various areas, and elucidate the possibilities for future interdisciplinary research. Additionally, this book discusses recent advances in the fields, highlighting the approach of cross-fertilization of ideas across disciplines.Table of ContentsConsensus & Voting; Clustering; Location Theory; Computational Biology; Optimization.
£82.65
World Scientific Publishing Co Pte Ltd Lectures On Discrete Mathematics For Computer
Book SynopsisThis textbook presents fundamental topics in discrete mathematics introduced from the perspectives of a pure mathematician and an applied computer scientist. The synergy between the two complementary perspectives is seen throughout the book; key concepts are motivated and explained through real-world examples, and yet are still formalized with mathematical rigor. The book is an excellent introduction to discrete mathematics for computer science, software engineering, and mathematics students.The first author is a leading mathematician in the area of logic, computability, and theoretical computer science, with more than 25 years of teaching and research experience. The second author is a computer science PhD student at the University of Washington specializing in database systems. The father-and-daughter team merges two different views to create a unified book for students interested in learning discrete mathematics, the connections between discrete mathematics and computer science, and the mathematical foundations of computer science.Readers will learn how to formally define abstract concepts, reason about objects (such as programs, graphs and numbers), investigate properties of algorithms, and prove their correctness. The textbook studies several well-known algorithmic problems including the path problem for graphs and finding the greatest common divisor, inductive definitions, proofs of correctness of algorithms via loop invariants and induction, the basics of formal methods such as propositional logic, finite state machines, counting, probability, as well as the foundations of databases such as relational calculus.Table of ContentsDefinitions, Theorems, and Proofs; Arithmetic; Graphs; Circuits; Trees; Basics of Sets; Relations and Databases; Induction; Reachability Games on Graphs; Functions and Transitions; Propositional Logic; Finite Automata; Regular Expressions; Counting; Probability.
£54.15
World Scientific Publishing Co Pte Ltd Morse Theory: Smooth And Discrete
Book SynopsisMorse Theory: Smooth and Discrete serves as an introduction to classical smooth Morse theory and to Forman's discrete Morse theory, highlighting the parallels between the two subjects. This is the first time both smooth and discrete Morse theory have been treated in a single volume. This makes the book a valuable resource for students and professionals working in topology and discrete mathematics. With a strong focus on examples, the text is suitable for advanced undergraduates or beginning graduate students.Table of ContentsSmooth Morse Theory: First Steps (Surfaces, Critical Points); Fundamental Results (Morse Lemma, Existence, Gradient-Like Vector Fields); Topological Consequences (Homotopy Type, Morse Inequalities); Discrete Morse Theory: First Steps (Definitions and Examples); Fundamental Results (Existence, Gradients); Topological Consequences (Homotopy Type, Collapses); Algorithms (Constructing Discrete Morse Functions); Appendices: Smooth Manifolds; Simplicial Complexes;
£51.30
World Scientific Publishing Co Pte Ltd Building Proofs: A Practical Guide
Book SynopsisThis book introduces students to the art and craft of writing proofs, beginning with the basics of writing proofs and logic, and continuing on with more in-depth issues and examples of creating proofs in different parts of mathematics, as well as introducing proofs-of-correctness for algorithms. The creation of proofs is covered for theorems in both discrete and continuous mathematics, and in difficulty ranging from elementary to beginning graduate level.Just beyond the standard introductory courses on calculus, theorems and proofs become central to mathematics. Students often find this emphasis difficult and new. This book is a guide to understanding and creating proofs. It explains the standard “moves” in mathematical proofs: direct computation, expanding definitions, proof by contradiction, proof by induction, as well as choosing notation and strategies.
£45.60
World Scientific Publishing Co Pte Ltd Building Proofs: A Practical Guide
Book SynopsisThis book introduces students to the art and craft of writing proofs, beginning with the basics of writing proofs and logic, and continuing on with more in-depth issues and examples of creating proofs in different parts of mathematics, as well as introducing proofs-of-correctness for algorithms. The creation of proofs is covered for theorems in both discrete and continuous mathematics, and in difficulty ranging from elementary to beginning graduate level.Just beyond the standard introductory courses on calculus, theorems and proofs become central to mathematics. Students often find this emphasis difficult and new. This book is a guide to understanding and creating proofs. It explains the standard “moves” in mathematical proofs: direct computation, expanding definitions, proof by contradiction, proof by induction, as well as choosing notation and strategies.
£19.00
World Scientific Publishing Co Pte Ltd Basic Discrete Mathematics: Logic, Set Theory,
Book SynopsisThis lively introductory text exposes the student in the humanities to the world of discrete mathematics. A problem-solving based approach grounded in the ideas of George Pólya are at the heart of this book. Students learn to handle and solve new problems on their own. A straightforward, clear writing style and well-crafted examples with diagrams invite the students to develop into precise and critical thinkers. Particular attention has been given to the material that some students find challenging, such as proofs. This book illustrates how to spot invalid arguments, to enumerate possibilities, and to construct probabilities. It also presents case studies to students about the possible detrimental effects of ignoring these basic principles. The book is invaluable for a discrete and finite mathematics course at the freshman undergraduate level or for self-study since there are full solutions to the exercises in an appendix.'Written with clarity, humor and relevant real-world examples, Basic Discrete Mathematics is a wonderful introduction to discrete mathematical reasoning.'- Arthur Benjamin, Professor of Mathematics at Harvey Mudd College, and author of The Magic of Math
£110.70
World Scientific Publishing Co Pte Ltd Generalizations Of Finite Metrics And Cuts
Book SynopsisThis book introduces oriented version of metrics and cuts and their multidimensional analogues, as well as partial metrics and weighted metrics. It is a follow-up of Geometry of Cuts and Metrics by Deza and Laurent which presents rich theory of classical binary and symmetric objects — metrics and cuts.Many research publications on this subject are devoted to different special aspects of the theory of generalized metrics. However, they are disconnected one from other, often written in different mathematical language, consider the same objects from different points of view without analysis of possible connections, etc. In this book we will construct full theory of main classes of finite generalized metrics and their polyhedral aspects.
£95.40
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.
£53.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
