Mini faq
Combinatorial Designs and Tournaments
ISBN: 9780198500292 / Angielski / Twarda / 256 str. The mathematics of tournament design are surprisingly subtle, and this book, an extensively revised version of Ellis Horwood's popular Combinatorial Designs: Construction Methods, provides a thorough introduction. It includes a new chapter on league schedules, which discusses round robin tournaments, venue sequences, and carryover effects. It also discusses balanced tournament designs, double schedules, and bridge and whist tournament design. Readable and authoritative, the book emphasizes throughout the historical development of the material and includes numerous examples and exercises...
The mathematics of tournament design are surprisingly subtle, and this book, an extensively revised version of Ellis Horwood's popular Combinatorial D...


cena:
1048,82 zł 
A First Course in Combinatorial Mathematics
ISBN: 9780198596738 / Angielski / Miękka / 144 str. Now in a new second edition, this volume presents a clear and concise treatment of an increasingly important branch of mathematics. A unique introductory survey complete with easytounderstand examples and sample problems, this text includes information on such basic combinatorial tools as recurrence relations, generating functions, incidence matrices, and the nonexclusion principle. It also provides a study of block designs, Steiner triple systems, and expanded coverage of the marriage theorem, as well as a unified account of three important constructions which are significant in coding...
Now in a new second edition, this volume presents a clear and concise treatment of an increasingly important branch of mathematics. A unique introduct...


cena:
481,23 zł 
Introduction to Discrete Mathematics with Isetl
ISBN: 9780387947822 / Angielski / Twarda / 196 str. Intended for first or secondyear undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies constructivist principles that promote  indeed, require  active participation by the student. Working with the programming language ISETL, whose syntax is close to that of standard mathematical language, the student constructs the concepts in her or his mind as a result of constructing them on the computer in the syntax of ISETL. This dramatically different approach allows students to attempt to discover concepts in a Socratic dialog with the...
Intended for first or secondyear undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies con...


cena:
258,05 zł 
Stochastic Networks
ISBN: 9780387948287 / Angielski / Miękka / 298 str. Two of the most exciting topics of current research in stochastic networks are the complementary subjects of stability and rare events  roughly, the former deals with the typical behavior of networks, and the latter with significant atypical behavior. Both are classical topics, of interest since the early days of queueing theory, that have experienced renewed interest mo tivated by new applications to emerging technologies. For example, new stability issues arise in the scheduling of multiple job classes in semiconduc tor manufacturing, the socalled "reentrant lines;" and a prominent need...
Two of the most exciting topics of current research in stochastic networks are the complementary subjects of stability and rare events  roughly, the ...


cena:
486,95 zł 
Combinatorial Methods in Density Estimation
ISBN: 9780387951171 / Angielski / Twarda / 209 str. Density estimation has evolved enormously since the days of bar plots and histograms, but researchers and users are still struggling with the problem of the selection of the bin widths. This text explores a new paradigm for the databased or automatic selection of the free parameters of density estimates in general so that the expected error is within a given constant multiple of the best possible error. The paradigm can be used in nearly all density estimates and for most model selection problems, both parametric and nonparametric. It is the first book on this topic. The text is intended for...
Density estimation has evolved enormously since the days of bar plots and histograms, but researchers and users are still struggling with the problem ...


cena:
555,62 zł 
Counting: The Art of Enumerative Combinatorics
ISBN: 9780387952253 / Angielski / Twarda / 252 str. Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to...For example, How many ways are there to order a collection of 12 ice cream cones if 8 flavors are available? At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to color the faces of a cube if k colors are available with each face having exactly one color? or How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that...
Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are...


cena:
303,83 zł 
Constructive Combinatorics
ISBN: 9780387963471 / Angielski / Twarda / 186 str. The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a onequarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student.
The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Mi...


cena:
280,94 zł 
Combinatorics
ISBN: 9780471262961 / Angielski / Twarda / 576 str. A mathematical gemfreshly cleaned and polished
This book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create a pedagogical tool, useful to the broad spectrum of instructors who bring a variety of perspectives and expectations to such a course. Features retained from the first edition: Lively and engaging writing styleTimely and appropriate examplesNumerous wellchosen exercisesFlexible modular... A mathematical gemfreshly cleaned and polished
This book is intended to be used as the text for a first course in combinatorics. the text has been ... 

cena:
705,27 zł 
Combinatorial Theory
ISBN: 9780471315186 / Angielski / Miękka / 464 str. Includes proof of van der Waerden's 1926 conjecture on permanents, Wilson's theorem on asymptotic existence, and other developments in combinatorics since 1967. Also covers coding theory and its important connection with designs, problems of enumeration, and partition. Presents fundamentals in addition to latest advances, with illustrative problems at the end of each chapter. Enlarged appendixes include a longer list of block designs.
Includes proof of van der Waerden's 1926 conjecture on permanents, Wilson's theorem on asymptotic existence, and other developments in combinatorics s...


cena:
700,63 zł 
Combinatorial Optimization: Algorithms and Complexity
ISBN: 9780486402581 / Angielski / Miękka / 528 str. This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NPcomplete problems; approximation algorithms, local search heuristics for NPcomplete problems, more. All chapters are supplemented by thoughtprovoking problems. A useful work for graduatelevel students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a...
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipso...


