combinatorics ordered sets (36 résultats)

Etat : Very Good. 285 pp., Paperback, very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Etat : New.

Paperback or Softback. Etat : New. Combinatorics and Partially Ordered Sets: Dimension Theory. Book.

Etat : As New. Unread book in perfect condition.

Paperback. Etat : New. Primarily intended for research mathematicians and computer scientists, Combinatorics and Partially Ordered Sets: Dimension Theory also serves as a useful text for advanced students in either field. William Trotter concentrates on combinatorial topics for finite partially ordered sets, and with dimension theory serving as a unifying theme, research on partially ordered sets or posets is linked to more traditional topics in combinatorial mathematics -- including graph theory, Ramsey theory, probabilistic methods, hypergraphs, algorithms, and computational geometry. The book's most important contribution is to collect, organize, and explain the many theorems on partially ordered sets in a way that makes them available to the widest possible audience.

Paperback. Etat : New. Primarily intended for research mathematicians and computer scientists, Combinatorics and Partially Ordered Sets: Dimension Theory also serves as a useful text for advanced students in either field. William Trotter concentrates on combinatorial topics for finite partially ordered sets, and with dimension theory serving as a unifying theme, research on partially ordered sets or posets is linked to more traditional topics in combinatorial mathematics -- including graph theory, Ramsey theory, probabilistic methods, hypergraphs, algorithms, and computational geometry. The book's most important contribution is to collect, organize, and explain the many theorems on partially ordered sets in a way that makes them available to the widest possible audience.

Etat : New. In.

paperback. Etat : New.

Etat : New.

Etat : New. pp. 420.

Etat : As New. Unread book in perfect condition.

Etat : New. pp. 420.

Paperback. Etat : Brand New. 324 pages. 8.75x5.75x0.75 inches. In Stock.

Paperback. Etat : New. Primarily intended for research mathematicians and computer scientists, Combinatorics and Partially Ordered Sets: Dimension Theory also serves as a useful text for advanced students in either field. William Trotter concentrates on combinatorial topics for finite partially ordered sets, and with dimension theory serving as a unifying theme, research on partially ordered sets or posets is linked to more traditional topics in combinatorial mathematics -- including graph theory, Ramsey theory, probabilistic methods, hypergraphs, algorithms, and computational geometry. The book's most important contribution is to collect, organize, and explain the many theorems on partially ordered sets in a way that makes them available to the widest possible audience.

Paperback. Etat : New. Primarily intended for research mathematicians and computer scientists, Combinatorics and Partially Ordered Sets: Dimension Theory also serves as a useful text for advanced students in either field. William Trotter concentrates on combinatorial topics for finite partially ordered sets, and with dimension theory serving as a unifying theme, research on partially ordered sets or posets is linked to more traditional topics in combinatorial mathematics -- including graph theory, Ramsey theory, probabilistic methods, hypergraphs, algorithms, and computational geometry. The book's most important contribution is to collect, organize, and explain the many theorems on partially ordered sets in a way that makes them available to the widest possible audience.

