![]() |
Some Notes on Game Bounds
ISBN: 9781581120219 / Angielski / Miękka / 108 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
84,93 |
![]() |
Spanning Trees and Optimization Problems
ISBN: 9781584884361 / Angielski / Twarda / 200 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under one cover spanning tree properties, classical results, and recent research developments.
Spanning Trees and Optimization Problems offers the first complete treatment of spanning tree algorithms, from their role in classical computer science to... The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also p...
|
cena:
631,52 |
![]() |
Sums of Squares of Integers
ISBN: 9781584884569 / Angielski / Twarda / 368 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Sums of Squares of Integers is the first book to combine elementary methods with analytic methods of modular functions to study the representation of integers as sums of squares. It is the first book to tell how to compute the number of representations of an integer n as the sum of s squares for any s and n. This book is also the first to give a proof of Szemeredi's theorem, an important result in modern number theory. It discusses how the modern theory of modular forms complements and clarifies the classical, fundamental results about sums of squares. This text includes applications to such...
Sums of Squares of Integers is the first book to combine elementary methods with analytic methods of modular functions to study the representation of ...
|
cena:
874,41 |
![]() |
An Introduction to Cryptography
ISBN: 9781584886181 / Angielski / Twarda / 413 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Continuing a bestselling tradition, An Introduction to Cryptography, Second Edition provides a solid foundation in cryptographic concepts that features all of the requisite background material on number theory and algorithmic complexity as well as a historical look at the field.
With numerous additions and restructured material, this edition presents the ideas behind cryptography and the applications of the subject. The first chapter provides a thorough treatment of the mathematics necessary to understand cryptography, including number theory and complexity, while the second chapter... Continuing a bestselling tradition, An Introduction to Cryptography, Second Edition provides a solid foundation in cryptographic concepts that feature...
|
cena:
485,78 |
![]() |
Graph Theory
ISBN: 9781846289699 / Angielski / Twarda / 663 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. The book also serves as an introduction to research in graph theory. The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning... |
cena:
221,21 |
![]() |
A First Course in Discrete Mathematics
ISBN: 9781852332365 / Angielski / Miękka / 200 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as...
Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph ...
|
cena:
140,86 |
![]() |
Noncommutative Character Theory of the Symmetric Group
ISBN: 9781860945113 / Angielski / Twarda / 184 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. A new approach to the character theory of the symmetric group has been developed during the past fifteen years which is in many ways more efficient, more transparent, and more elementary. In this approach, to each permutation is assigned a class function of the corresponding symmetric group. Problems in character theory can thereby be transferred into a completely different setting and reduced to combinatorial problems on permutations in a natural and uniform way.This is the first account in book form entirely devoted to the new “noncommutative method”. As a modern and...
A new approach to the character theory of the symmetric group has been developed during the past fifteen years which is in many ways more efficient, m...
|
cena:
335,19 |
![]() |
The Fifteen Schoolgirls
ISBN: 9781900355483 / Angielski / Miękka / 120 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. A famous problem found in books on mathematical recreations was first proposed in an annual in 1850 by a vicar and amateur mathematician, Thomas Kirkman. Fifteen schoolgirls walk out three abreast for seven days and it was required to arrange each days walk so that any pair of girls were only once in the same row during the week.
The puzzle arose from Kirkmans work on a more general mathematical problem which he was to explore in a number of published articles over the next few years. Much of his work was ignored at the time, but it involved various combinatorial ideas that have now become of... A famous problem found in books on mathematical recreations was first proposed in an annual in 1850 by a vicar and amateur mathematician, Thomas Kirkm...
|
cena:
81,42 |
![]() |
Automatic Sequences
ISBN: 9783110156294 / Angielski / Twarda / 191 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The aim of the series is to present new and important developments in pure and applied mathematics. Well established in the community over two decades, it offers a large library of mathematics including several important classics. The volumes supply thorough and detailed expositions of the methods and ideas essential to the topics in question. In addition, they convey their relationships to other parts of mathematics. The series is addressed to advanced readers wishing to thoroughly study the topic. Editorial Board Lev Birbrair,... The aim of the series is to present new and important developments in pure and applied mathematics. Well established in the community over two deca... |
cena:
594,70 |
![]() |
Combinatorial Number Theory: Proceedings of the 'Integers Conference 2005' in Celebration of the 70th Birthday of Ronald Graham, Carrollton, Georgi
ISBN: 9783110190298 / Angielski / Twarda / 498 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This carefully edited volume contains selected refereed papers based on lectures presented by many distinguished speakers at the "Integers Conference 2005," an international conference in combinatorial number theory. The conference was held in celebration of the 70th birthday of Ronald Graham, a leader in several fields of mathematics. This carefully edited volume contains selected refereed papers based on lectures presented by many distinguished speakers at the "Integers Conferen... |
cena:
888,11 |
![]() |
Higher Dimensional Varieties and Rational Points
ISBN: 9783540008200 / Angielski / Twarda / 310 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Exploring the connections between arithmetic and geometric properties of algebraic varieties has been the object of much fruitful study for a long time, especially in the case of curves. The aim of the Summer School and Conference on "Higher Dimensional Varieties and Rational Points" held in Budapest, Hungary during September 2001 was to bring together students and experts from the arithmetic and geometric sides of algebraic geometry in order to get a better understanding of the current problems, interactions and advances in higher dimension. The lecture series and conference lectures... Exploring the connections between arithmetic and geometric properties of algebraic varieties has been the object of much fruitful study for a long ... |
cena:
402,53 |
![]() |
Theory of Association Schemes
ISBN: 9783540261360 / Angielski / Twarda / 284 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The present text is an introduction to the theory of association schemes. We start with the de?nition of an association scheme (or a scheme as we shall say brie?y), and in order to do so we ?x a set and call it X. We write 1 to denote the set of all pairs (x, x) with x? X. For each subset X ? r of the cartesian product XX, we de?ne r to be the set of all pairs (y, z) with (z, y)? r.For x an element of X and r a subset of X X, we shall denote by xr the set of all elements y in X with (x, y)? r. Let us ?x a partition S of XX with / S and 1 ? S, and let us assume X ? that s ? S for each element...
The present text is an introduction to the theory of association schemes. We start with the de?nition of an association scheme (or a scheme as we shal...
|
cena:
402,53 |
![]() |
Combinatorial Group Theory
ISBN: 9783540411581 / Angielski / Miękka / 339 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. From the reviews:
"This book (...) defines the boundaries of the subject now called combinatorial group theory. (...)it is a considerable achievement to have concentrated a survey of the subject into 339 pages. This includes a substantial and useful bibliography; (over 1100 (items)). ...the book is a valuable and welcome addition to the literature, containing many results not previously available in a book. It will undoubtedly become a standard reference." Mathematical Reviews, AMS, 1979 From the reviews:
"This book (...) defines the boundaries of the subject now called combinatorial group theory. (...)it is a considerable achievem... |
cena:
221,37 |
![]() |
The Strange Logic of Random Graphs
ISBN: 9783540416548 / Angielski / Twarda / 168 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The study of random graphs was begun in the 1960s and now has a comprehensive literature. This excellent book by one of the top researchers in the field now joins the study of random graphs (and other random discrete objects) with mathematical logic. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures. The study of random graphs was begun in the 1960s and now has a comprehensive literature. This excellent book by one of the top researchers in the ... |
cena:
402,53 |
![]() |
Graph Colouring and the Probabilistic Method
ISBN: 9783540421399 / Angielski / Twarda / 326 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an accessible and unified treatment of these results, using tools such as the Lovasz Local Lemma and Talagrand's concentration inequality.
The topics covered include: Kahn's proofs that the Goldberg-Seymour and List Colouring Conjectures hold asymptotically; a proof that for some absolute constant C, every graph of maximum degree Delta has a Delta+C total colouring; Johansson's proof that a triangle free graph has a O(Delta over log Delta)... Over the past decade, many major advances have been made in the field of graph colouring via the probabilistic method. This monograph provides an acce...
|
cena:
563,56 |
![]() |
Excursions into Combinatorial Geometry
ISBN: 9783540613411 / Angielski / Miękka / 423 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The book deals with the combinatorial geometry of convex bodies in finite-dimensional spaces. A general introduction to geometric convexity is followed by the investigation of d-convexity and H-convexity, and by various applications. Recent research is discussed, for example the three problems from the combinatorial geometry of convex bodies (unsolved in the general case): the Szoekefalvi-Nagy problem, the Borsuk problem, the Hadwiger covering problem. These and related questions are then applied to a new class of convex bodies which is a natural generalization of the class of zonoids: the...
The book deals with the combinatorial geometry of convex bodies in finite-dimensional spaces. A general introduction to geometric convexity is followe...
|
cena:
221,21 |
![]() |
Probabilistic Methods for Algorithmic Discrete Mathematics
ISBN: 9783540646228 / Angielski / Twarda / 325 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Leave nothing to chance. This cliche embodies the common belief that ran- domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba- bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time,...
Leave nothing to chance. This cliche embodies the common belief that ran- domness has no place in carefully planned methodologies, every step should b...
|
cena:
402,53 |
![]() |
Formal Power Series and Algebraic Combinatorics: 12th International Conference, Fpsac'00, Moscow, Russia, June 2000, Proceedings
ISBN: 9783540672470 / Angielski / Twarda / 808 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book contains the extended abstracts presented at the 12th International Conference on Power Series and Algebraic Combinatorics (FPSAC '00) that took place at Moscow State University, June 26-30, 2000. These proceedings cover the most recent trends in algebraic and bijective combinatorics, including classical combinatorics, combinatorial computer algebra, combinatorial identities, combinatorics of classical groups, Lie algebra and quantum groups, enumeration, symmetric functions, young tableaux etc...
This book contains the extended abstracts presented at the 12th International Conference on Power Series and Algebraic Combinatorics (FPSAC '00) that ...
|
cena:
1207,67 |
![]() |
Combinatorial Algebraic Topology
ISBN: 9783540719618 / Angielski / Twarda / 412 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Combinatorial algebraic topology is a fascinating and dynamic field at the crossroads of algebraic topology and discrete mathematics. This volume is the first comprehensive treatment of the subject in book form. The first part of the book constitutes a swift walk through the main tools of algebraic topology, including Stiefel-Whitney characteristic classes, which are needed for the later parts. Readers - graduate students and working mathematicians alike - will probably find particularly useful the second part, which contains an in-depth discussion of the major research techniques of... Combinatorial algebraic topology is a fascinating and dynamic field at the crossroads of algebraic topology and discrete mathematics. This volume i... |
cena:
483,04 |
![]() |
Polytopes - Combinations and Computation
ISBN: 9783764363512 / Angielski / Miękka / 225 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with...
Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter...
|
cena:
140,70 |