» książki » Mathematics - Combinatorics
 |
Conformal Graph Directed Markov Systems on Carnot Groups
ISBN: 9781470442156 Termin realizacji zamówienia: ok. 5-8 dni roboczych. The authors develop a comprehensive theory of conformal graph directed Markov systems in the non-Riemannian setting of Carnot groups equipped with a sub-Riemannian metric. In particular, they develop the thermodynamic formalism and show that, under natural hypotheses, the limit set of an Carnot conformal GDMS has Hausdorff dimension given by Bowen's parameter. They illustrate their results for a variety of examples of both linear and nonlinear iterated function systems and graph directed Markov systems in such sub-Riemannian spaces. These include the Heisenberg continued fractions introduced...
The authors develop a comprehensive theory of conformal graph directed Markov systems in the non-Riemannian setting of Carnot groups equipped with a s...
|
cena:
369,19 |
 |
Graphs & Digraphs
ISBN: 9781032606989 / Miękka / 376 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
281,70 |
 |
Graphs & Digraphs
ISBN: 9781032133409 / Twarda / 376 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
607,23 |
 |
Methods of Graph Decompositions
ISBN: 9780198882091 / Twarda / 272 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
443,51 |
 |
Discrete Mathematics: An Open Introduction
ISBN: 9781032965529 / Twarda / 480 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
801,54 |
 |
Introduction to Enumerative and Analytic Combinatorics
ISBN: 9781032302706 / Twarda / 592 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
446,87 |
 |
Enumerative Combinatorics: Volume 2
ISBN: 9781009262491 / Twarda / 788 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
581,57 |
 |
Lectures in Knot Theory: An Exploration of Contemporary Topics
ISBN: 9783031400438 / Miękka / 490 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
221,37 |
 |
Vector Partitions, Visible Points and Ramanujan Functions
ISBN: 9781032003665 / Twarda / 552 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
801,54 |
 |
The Nature of Complex Networks
ISBN: 9780198959632 / Miękka / 480 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
185,79 |
 |
High-Dimensional Data Analysis
ISBN: 9789814324854 / Twarda / 320 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Over the last few years, significant developments have been taking place in high-dimensional data analysis, driven primarily by a wide range of applications in many fields such as genomics and signal processing. In particular, substantial advances have been made in the areas of feature selection, covariance estimation, classification and regression. This book intends to examine important issues arising from high-dimensional data analysis to explore key ideas for statistical inference and prediction.
It is structured around topics on multiple hypothesis testing, feature selection,... Over the last few years, significant developments have been taking place in high-dimensional data analysis, driven primarily by a wide range of applic...
|
cena:
461,50 |
 |
Exact Exponential Algorithms
ISBN: 9783642165320 / Twarda / 203 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, brute-force methods? The algorithms that address these questions are known as exact exponential algorithms. The history of exact exponential algorithms for NP-hard problems dates back... Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, ... |
cena:
301,89 |
 |
Combinatorial Designs and Tournaments
ISBN: 9780198500292 / Angielski / Twarda / 256 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. 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 carry-over 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:
892,22 |
 |
Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh
ISBN: 9780198571278 / Angielski / Twarda / 320 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Professor Dominic Welsh has made significant contributions to the fields of combinatorics and discrete probability, including matroids, complexity, and percolation, and has taught, influenced and inspired generations of students and researchers in mathematics. This volume summarizes and reviews the consistent themes from his work through a series of articles written by renowned experts. These articles contain original research work, set in a broader context by the inclusion of review material. As a reference text in its own right, this book will be valuable to academic researchers, research...
Professor Dominic Welsh has made significant contributions to the fields of combinatorics and discrete probability, including matroids, complexity, an...
|
cena:
535,55 |
 |
A First Course in Combinatorial Mathematics
ISBN: 9780198596738 / Angielski / Miękka / 144 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. 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 easy-to-understand examples and sample problems, this text includes information on such basic combinatorial tools as recurrence relations, generating functions, incidence matrices, and the non-exclusion 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:
356,07 |
 |
Introduction to Discrete Mathematics with Isetl
ISBN: 9780387947822 / Angielski / Twarda / 196 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Intended for first- or second-year 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 second-year undergraduates, this introduction to discrete mathematics covers the usual topics of such a course, but applies con...
|
cena:
201,24 |
 |
Stochastic Networks
ISBN: 9780387948287 / Angielski / Miękka / 298 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. 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 so-called "re-entrant 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:
402,53 |
 |
Combinatorial Methods in Density Estimation
ISBN: 9780387951171 / Angielski / Twarda / 209 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. 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 data-based 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:
563,56 |
 |
Counting: The Art of Enumerative Combinatorics
ISBN: 9780387952253 / Angielski / Twarda / 252 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. 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:
322,01 |
 |
Counting and Configurations: Problems in Combinatorics, Arithmetic, and Geometry
ISBN: 9780387955520 / Angielski / Twarda / 392 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book presents methods of solving problems in three areas of elementary combinatorial mathematics: classical combinatorics, combinatorial arithmetic, and combinatorial geometry. Brief theoretical discussions are immediately followed by carefully worked-out examples of increasing degrees of difficulty and by exercises that range from routine to rather challenging. The book features approximately 310 examples and 650 exercises. This book presents methods of solving problems in three areas of elementary combinatorial mathematics: classical combinatorics, combinatorial arith... |
cena:
422,66 |
Czytaj nas na:
KrainaKsiazek.PL - Księgarnia Internetowa
