» książki » Mathematics - Combinatorics
topmenu
 |
Combinatorics and Partially Ordered Sets: Dimension Theory
ISBN: 9780801869778 / Angielski / Miękka / 328 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Primarily intended for research mathematicians and computer scientists, Combinatorics and Partially Ordered Sets: Dimension Theory also serves as a useful text for advanced students in either field. William Trotter concentrates on combinatorial topics for finite partially ordered sets, and with dimension theory serving as a unifying theme, research on partially ordered sets or posets is linked to more traditional topics in combinatorial mathematics--including graph theory, Ramsey theory, probabilistic methods, hypergraphs, algorithms, and computational geometry. The book's most... Primarily intended for research mathematicians and computer scientists, Combinatorics and Partially Ordered Sets: Dimension Theory also serv... |
cena:
214,67 zł |
 |
Mathematical Essays in honor of Gian-Carlo Rota
ISBN: 9780817638726 / Angielski / Twarda / 466 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. In April of 1996 an array of mathematicians converged on Cambridge, Massachusetts, for the Rotafest and Umbral Calculus Workshop, two con ferences celebrating Gian-Carlo Rota's 64th birthday. It seemed appropriate when feting one of the world's great combinatorialists to have the anniversary be a power of 2 rather than the more mundane 65. The over seventy-five par ticipants included Rota's doctoral students, coauthors, and other colleagues from more than a dozen countries. As a further testament to the breadth and depth of his influence, the lectures ranged over a wide variety of topics from...
In April of 1996 an array of mathematicians converged on Cambridge, Massachusetts, for the Rotafest and Umbral Calculus Workshop, two con ferences cel...
|
cena:
806,99 zł |
 |
Advances in Combinatorial Methods and Applications to Probability and Statistics
ISBN: 9780817639082 / Angielski / Twarda / 562 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Sri Gopal Mohanty has made pioneering contributions to lattice path counting and its applications to probability and statistics. This is clearly evident from his lifetime publications list and the numerous citations his publications have received over the past three decades. My association with him began in 1982 when I came to McMaster Univer- sity. Since then, I have been associated with him on many different issues at professional as well as cultural levels; I have benefited greatly from him on both these grounds. I have enjoyed very much being his colleague in the statistics group here at...
Sri Gopal Mohanty has made pioneering contributions to lattice path counting and its applications to probability and statistics. This is clearly evide...
|
cena:
806,99 zł |
 |
Physical Combinatorics
ISBN: 9780817641757 / Angielski / Twarda / 317 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This work is concerned with combinatorial aspects arising in the theory of exactly solvable models and representation theory. Developments in integrable models reveal an unexpected link between representation theory and statistical mechanics through combinatorics. For example, Young tableaux, which describe the basis of irreducible representations, appear in the Bethe Ansatz method in quantum spin chains as labels for the eigenstates of Hamiltonians. this text presents results and ideas from three viewpoints: representation theory; integrable models; and combinatorics.
This work is concerned with combinatorial aspects arising in the theory of exactly solvable models and representation theory. Developments in integrab...
|
cena:
408,11 zł |
 |
A Path to Combinatorics for Undergraduates: Counting Strategies
ISBN: 9780817642884 / Angielski / Miękka / 228 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The main goal of the two authors is to help undergraduate students understand the concepts and ideas of combinatorics, an important realm of mathematics, and to enable them to ultimately achieve excellence in this field. This goal is accomplished by familiariz ing students with typical examples illustrating central mathematical facts, and by challenging students with a number of carefully selected problems. It is essential that the student works through the exercises in order to build a bridge between ordinary high school permutation and combination exercises and more sophisticated,...
The main goal of the two authors is to help undergraduate students understand the concepts and ideas of combinatorics, an important realm of mathemati...
|
cena:
262,25 zł |
 |