cena:
78,83 zł 
Combinatorial Optimization: Networks and Matroids
ISBN: 9780486414539 / Angielski / Miękka / 384 str. Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapter...


cena:
103,22 zł 
Introduction to Combinatorial Analysis
ISBN: 9780486425368 / Angielski / Miękka / 256 str. This introduction to combinatorial analysis defines the subject as the number of ways there are of doing some welldefined operation. Chapter 1 surveys that part of the theory of permutations and combinations that finds a place in books on elementary algebra, which leads to the extended treatment of generation functions in Chapter 2, where an important result is the introduction of a set of multivariable polynomials. This introduction to combinatorial analysis defines the subject as the number of ways there are of doing some welldefined operation. Chapter 1 s... 

cena:
74,26 zł 
Combinatorial Enumeration
ISBN: 9780486435978 / Angielski / Miękka / 569 str. This graduatelevel text presents an encyclopedic account of the mathematical theory and problemsolving techniques associated with enumeration problems. Its approach blends combinatorial and algebraic ideas to offer insights into a wide variety of problems, and each section of the book focuses on a specific discrete structure, advancing from elementary (often classical) results to those at research level. Subjects include the combinatorics of the ordinary generating function and the exponential generating function, the combinatorics of sequences, and the combinatorics of paths. The text is...
This graduatelevel text presents an encyclopedic account of the mathematical theory and problemsolving techniques associated with enumeration proble...


cena:
144,59 zł 
Foundations of Combinatorics with Applications
ISBN: 9780486446035 / Angielski / Miękka / 468 str. This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upperlevel undergraduates and graduate students in engineering, science, and mathematics.
The fourpart treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses fundamental concepts in graph theory and a sampler of graph topics. The third part examines a variety of applications relevant to computer science and mathematics, including induction and recursion,... This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upperlevel undergradu...


cena:
94,94 zł 
A Course in Combinatorics
ISBN: 9780521006019 / Angielski / Miękka / 602 str. Combinatorics, a subject dealing with ways of arranging and distributing objects, involves ideas from geometry, algebra, and analysis. The breadth of the theory is matched by that of its applications, which include topics as diverse as codes, circuit design and algorithm complexity. It has thus become an essential tool in many scientific fields. In this second edition the authors have made the text as comprehensive as possible, dealing in a unified manner with such topics as graph theory, extremal problems, designs, colorings, and codes. The depth and breadth of the coverage make the book a...
Combinatorics, a subject dealing with ways of arranging and distributing objects, involves ideas from geometry, algebra, and analysis. The breadth of ...


cena:
478,89 zł 
Algebraic, Extremal, and Metric Combinatorics, 1986
ISBN: 9780521359238 / Angielski / Miękka / 256 str. Resulting from papers from Algebraic, Extremal and Metric Combinatorics 1986 conference held at the University of Montreal, this book represents a comprehensive overview of the present state of progress in three related areas of combinatorics. Topics covered in the articles include association shemes, extremal problems, combinatorial geometries and matroids, and designs. All the papers contain new results and many are extensive surveys of particular areas of research.
Resulting from papers from Algebraic, Extremal and Metric Combinatorics 1986 conference held at the University of Montreal, this book represents a com...


cena:
467,64 zł 
Surveys in Combinatorics, 1989
ISBN: 9780521378239 / Angielski / Miękka / 228 str. The invited lectures given at the 12th British Combinatorial Conference are contained in this volume. The lectures survey many areas of current research activity in combinatorics and its applications, including graph theory, designs and probabilistic graphs. This book provides a valuable survey for the present status of knowledge in combinatorics for mathematicians, computer scientists and engineers and research workers in combinatorics.
The invited lectures given at the 12th British Combinatorial Conference are contained in this volume. The lectures survey many areas of current resear...


cena:
315,07 zł 
Designs and Their Codes
ISBN: 9780521413619 / Angielski / Twarda / 364 str. Algebraic coding theory has in recent years been increasingly applied to the study of combinatorial designs. This book gives an account of many of those applications together with a thorough general introduction to both design theory and coding theory developing the relationship between the two areas. The first half of the book contains background material in design theory, including symmetric designs and designs from affine and projective geometry, and in coding theory, coverage of most of the important classes of linear codes. In particular, the authors provide a new treatment of the...
Algebraic coding theory has in recent years been increasingly applied to the study of combinatorial designs. This book gives an account of many of tho...


cena:
1014,14 zł 
Aspects of Combinatorics: A WideRanging Introduction
ISBN: 9780521429979 / Angielski / Miękka / 276 str. Building from basics and demonstrating the relationships among the various branches of combinatorics, Victor Bryant presents the results in a straightforward way. Numerous examples and exercises including hints and solutions are included throughout and serve to lead the reader to some of the deeper results of the subject, many of which are usually excluded from introductory texts.
Building from basics and demonstrating the relationships among the various branches of combinatorics, Victor Bryant presents the results in a straight...


cena:
415,21 zł 
Random Graphs
ISBN: 9780521440813 / Angielski / Twarda / 268 str. The book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of random graphs and permutations reduces the combinatorial problems to classical problems of probability theory on the summation of independent random variables. He offers recent research by Russian mathematicians, including a discussion of equations containing an unknown permutation, and the first Englishlanguage presentation of techniques...
The book is devoted to the study of classical combinatorial structures such as random graphs, permutations, and systems of random linear equations in ...


cena:
758,14 zł 