Finite Ordered Sets

Author : Nathalie Caspard
Publisher : Cambridge University Press
ISBN 13 : 1107080002
Total Pages : 351 pages
Book Rating : 4.03/5 ( download)

DOWNLOAD NOW!

Download or read book Finite Ordered Sets written by Nathalie Caspard and published by Cambridge University Press. This book was released on 2012-01-26 with total page 351 pages. Available in PDF, EPUB and Kindle. Book excerpt: Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas. Beginning with definitions of key concepts and fundamental results (Dilworth's and Sperner's theorem, interval and semiorders, Galois connection, duality with distributive lattices, coding and dimension theory), the authors then present applications of these structures in fields such as preference modelling and aggregation, operational research and management, cluster and concept analysis, and data mining. Exercises are included at the end of each chapter with helpful hints provided for some of the most difficult examples. The authors also point to further topics of ongoing research.

Author : David Arnold
Publisher : Springer Science & Business Media
ISBN 13 : 1441987509
Total Pages : 256 pages
Book Rating : 4.01/5 ( download)

DOWNLOAD NOW!

Download or read book Abelian Groups and Representations of Finite Partially Ordered Sets written by David Arnold and published by Springer Science & Business Media. This book was released on 2012-11-14 with total page 256 pages. Available in PDF, EPUB and Kindle. Book excerpt: The theme of this book is an exposition of connections between representations of finite partially ordered sets and abelian groups. Emphasis is placed throughout on classification, a description of the objects up to isomorphism, and computation of representation type, a measure of when classification is feasible. David M. Arnold is the Ralph and Jean Storm Professor of Mathematics at Baylor University. He is the author of "Finite Rank Torsion Free Abelian Groups and Rings" published in the Springer-Verlag Lecture Notes in Mathematics series, a co-editor for two volumes of conference proceedings, and the author of numerous articles in mathematical research journals.

Author : Bernd Schröder
Publisher : Springer Science & Business Media
ISBN 13 : 1461200539
Total Pages : 401 pages
Book Rating : 4.36/5 ( download)

DOWNLOAD NOW!

Download or read book Ordered Sets written by Bernd Schröder and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 401 pages. Available in PDF, EPUB and Kindle. Book excerpt: An introduction to the basic tools of the theory of (partially) ordered sets such as visualization via diagrams, subsets, homomorphisms, important order-theoretical constructions and classes of ordered sets. Using a thematic approach, the author presents open or recently solved problems to motivate the development of constructions and investigations for new classes of ordered sets. The text can be used as a focused follow-up or companion to a first proof (set theory and relations) or graph theory course.

Author : Egbert Harzheim
Publisher : Springer Science & Business Media
ISBN 13 : 0387242198
Total Pages : 391 pages
Book Rating : 4.94/5 ( download)

DOWNLOAD NOW!

Download or read book Ordered Sets written by Egbert Harzheim and published by Springer Science & Business Media. This book was released on 2005-02-17 with total page 391 pages. Available in PDF, EPUB and Kindle. Book excerpt: The textbook literature on ordered sets is still rather limited. A lot of material is presented in this book that appears now for the first time in a textbook. Order theory works with combinatorial and set-theoretical methods, depending on whether the sets under consideration are finite or infinite. In this book the set-theoretical parts prevail. The book treats in detail lexicographic products and their connections with universally ordered sets, and further it gives thorough investigations on the structure of power sets. Other topics dealt with include dimension theory of ordered sets, well-quasi-ordered sets, trees, combinatorial set theory for ordered sets, comparison of order types, and comparibility graphs. Audience This book is intended for mathematics students and for mathemeticians who are interested in set theory. Only some fundamental parts of naïve set theory are presupposed. Since all proofs are worked out in great detail, the book should be suitable as a text for a course on order theory.

Author : Ian Anderson
Publisher : Courier Corporation
ISBN 13 : 9780486422572
Total Pages : 276 pages
Book Rating : 4.77/5 ( download)

DOWNLOAD NOW!

Download or read book Combinatorics of Finite Sets written by Ian Anderson and published by Courier Corporation. This book was released on 2002-01-01 with total page 276 pages. Available in PDF, EPUB and Kindle. Book excerpt: Among other subjects explored are the Clements-Lindström extension of the Kruskal-Katona theorem to multisets and the Greene-Kleitmen result concerning k-saturated chain partitions of general partially ordered sets. Includes exercises and solutions.