Combinatorial Algorithms: Generation, Enumeration, and Search
ISBN: 9780849339882 / Angielski / Twarda / 344 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Outlines and analyzes combinatorial algorithms for generation, enumeration and search applications. This work introduces the important combinatorial algorithmic techniques. It covers group algorithms, graph isomorphisms, hill-climbing and heuristic search algorithms.
Outlines and analyzes combinatorial algorithms for generation, enumeration and search applications. This work introduces the important combinatorial a...
|
cena:
632,81 zł |
 |
Asymptotic Combinatorics with Application to Mathematical Physics
ISBN: 9781402007927 / Angielski / Twarda / 327 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. New and striking results obtained in recent years from an intensive study of asymptotic combinatorics have led to a new, higher level of understanding of related problems: the theory of integrable systems, the Riemann-Hilbert problem, asymptotic representation theory, spectra of random matrices, combinatorics of Young diagrams and permutations, and even some aspects of quantum field theory.
New and striking results obtained in recent years from an intensive study of asymptotic combinatorics have led to a new, higher level of understanding...
|
cena:
403,47 zł |
 |
Asymptotic Combinatorics with Application to Mathematical Physics
ISBN: 9781402007934 / Angielski / Miękka / 327 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. New and striking results obtained in recent years from an intensive study of asymptotic combinatorics have led to a new, higher level of understanding of related problems: the theory of integrable systems, the Riemann-Hilbert problem, asymptotic representation theory, spectra of random matrices, combinatorics of Young diagrams and permutations, and even some aspects of quantum field theory.
New and striking results obtained in recent years from an intensive study of asymptotic combinatorics have led to a new, higher level of understanding...
|
cena:
403,47 zł |
 |
Elliptic Curves: Number Theory and Cryptography, Second Edition
ISBN: 9781420071467 / Angielski / Twarda / 531 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Like its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second Edition develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications. With additional exercises, this edition offers more comprehensive coverage of the fundamental theory, techniques, and applications of elliptic curves.
New to the Second Edition Like its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second Edition develops the theory of elliptic curves to pro...
|
cena:
924,88 zł |
 |
Enumerative Combinatorics
ISBN: 9781584882909 / Angielski / Twarda / 632 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Enumerative Combinatorics presents elaborate and systematic coverage of the theory of enumeration. The first seven chapters provide the necessary background, including basic counting principles and techniques, elementary enumerative topics, and an extended presentation of generating functions and recurrence relations. The remaining seven chapters focus on more advanced topics, including, Stirling numbers, partitions of integers, partition polynomials, Eulerian numbers and Polya's counting theorem.
Extensively classroom tested, this text was designed for introductory- and... Enumerative Combinatorics presents elaborate and systematic coverage of the theory of enumeration. The first seven chapters provide the necessary back...
|
cena:
559,80 zł |
 |
Authentication Codes and Combinatorial Designs
ISBN: 9781584884736 / Angielski / Twarda / 256 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially balanced designs (SPBD).
Beginning with examples illustrating the concepts of authentication schemes and combinatorial designs, the book considers the probability of successful deceptions followed by schemes involving three and four... Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information ...
|
cena:
632,81 zł |
 |
Handbook of Combinatorial Designs
ISBN: 9781584885061 / Angielski / Twarda / 984 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. < P> Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only resource to contain all of the most important results and tables in the field of combinatorial design. This handbook covers the constructions, properties, and applications of designs as well as existence results. Over 30% longer than the first edition, the book builds upon the groundwork of its predecessor while retaining the original contributors' expertise. The first part contains a brief introduction and history of the subject. The...
< P> Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only...
|
cena:
1070,92 zł |
 |
Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications
ISBN: 9781584887430 / Angielski / Twarda / 664 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.
After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating... Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along ...
|
cena:
584,14 zł |
 |
Introduction to Combinatorial Designs
ISBN: 9781584888383 / Angielski / Twarda / 327 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Combinatorial theory is one of the fastest growing areas of modern mathematics. Focusing on a major part of this subject, Introduction to Combinatorial Designs, Second Edition provides a solid foundation in the classical areas of design theory as well as in more contemporary designs based on applications in a variety of fields.
After an overview of basic concepts, the text introduces balanced designs and finite geometries. The author then delves into balanced incomplete block designs, covering difference methods, residual and derived designs, and resolvability. Following a chapter... Combinatorial theory is one of the fastest growing areas of modern mathematics. Focusing on a major part of this subject, Introduction to Combinato...
|
cena:
535,46 zł |
 |
