Conformal Graph Directed Markov Systems on Carnot Groups
ISBN: 9781470442156 Termin realizacji zamówienia: ok. 2530 dni roboczych. The authors develop a comprehensive theory of conformal graph directed Markov systems in the nonRiemannian setting of Carnot groups equipped with a subRiemannian 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 subRiemannian spaces. These include the Heisenberg continued fractions introduced...
The authors develop a comprehensive theory of conformal graph directed Markov systems in the nonRiemannian setting of Carnot groups equipped with a s...


cena:
409,06 zł 
Erd s on Graphs: His Legacy of Unsolved Problems
ISBN: 9780367447939 / Miękka / 142 str. Termin realizacji zamówienia: ok. 20 dni roboczych. This book is a tribute to Paul ErdHs, the wandering mathematician once described as the "prince of problem solvers and the absolute monarch of problem posers." It examines  within the context of his unique personality and lifestyle  the legacy of open problems he left to the world after his death in 1996. Unwilling to succumb to the temptations of money and position, ErdHs never had a home and never held a job. His "home" was a bag or two containing all his belongings and a record of the collective activities of the mathematical community. His "job" was one at which he excelled:...
This book is a tribute to Paul ErdHs, the wandering mathematician once described as the "prince of problem solvers and the absolute monarch of prob...


cena:
298,95 zł 
Topics in Graph Theory: Graphs and Their Cartesian Product
ISBN: 9780367446109 / Miękka / 219 str. Termin realizacji zamówienia: ok. 20 dni roboczych. From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian productsarguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particu...


cena:
298,95 zł 
Graph Theory With Applications To Engineering And Computer Science
ISBN: 9788120301450 / Miękka / 496 str. Termin realizacji zamówienia: ok. 2530 dni roboczych. 

cena:
65,08 zł 
Highdimensional Data Analysis
ISBN: 9789814324854 / Twarda / 320 str. Termin realizacji zamówienia: ok. 2530 dni roboczych. Over the last few years, significant developments have been taking place in highdimensional 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 highdimensional 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 highdimensional data analysis, driven primarily by a wide range of applic...


cena:
516,45 zł 
Exact Exponential Algorithms
ISBN: 9783642165320 / Twarda / 203 str. Termin realizacji zamówienia: ok. 22 dni roboczych. Today most computer scientists believe that NPhard problems cannot be solved by polynomialtime algorithms. From the polynomialtime perspective, all NPcomplete problems are equivalent but their exponentialtime properties vary widely. Why do some NPhard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, bruteforce methods? The algorithms that address these questions are known as exact exponential algorithms. The history of exact exponential algorithms for NPhard problems dates back... Today most computer scientists believe that NPhard problems cannot be solved by polynomialtime algorithms. From the polynomialtime perspective, ... 

cena:
373,22 zł 
Combinatorial Designs and Tournaments
ISBN: 9780198500292 / Angielski / Twarda / 256 str. Termin realizacji zamówienia: ok. 22 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 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:
1056,76 zł 
A First Course in Combinatorial Mathematics
ISBN: 9780198596738 / Angielski / Miękka / 144 str. Termin realizacji zamówienia: ok. 22 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 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:
484,85 zł 
Introduction to Discrete Mathematics with Isetl
ISBN: 9780387947822 / Angielski / Twarda / 196 str. Termin realizacji zamówienia: ok. 22 dni roboczych. 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:
275,36 zł 
Counting: The Art of Enumerative Combinatorics
ISBN: 9780387952253 / Angielski / Twarda / 252 str. Termin realizacji zamówienia: ok. 22 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:
373,22 zł 
Combinatorics
ISBN: 9780471262961 / Angielski / Twarda / 576 str. Termin realizacji zamówienia: ok. 2225 dni roboczych. 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:
782,84 zł 
Combinatorial Theory
ISBN: 9780471315186 / Angielski / Miękka / 464 str. Termin realizacji zamówienia: ok. 2225 dni roboczych. 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:
777,69 zł 
Combinatorial Optimization : Algorithms and Complexity
ISBN: 9780486402581 / Angielski / Miękka / 528 str. Termin realizacji zamówienia: ok. 1620 dni roboczych. 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:
90,08 zł 
Combinatorial Optimization: Networks and Matroids
ISBN: 9780486414539 / Angielski / Miękka / 384 str. Termin realizacji zamówienia: ok. 1620 dni roboczych. 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:
104,00 zł 
Introduction to Combinatorial Analysis
ISBN: 9780486425368 / Angielski / Miękka / 256 str. Termin realizacji zamówienia: ok. 1620 dni roboczych. 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,82 zł 
A Course in Combinatorics
ISBN: 9780521006019 / Angielski / Miękka / 620 str. Termin realizacji zamówienia: ok. 22 dni roboczych. 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:
537,73 zł 
Algebraic, Extremal and Metric Combinatorics 1986
ISBN: 9780521359238 / Angielski / Miękka / 256 str. Termin realizacji zamówienia: ok. 22 dni roboczych. 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:
357,11 zł 
Surveys in Combinatorics, 1989 : Invited Papers at the Twelfth British Combinatorial Conference
ISBN: 9780521378239 / Angielski / Miękka / 228 str. Termin realizacji zamówienia: ok. 22 dni roboczych. 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:
257,90 zł 
Designs and their Codes
ISBN: 9780521413619 / Angielski / Twarda / 364 str. Termin realizacji zamówienia: ok. 22 dni roboczych. 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:
942,25 zł 