Etat : New. Satisfaction Guaranteed or your money back.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The second edition of this highly praised textbook provides an expanded introduction to the theory of ordered sets and its connections to various subjects. Utilizing a modular presentation, the core material is purposely kept brief, allowing for the benefits of a broad exposure to the subject without the risk of overloading the reader with too much information all at once. The remaining chapters can then be read in almost any order, giving the text a greater depth and flexibility of use. Most topics are introduced by examining how they relate to research problems, some of them still open, allowing for continuity among diverse topics and encouraging readers to explore these problems further with research of their own.A wide range of material is presented, from classical results such as Dilworth's, Szpilrajn's, and Hashimoto's Theorems to more recent results such as the Li-Milner Structure Theorem. Major topics covered include chains and antichains, lowest upper and greatest lower bounds, retractions, algorithmic approaches, lattices, the dimension of ordered sets, interval orders, lexicographic sums, products, enumeration, and the role of algebraic topology. This new edition shifts the primary focus to finite ordered sets, with results on infinite ordered sets presented toward the end of each chapter whenever possible. Also new are Chapter 6 on graphs and homomorphisms, which serves to separate the fixed clique property from the more fundamental fixed simplex property as well as to discuss the connections and differences between graph homomorphisms and order-preserving maps, and an appendix on discrete Morse functions and their use for the fixed point property for ordered sets.Rich in examples, diagrams, and exercises, the second edition of Ordered Sets will be an excellent text for undergraduate and graduate students and a valuable resource for interested researchers. It will be especially useful to those looking for an introduction to the theory of ordered sets and its connections to such areas as algebraic topology, analysis, and computer science.PRAISE FOR THE FIRST EDITION'The author has done the field a service by producing an excellent text strong in the presentation of certain topological aspects of the underlying diagrams, e.g., which should serve the developing community and field well and which can be recommended without reservations as one of the volumes which should grace a poseteer's library whether she is interested only or mainly in the theory of these objects or has directed her gaze towards applications. As a sourcebook of ideas and understanding it will make its mark. And deservedly so.' - ZENTRALBLATT MATH'.A gem. Undergraduate mathematics and computer science majors will find the first chapters offering background that will serve them well in many courses. The rest of the book, which features many open problems, constitutes an accessible and stimulating invitation to research . . . Highly recommended.' - CHOICE'The author presents the field of ordered sets in an attractive way and the many open problems presented in the book are invaluable.[T]he book is a success, it presents an in depth and up to date carefully written coverage of ordered sets.' -SIGACT NEWS.