Scale-Isometric Polytopal Graphs in Hypercubes and Cubic Lattices: Polytopes in Hypercubes and Zn
ISBN: 9781860944215 / Angielski / Twarda / 188 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This monograph identifies polytopes that are “combinatorially ℓ1-embeddable”, within interesting lists of polytopal graphs, i.e. such that corresponding polytopes are either prominent mathematically (regular partitions, root lattices, uniform polytopes and so on), or applicable in chemistry (fullerenes, polycycles, etc.). The embeddability, if any, provides applications to chemical graphs and, in the first case, it gives new combinatorial perspective to “ℓ2-prominent” affine polytopal objects.The lists of polytopal graphs in the...
This monograph identifies polytopes that are “combinatorially ℓ1-embeddable”, within interesting lists of polytopal gr...
|
cena:
369,96 zł |
 |
Elemental Methods in Ergodic Ramsey Theory
ISBN: 9783540668091 / Angielski / Miękka / 166 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book, suitable for graduate students and professional mathematicians alike, didactically introduces methodologies due to Furstenberg and others for attacking problems in chromatic and density Ramsey theory via recurrence in topological dynamics and ergodic theory, respectively. Many standard results are proved, including the classical theorems of van der Waerden, Hindman, and Szemeredi. More importantly, the presentation strives to reflect the extent to which the field has been streamlined since breaking onto the scene around twenty years ago. Potential readers who were previously...
This book, suitable for graduate students and professional mathematicians alike, didactically introduces methodologies due to Furstenberg and others f...
|
cena:
153,30 zł |
 |
Algebraic Combinatorics: Lectures at a Summer School in Nordfjordeid, Norway, June 2003
ISBN: 9783540683759 / Angielski / Miękka / 182 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book is based on two series of lectures given at a summer school on algebraic combinatorics at the Sophus Lie Centre in Nordfjordeid, Norway, in June 2003, one by Peter Orlik on hyperplane arrangements, and the other one by Volkmar Welker on free resolutions. Both topics are essential parts of current research in a variety of mathematical fields, and the present book makes these sophisticated tools available for graduate students. This book is based on two series of lectures given at a summer school on algebraic combinatorics at the Sophus Lie Centre in Nordfjordeid, Norway, ... |
cena:
201,72 zł |
 |
Combinatorial and Computational Mathematics: Present and Future
ISBN: 9789810246785 / Angielski / Twarda / 288 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century. It contains primarily survey papers and presents original research by Peter Fishburn, Jim Ho Kwak, Jaeun Lee, K.H. Kim, F.W. Roush and Susan Williams. The papers deal with some of the most exciting and promising developments in the areas of coding theory in relation to number theory, lattice theory and its applications, graph theory and its applications, topological techniques in combinatorics, symbolic...
This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working ...
|
cena:
647,42 zł |
 |
Combinatorial and Global Optimization
ISBN: 9789810248024 / Angielski / Twarda / 372 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated...
Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and com...
|
cena:
623,08 zł |
 |
Walk Through Combinatorics, A: An Introduction to Enumeration and Graph Theory
ISBN: 9789810249007 / Angielski / Twarda / 424 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of exercises, ranging in difficulty from "routine" to "worthy of independent publication, " is included. In each section, there are also exercises that contain material not explicitly discussed in the text before, so as to provide instructors with extra choices if they want to shift the emphasis of their course.
It goes without saying that the text covers the classic areas, i.e. combinatorial choice problems and graph theory. What is unusual, for an undergraduate textbook, is... This is a textbook for an introductory combinatorics course that can take up one or two semesters. An extensive list of exercises, ranging in difficul...
|
cena:
355,35 zł |
Czytaj nas na:
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
