Combinatorics

A famous theorem in the theory of linear spaces states that every finite linear space has at least as many lines as points. This result of De Bruijn and Erds led to the conjecture that every linear space with "few lines" canbe obtained from a...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9783540108832Author K.L. McAvaneyFormat PaperbackPage Count 360Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. KPublisher Springer-Verlag Berlin...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9783540133681Author K. M. KohFormat PaperbackPage Count 336Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. KPublisher Springer-Verlag Berlin and...

This volume examines mathematics as a product of the human mind and analyzes the language of "pure mathematics" from various advanced-level sources. Through analysis of the foundational texts of mathematics, it is demonstrated that math is a...

It is general consensus that Combinatorics has developed into a full-fledged mathematical discipline whose beginnings as a charming pastime have long since been left behind and whose great signifi cance for other branches of both pure and applied...

This volume, as Andrew M. Odlzyko writes in the foreword, "commemorates and celebrates the life and achievements of an extraordinary person." Originally conceived as an 80th birthday tribute to Herbert Wilf, the well-known combinatorialist, the...

In January 1989 a Workshop on Algorithms, Word Problems and Classi- fication in Combinatorial Group Theory was held at MSRl. This was part of a year-long program on Geometry and Combinatorial Group Theory or- ganised by Adyan, Brown, Gersten and...

Discrete structures model a vast array of objects ranging from DNA sequences to internet networks. The theory of generating functions provides an algebraic framework for discrete structures to be enumerated using mathematical tools. This book is the...

Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it...

This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of Laszlo Lovasz. The topics covered include classical subjects such as extremal graph theory, coding theory, design...

This volume is comprised of articles providing new results on variational and hemivariational inequalities with applications to Contact Mechanics unavailable from other sources. The book will be of particular interest to graduate students and young...

One service mathematics has rendered the 'Et moi, ..., si j'avait su comment en revenir, It has put common sense back je n'y serais point al!e.' human race. Jules Verne where it belongs, on the topmost shelf next to the dusty canister labelled 'discarded...

In the past two decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, availability of parallel computers has created substantial interest in exploring the use of parallel processing for solving...

Magic squares are among the more popular mathematical recreations. Over the last 50 years, many generalizations of "magic" ideas have been applied to graphs. Recently there has been a resurgence of interest in "magic labelings" due to...

Orthogonal designs have proved fundamental to constructing code division multiple antenna systems for more efficient mobile communications. Starting with basic theory, this book develops the algebra and combinatorics to create new communications modes...

This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such...

This IMA Volume in Mathematics and its Appllcations GRAPH THEORY AND SPARSE MATRIX COMPUTATION is based on the proceedings of a workshop that was an integraI part of the 1991- 92 IMA program on "Applied Linear AIgebra." The purpose of the...

It is general consensus that Combinatorics has developed into a full-fledged mathematical discipline whose beginnings as a charming pastime have long since been left behind and whose great signifi cance for other branches of both pure and applied...

This monograph contributes to the existence theory of difference sets, cyclic irreducible codes and similar objects. The new method of field descent for cyclotomic integers of presribed absolute value is developed. Applications include the first...

This book contains a collection of fifteen articles and is dedicated to the sixtieth birthdays of Lex Renner and Mohan Putcha, the pioneers of the field of algebraic monoids. Topics presented include: structure and representation theory of reductive...

Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9783540102540Author R. W. RobinsonFormat PaperbackPage Count 256Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. KPublisher Springer-Verlag...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9783540119715Author Dieter JungnickelFormat PaperbackPage Count 332Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. KPublisher Springer-Verlag...

This volume presents a collection of papers on game theory dedicated to Michael Maschler. Through his dedication and contributions to game theory, Maschler has become an important figure particularly in the area of cooperative games. Game theory has...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9783540126874Author M. BorowieckiFormat PaperbackPage Count 292Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. KPublisher Springer-Verlag Berlin...

For more than 35 years now, George B. Dantzig's Simplex-Method has been the most efficient mathematical tool for solving linear programming problems. It is proba bly that mathematical algorithm for which the most computation time on computers is spent...

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...

Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In particular, the book places special emphasis the Principle of Inclusion and Exclusion and the...

Graph Theory is a part of discrete mathematics characterized by the fact of an extremely rapid development during the last 10 years. The number of graph theoretical paper as well as the number of graph theorists increase very strongly. The main purpose...

A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and...

Algorithms for Games aims to provide a concrete example of the programming of a two-person game with complete information, and to demonstrate some of the methods of solutions; to show the reader that it is profitable not to fear a search, but rather to...

This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and...

This monograph covers some of the most important developments in Ramsey theory from its beginnings in the early 20th century via its many breakthroughs to recent important developments in the early 21st century. The book first presents a detailed...

The most recent methods in various branches of lattice path and enumerative combinatorics along with relevant applications are nicely grouped together and represented in this research contributed volume. Contributions to this edited volume will be mainly...

This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying...

Apologies but we at Booksplease don't have a full description for this book.Book InformationISBN 9783540085249Author C.H.C. LittleFormat PaperbackPage Count 216Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. KPublisher Springer-Verlag Berlin...

The book is an introduction to the theory of convex polytopes and polyhedral sets, to algebraic geometry, and to the connections between these fields, known as the theory of toric varieties. The first part of the book covers the theory of polytopes and...

The walks on ordinals and analysis of their characteristics is a subject matter started by the author some twenty years ago in order to disprove a particular extension of the Ramsey theorem. A further analysis has shown however that the resulting method...

This book is a survey on the problem of choosing from a tournament. It brings together under a unified and self-contained presentation results and concepts from Graph Theory, Choice Theory, Decision Science and Social Choice which were discovered in the...

This volume provides accessible and self-contained research problems designed for undergraduate student projects, and simultaneously promotes the development of sustainable undergraduate research programs. The chapters in this work span a variety of...