Discrete mathematics Books
Cambridge University Press An Invitation to Combinatorics
Book SynopsisActive student engagement is key to this classroom-tested combinatorics text, boasting 1200+ carefully designed problems, ten mini-projects, section warm-up problems, and chapter opening problems. The author an award-winning teacher writes in a conversational style, keeping the reader in mind on every page. Students will stay motivated through glimpses into current research trends and open problems as well as the history and global origins of the subject. All essential topics are covered, including Ramsey theory, enumerative combinatorics including Stirling numbers, partitions of integers, the inclusion-exclusion principle, generating functions, introductory graph theory, and partially ordered sets. Some significant results are presented as sets of guided problems, leading readers to discover them on their own. More than 140 problems have complete solutions and over 250 have hints in the back, making this book ideal for self-study. Ideal for a one semester upper undergraduate course, prerequisites include the calculus sequence and familiarity with proofs.Trade Review'I would certainly accept this 'invitation.' The text covers essentially all of the basic combinatorial subjects in a both gentle and intense way. The extensive problems, examples, and 'projects,' especially the collaborative projects, exemplify current pedagogical research on effective teaching methods. I would expect it to remain as a reference on many shelves.' Bruce Rothschild, University of California, Los Angeles'Shahriari's voice as an experienced classroom teacher shines through in this brilliantly crafted student-friendly text. Each mini-project provides a guided exploration of an interesting topic in combinatorics. These, together with the plethora of interesting exercises, help the student to build problem-solving muscle and to experience the joy of mathematical discovery.' Jamie Pommersheim, Reed College'From well-chosen motivating problems in the introduction to deeper material near the book's conclusion, Shahriari invites students encountering combinatorics systematically for the first time to think, to build, and to play. His warm writing style and cross-cultural approach to core topics of the field are sure to engage readers from many backgrounds and levels of preparation.' Joshua Cooper, University of South Carolina'This book is a mathematically rigorous introductory textbook on combinatorics. It contains an excellent range of problems and exercises that will help students practice and learn the material. It also lists open questions in combinatorics so students can see that the field continues to develop. The really special feature of this book is a lovely collection of mini-projects that let students explore a variety of topics and deepen their understanding.' David Auckly, Kansas State University'I highly recommend this text. Among its most interesting, unusual, and valuable features, one finds a long list of collaborative mini-projects for students to work on in groups, together with other problems to work on individually; nice historical asides, including references to the work of non-Western mathematicians; and a very accessible conversational style. It fits well with discovery-style or problem-oriented courses on the subject.' William Monty McGovern, University of Washington'One of the major attractions of this textbook is the writing style - it is designed to be very readable, as though the author were having a conversation with the reader. The result is a text which feels engaging - a quality which is sure to be of great benefit to undergraduate students.' Audie Warren, zbMATHTable of ContentsPreface; Introduction; 1. Induction and Recurrence Relations; 2. The Pigeonhole Principle and Ramsey Theory; 3. Counting, Probability, Balls and Boxes; 4. Permutations and Combinations; 5. Binomial and Multinomial Coefficients; 6. Stirling Numbers; 7. Integer Partitions; 8. The Inclusion-Exclusion Principle; 9. Generating Functions; 10. Graph Theory; 11. Posets, Matchings, and Boolean Lattices; Appendices; Bibliography; Index.
£54.13
Cambridge University Press Frameworks Tensegrities and Symmetry
Book SynopsisThis introduction to the theory of rigid structures explains how to analyze the performance of built and natural structures under loads, paying special attention to the simplifying role of symmetry. Written for researchers and graduate students in structural engineering and mathematics, and of interest to computer scientists and physicists.Trade Review'Rigidity theory mathematicians and structural engineers are like two branches of a tribe that separated long ago. In the intervening time, the language and knowledge of each group has evolved to where concepts no longer align and common terms no longer have common meanings. As a result, when they interact today, confusion reigns. Frameworks, Tensegrities and Symmetry is a guide that both groups can use to understand the other.' William F. Baker, Skidmore, Owings & Merrill'The authors promise 'an attempt to build a bridge between two cultures' and they have done a remarkable job of this unenviable task. Requiring only a minimum of mathematical and engineering prerequisites the book develops intuitively, and rigorously, the rigidity theory of both bar frameworks and tensegrity frameworks and applies this theory to analyse built structures. Two masters of the field have carefully designed the book to move seamlessly between the analysis and synthesis of specific structures and providing the general, generic and symmetric theories.' Anthony Nixon, Lancaster UniversityTable of Contents1. Introduction; Part I. The General Case: 2. Frameworks and Rigidity; 3. First-Order Analysis of Frameworks; 4. Tensegrities; 5. Energy Functions and the Stress Matrix; 6. Prestress Stability; 7. Generic Frameworks; 8. Finite Mechanisms; Part II. Symmetric Structures: 9. Groups and Representation Theory; 10. First-Order Symmetry Analysis; 11. Generating Stable Symmetric Tensegrities; A. Useful Theorems and Proofs.
£55.09
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.
£42.46
American Mathematical Society Automated Theorem Proving After 25 Years
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.
£89.25
Cambridge University Press Surveys in Combinatorics 2022
a huge range and FREE tracked UK delivery on ALL orders.
£52.25
Cambridge University Press Notes on Counting An Introduction to Enumerative Combinatorics
Book SynopsisEnumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, which stems from many years'' experience of teaching, invites students into the subject and prepares them for more advanced texts. It is suitable as a class text or for individual study. The author provides proofs for many of the theorems to show the range of techniques available, and uses examples to link enumerative combinatorics to other areas of study. The main section of the book introduces the key tools of the subject (generating functions and recurrence relations), which are then used to study the most important combinatorial objects, namely subsets, partitions, and permutations of a set. Later chapters deal with more specialised topics, including permanents, SDRs, group actions and the RedfieldPólya theory of cycle indices, Möbius inversion, the Tutte polynomial, and species.Trade Review'It's indeed a very good introduction to enumerative combinatorics and has all the trappings of a pedagogically sound enterprise, in the old-fashioned sense: exercises, good explanations (not too terse, but certainly not too wordy), and mathematically serious (nothing namby-pamby here). It's an excellent book.' Michael Berg, MAA Reviews'Cameron's Notes on Counting is a clever introductory book on enumerative combinatorics … Overall, the text is well-written with a friendly tone and an aesthetic organization, and each chapter contains an ample number of quality exercises. Summing Up: Recommended.' A. Misseldine, CHOICETable of Contents1. Introduction; 2. Formal power series; 3. Subsets, partitions and permutations; 4. Recurrence relations; 5. The permanent; 6. q-analogues; 7. Group actions and cycle index; 8. Mobius inversion; 9. The Tutte polynomial; 10. Species; 11. Analytic methods: a first look; 12. Further topics; 13. Bibliography and further directions; Index.
£33.24
Cambridge University Press Forbidden Configurations in Discrete Geometry
Book SynopsisThis book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry, and listing many open problems. It unifies these mathematical and computational views using forbidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view. Written with minimal prerequisites and featuring plenty of figures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brain-teaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathematics including number theory, graph theory, and the theory of permutation patterns. Pseudocode is included for mTrade Review'David Eppstein has managed to unify a huge swath of research on planar point sets through monotone properties and forbidden configurations. For example, finding grid points that avoid the obstacle of a 3-point line is a century-old problem still not entirely resolved. The author's unification naturally uncovers research lacuna, several of which he fills, while others are formulated as sharp new open problems. This rare synthesis of previous work will reinvigorate and redirect the field.' Joseph O'Rourke, Smith College, Massachusetts'David Eppstein takes us on an adventure tour to the study of point configurations in Discrete Geometry. It visits many different topics, connected by the original viewpoint of 'forbidden configurations'. This is interesting, instructive - and fun!' Günter M. Ziegler, Freie Universität Berlin'This unique volume collects and unifies almost a century of work on point configurations on the plane, and their properties that depend on whether each subset of three points is oriented clockwise, oriented counterclockwise, or collinear. Beginning with the Happy Ending Theorem, the author takes us through entertaining problems and into computational geometry. A delight to read as well as a persuasive case for the method of forbidden configurations, the book will be a valuable addition to the library of any discrete or computational geometer.' Peter Winkler, Dartmouth College, New Hampshire'This is a fun read on certain topics in discrete and computational geometry. It begins with 'A Happy Ending' and ends with 'Only the Beginning'. Eppstein's journey through various problems of pointset configurations offers a new view of the subject even to experts of the field. Recommended to everyone who likes geometry and computer science.' Jozsef Solymosi, University of British Columbia'David Eppstein has brought the weight of his formidable expertise and expositional talents on the simplest of shapes: points and lines. He gently guides the reader through a vast array of fascinating topics, their greatest hits to the state-of-the-art. This lovely book will be found on the shelves of mathematicians and computer scientists for many years to come.' Satyan Devadoss, University of San Diego'Erdős's many beautiful, notoriously difficult geometric problems on finite point configurations led to the birth of a new discipline: combinatorial geometry. The field gained additional significance in the 1980s, when it was discovered to be relevant to basic questions in computational geometry. Eppstein's elegantly written and illustrated book takes a fresh algorithmic look at the theory of forbidden geometric patterns. It can be read by specialists as a survey, but it can also serve as an excellent textbook for an introductory course on point configurations.' János Pach, École Polytechnique Fédérale de Lausanne and Rényi Institute, Budapest'There is a lot to like about this book, as Eppstein does a good job of introducing the material to his readers … A reader who sticks with Eppstein will learn a lot about this exciting area that lies on the border of mathematics and computer science.' Darren Glass, MAA Reviews'The result is a first-class treatment: Eppstein deftly sells the subject to the uninitiated, yet carries it to depths experts will appreciate. A generous supply of diagrams gracefully projects many ideas, and the professional-quality design makes the reading experience a pleasure. Summing Up: Highly recommended.' D. V. Feldman, Choice'The book is a great read. It is a valuable addition to the library of any discrete or computational geometer. Moreover, it can also serve as an excellent textbook for an introductory course on point configurations.' László Szabó, MathSciNet'This book is distinguished by a number of attractive features. Perhaps most prominent is its strong unity of approach. The first 7 chapters establish a coherent foundation and language for expressing and investigating the subjects studied in the remaining 10 … Another is its clarity of presentation and reader-friendliness. In most chapters the author adopts the strategy of introducing the topic in terms of an easily-understood problem that is accessible to virtually any reader … If you have any interest in learning about this field, I highly recommend this book.' Frederic Green, SIGACT NewsTable of Contents1. A happy ending; 2. Overview; 3. Configurations; 4. Subconfigurations; 5. Properties, parameters, and obstacles; 6. Computing with configurations; 7. Complexity theory; 8. Collinearity; 9. General position; 10. General-position partitions; 11. Convexity; 12. More on convexity; 13. Integer realizations; 14. Stretched permutations; 15. Configurations from graphs; 16. Universality; 17. Stabbing; 18. The big picture.
£999.99
Cambridge University Press Introduction to Approximate Groups
Book SynopsisApproximate groups have shot to prominence in recent years, driven both by rapid progress in the field itself and by a varied and expanding range of applications. This text collects, for the first time in book form, the main concepts and techniques into a single, self-contained introduction. The author presents a number of recent developments in the field, including an exposition of his recent result classifying nilpotent approximate groups. The book also features a considerable amount of previously unpublished material, as well as numerous exercises and motivating examples. It closes with a substantial chapter on applications, including an exposition of Breuillard, Green and Tao''s celebrated approximate-group proof of Gromov''s theorem on groups of polynomial growth. Written by an author who is at the forefront of both researching and teaching this topic, this text will be useful to advanced students and to researchers working in approximate groups and related areas.Trade Review'The book now under reviews offers an excellent introduction … the book is very nicely written, Researchers and fledgling researchers in this area will want to own this book.' Mark Hunacek, The Mathematical GazetteTable of Contents1. Introduction; 2. Basic concepts; 3. Coset progressions and Bohr sets; 4. Small doubling in abelian groups; 5. Nilpotent groups, commutators and nilprogressions; 6. Nilpotent approximate groups; 7. Arbitrary approximate groups; 8. Residually nilpotent approximate groups; 9. Soluble approximate subgroups GLn(C); 10. Arbitrary approximate subgroups of GLn(C); 11. Applications to growth in groups; References; Index.
£999.99
Nova Science Publishers Inc Graph Theory: New Research
Book Synopsis
£146.24
BPB Publications Theory of Computation Simplified: Simulate
Book Synopsis
£31.34
Oxford University Press Combinatorics Ancient Modern
a huge range and FREE tracked UK delivery on ALL orders.
£999.99
Springer Mathematical Problems and Proofs Combinatorics Number Theory and Geometry
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer Difference Equations
a huge range and FREE tracked UK delivery on ALL orders.
£82.83
Springer Difference Equations
a huge range and FREE tracked UK delivery on ALL orders.
£44.99
Springer New York Combinatorial Commutative Algebra
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.
£64.99
Springer New York Convex Polytopes
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.
£59.99
Springer New York Combinatorial Computational Biology of RNA Pseudoknots and Neutral Networks
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.
£49.49
Springer The New Book of Prime Number Records
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer New York Algebraic Graph Theory
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
£36.99
Springer Counting The Art of Enumerative Combinatorics
a huge range and FREE tracked UK delivery on ALL orders.
£66.49
Springer Constructive Combinatorics
a huge range and FREE tracked UK delivery on ALL orders.
£54.99
Springer Binary Quadratic Forms Classical Theory and Modern Computations
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.
£123.49
Springer Combinatorics and Reasoning Representing Justifying and Building Isomorphisms 47 Mathematics Education Library
a huge range and FREE tracked UK delivery on ALL orders.
£98.99
Springer Easy as p
a huge range and FREE tracked UK delivery on ALL orders.
£44.99
Penguin Publishing Group Why Machines Learn
£15.86
Springer Algorithms and Order 255 Nato Science Series C
a huge range and FREE tracked UK delivery on ALL orders.
£332.49
Springer Gibbs Random Fields Cluster Expansions 44 Mathematics and its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£44.99
Springer Neural and Automata Networks Dynamical Behavior and Applications 58 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£87.78
Springer Integer Programming 46 Mathematics and its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£24.99
Springer Cycles and Bridges in Graphs 49 Mathematics and its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer Topics in Computational Algebra
a huge range and FREE tracked UK delivery on ALL orders.
£123.49
Springer Fundamentals of Convex Analysis Duality Separation Representation and Resolution 24 Theory and Decision Library B
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer Graph Theoretical Approaches to Chemical Reactivity 9 Understanding Chemical Reactivity
a huge range and FREE tracked UK delivery on ALL orders.
£123.49
Springer Polytopes Abstract Convex and Computational 440 Nato Science Series C
a huge range and FREE tracked UK delivery on ALL orders.
£237.49
Springer Invariant Methods in Discrete and Computational Geometry Proceedings of the Curaao Conference 1317 June 1994
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer Extremal Combinatorial Problems and Their Applications 335 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£44.99
Springer NearRings and NearFields Proceedings of the Conference on NearRings and NearFields Fredericton New Brunswick Canada July 1824 1993 336 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£44.99
Springer Embeddability in Graphs 338 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer Discrete Analysis and Operations Research 355 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer Total Positivity and Its Applications 359 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£123.49
Springer Unbiased Estimators and their Applications Volume 2 Multivariate Case 362 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£123.49
Springer Operations Research and Discrete Analysis 391 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer ConflictControlled Processes 405 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer Graph Symmetry Algebraic Methods and Applications 497 Nato Science Series C
a huge range and FREE tracked UK delivery on ALL orders.
£170.99
Springer Exercises in Graph Theory 19 Texts in the Mathematical Sciences
a huge range and FREE tracked UK delivery on ALL orders.
£189.99
Springer Applications of Fibonacci Numbers Volume 7
a huge range and FREE tracked UK delivery on ALL orders.
£85.49
Springer Introduction to Vertex Operator Superalgebras and Their Modules Mathematics and Its Applications 456
a huge range and FREE tracked UK delivery on ALL orders.
£123.49
Springer Continuous Selections of Multivalued Mappings 455 Mathematics and Its Applications
a huge range and FREE tracked UK delivery on ALL orders.
£123.49