Taschenbuch. Etat : Neu. Ordered Sets | An Introduction with Connections from Combinatorics to Topology | Bernd Schröder | Taschenbuch | xvi | Englisch | 2018 | Springer | EAN 9783319806549 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Etat : Hervorragend. Zustand: Hervorragend | Seiten: 436 | Sprache: Englisch | Produktart: Bücher | The second edition of this highly praised textbook provides an expanded introduction to the theory of ordered sets and its connections to various subjects. Utilizing a modular presentation, the core material is purposely kept brief, allowing for the benefits of a broad exposure to the subject without the risk of overloading the reader with too much information all at once. The remaining chapters can then be read in almost any order, giving the text a greater depth and flexibility of use. Most topics are introduced by examining how they relate to research problems, some of them still open, allowing for continuity among diverse topics and encouraging readers to explore these problems further with research of their own. A wide range of material is presented, from classical results such as Dilworth's, Szpilrajn's, and Hashimoto's Theorems to more recent results such as the Li-Milner Structure Theorem. Major topics covered include chains and antichains, lowest upper and greatest lower bounds, retractions, algorithmic approaches, lattices, the dimension of ordered sets, interval orders, lexicographic sums, products, enumeration, and the role of algebraic topology. This new edition shifts the primary focus to finite ordered sets, with results on infinite ordered sets presented toward the end of each chapter whenever possible. Also new are Chapter 6 on graphs and homomorphisms, which serves to separate the fixed clique property from the more fundamental fixed simplex property as well as to discuss the connections and differences between graph homomorphisms and order-preserving maps, and an appendix on discrete Morse functions and their use for the fixed point property for ordered sets. Rich in examples, diagrams, and exercises, the second edition of Ordered Sets will be an excellent text for undergraduate and graduate students and a valuable resource for interested researchers. It will be especially useful to those looking for an introduction to the theory of ordered sets and its connections to such areas as algebraic topology, analysis, and computer science.PRAISE FOR THE FIRST EDITION "The author has done the field a service by producing an excellent text strong in the presentation of certain topological aspects of the underlying diagrams, e.g., which should serve the developing community and field well and which can be recommended without reservations as one of the volumes which should grace a poseteer's library whether she is interested only or mainly in the theory of these objects or has directed her gaze towards applications. As a sourcebook of ideas and understanding it will make its mark. And deservedly so." ¿ ZENTRALBLATT MATH ¿¿A gem. Undergraduate mathematics and computer science majors will find the first chapters offering background that will serve them well in many courses. The rest of the book, which features many open problems, constitutes an accessible and stimulating invitation to research . . . Highly recommended." ¿ CHOICE ¿The author presents the field of ordered sets in an attractive way and the many open problems presented in the book are invaluable.[T]he book is a success, it presents an in depth and up to date carefully written coverage of ordered sets." ¿SIGACT NEWS.

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The second edition of this highly praised textbook provides an expanded introduction to the theory of ordered sets and its connections to various subjects. Utilizing a modular presentation, the core material is purposely kept brief, allowing for the benefits of a broad exposure to the subject without the risk of overloading the reader with too much information all at once. The remaining chapters can then be read in almost any order, giving the text a greater depth and flexibility of use. Most topics are introduced by examining how they relate to research problems, some of them still open, allowing for continuity among diverse topics and encouraging readers to explore these problems further with research of their own.A wide range of material is presented, from classical results such as Dilworth's, Szpilrajn's, and Hashimoto's Theorems to more recent results such as the Li-Milner Structure Theorem. Major topics covered include chains and antichains, lowest upper and greatest lower bounds, retractions, algorithmic approaches, lattices, the dimension of ordered sets, interval orders, lexicographic sums, products, enumeration, and the role of algebraic topology. This new edition shifts the primary focus to finite ordered sets, with results on infinite ordered sets presented toward the end of each chapter whenever possible. Also new are Chapter 6 on graphs and homomorphisms, which serves to separate the fixed clique property from the more fundamental fixed simplex property as well as to discuss the connections and differences between graph homomorphisms and order-preserving maps, and an appendix on discrete Morse functions and their use for the fixed point property for ordered sets.Rich in examples, diagrams, and exercises, the second edition of Ordered Sets will be an excellent text for undergraduate and graduate students and a valuable resource for interested researchers. It will be especially useful to those looking for an introduction to the theory of ordered sets and its connections to such areas as algebraic topology, analysis, and computer science.PRAISE FOR THE FIRST EDITION'The author has done the field a service by producing an excellent text strong in the presentation of certain topological aspects of the underlying diagrams, e.g., which should serve the developing community and field well and which can be recommended without reservations as one of the volumes which should grace a poseteer's library whether she is interested only or mainly in the theory of these objects or has directed her gaze towards applications. As a sourcebook of ideas and understanding it will make its mark. And deservedly so.' - ZENTRALBLATT MATH'.A gem. Undergraduate mathematics and computer science majors will find the first chapters offering background that will serve them well in many courses. The rest of the book, which features many open problems, constitutes an accessible and stimulating invitation to research . . . Highly recommended.' - CHOICE'The author presents the field of ordered sets in an attractive way and the many open problems presented in the book are invaluable.[T]he book is a success, it presents an in depth and up to date carefully written coverage of ordered sets.' -SIGACT NEWS.

Hardcover. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

hardcover. Etat : Very Good. Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Etat : New. pp. 420 This item is printed on demand.

Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Etat : New. Print on Demand pp. 324 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

Etat : New. Print on Demand pp. 324.

Etat : New. PRINT ON DEMAND pp. 324.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In combinatorial mathematics, an ordered partition O of a set S is a sequence A1, A2, A3, ., An of subsets of S, with union is S, which are non-empty, and pairwise disjoint. This differs from a partition of a set, in that the order of the Ai matters.Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria (as in combinatorial designs and matroid theory), finding 'largest', 'smallest', or 'optimal' objects (extremal combinatorics and combinatorial optimization), and studying combinatorial structures arising in an algebraic context, or applying algebraic techniques to combinatorial problems (algebraic combinatorics).