Author : Lothar Budach
Publisher :
ISBN 13 :
Total Pages : 172 pages
Book Rating : 4.61/5 ( download)

DOWNLOAD NOW!

Download or read book Algebraic and Topological Properties of Finite Partially Ordered Sets written by Lothar Budach and published by . This book was released on 1988 with total page 172 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Author : Daniel Gerbner
Publisher : CRC Press
ISBN 13 : 0429804113
Total Pages : 269 pages
Book Rating : 4.13/5 ( download)

DOWNLOAD NOW!

Download or read book Extremal Finite Set Theory written by Daniel Gerbner and published by CRC Press. This book was released on 2018-10-12 with total page 269 pages. Available in PDF, EPUB and Kindle. Book excerpt: Extremal Finite Set Theory surveys old and new results in the area of extremal set system theory. It presents an overview of the main techniques and tools (shifting, the cycle method, profile polytopes, incidence matrices, flag algebras, etc.) used in the different subtopics. The book focuses on the cardinality of a family of sets satisfying certain combinatorial properties. It covers recent progress in the subject of set systems and extremal combinatorics. Intended for graduate students, instructors teaching extremal combinatorics and researchers, this book serves as a sound introduction to the theory of extremal set systems. In each of the topics covered, the text introduces the basic tools used in the literature. Every chapter provides detailed proofs of the most important results and some of the most recent ones, while the proofs of some other theorems are posted as exercises with hints. Features: Presents the most basic theorems on extremal set systems Includes many proof techniques Contains recent developments The book’s contents are well suited to form the syllabus for an introductory course About the Authors: Dániel Gerbner is a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences in Budapest, Hungary. He holds a Ph.D. from Eötvös Loránd University, Hungary and has contributed to numerous publications. His research interests are in extremal combinatorics and search theory. Balázs Patkós is also a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences. He holds a Ph.D. from Central European University, Budapest and has authored several research papers. His research interests are in extremal and probabilistic combinatorics.

Author : Ian Anderson
Publisher : Courier Corporation
ISBN 13 : 0486143716
Total Pages : 276 pages
Book Rating : 4.12/5 ( download)

DOWNLOAD NOW!

Download or read book Combinatorics of Finite Sets written by Ian Anderson and published by Courier Corporation. This book was released on 2012-04-30 with total page 276 pages. Available in PDF, EPUB and Kindle. Book excerpt: Coherent treatment provides comprehensive view of basic methods and results of the combinatorial study of finite set systems. The Clements-Lindstrom extension of the Kruskal-Katona theorem to multisets is explored, as is the Greene-Kleitman result concerning k-saturated chain partitions of general partially ordered sets. Connections with Dilworth's theorem, the marriage problem, and probability are also discussed. Each chapter ends with a helpful series of exercises and outline solutions appear at the end. "An excellent text for a topics course in discrete mathematics." — Bulletin of the American Mathematical Society.

Author : Robert D. Carmichael
Publisher :
ISBN 13 :
Total Pages : 0 pages
Book Rating : 4.09/5 ( download)

DOWNLOAD NOW!

Download or read book Introduction to the Theory of Groups of Finite Order written by Robert D. Carmichael and published by . This book was released on 1956 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Author :
Publisher : American Mathematical Soc.
ISBN 13 : 9780821895887
Total Pages : 262 pages
Book Rating : 4.85/5 ( download)

DOWNLOAD NOW!

Download or read book Ordered Sets and Lattices II written by and published by American Mathematical Soc.. This book was released on with total page 262 pages. Available in PDF, EPUB and Kindle. Book excerpt: This indispensable reference source contains a wealth of information on lattice theory. The book presents a survey of virtually everything published in the fields of partially ordered sets, semilattices, lattices, and Boolean algebras that was reviewed in Referativnyi Zhurnal Matematika from mid-1982 to the end of 1985. A continuation of a previous volume (the English translation of which was published by the AMS in 1989, as volume 141 in Translations - Series 2), this comprehensive work contains more than 2200 references. Many of the papers covered here were originally published in virtually inaccessible places. The compilation of the volume was directed by Milan Kolibiar of Comenius University at Bratislava and Lev A. Skornyakov of Moscow University. Of interest to mathematicians, as well as to philosophers and computer scientists in certain areas, this unique compendium is a must for any mathematical library.