Author: Egbert Harzheim
Publisher: Springer Science & Business Media
ISBN: 0387242198
Category : Mathematics
Languages : en
Pages : 391
Book Description
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.
Ordered Sets
Author: Egbert Harzheim
Publisher: Springer Science & Business Media
ISBN: 0387242198
Category : Mathematics
Languages : en
Pages : 391
Book Description
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.
Publisher: Springer Science & Business Media
ISBN: 0387242198
Category : Mathematics
Languages : en
Pages : 391
Book Description
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.
Ordered Sets
Author: Bernd Schröder
Publisher: Birkhäuser
ISBN: 3319297880
Category : Mathematics
Languages : en
Pages : 426
Book Description
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.
Publisher: Birkhäuser
ISBN: 3319297880
Category : Mathematics
Languages : en
Pages : 426
Book Description
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.
Ordered Sets
Author: Bernd Schröder
Publisher: Springer Science & Business Media
ISBN: 1461200539
Category : Mathematics
Languages : en
Pages : 401
Book Description
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.
Publisher: Springer Science & Business Media
ISBN: 1461200539
Category : Mathematics
Languages : en
Pages : 401
Book Description
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.
Lattices and Ordered Sets
Author: Steven Roman
Publisher: Springer Science & Business Media
ISBN: 0387789014
Category : Mathematics
Languages : en
Pages : 307
Book Description
This book is intended to be a thorough introduction to the subject of order and lattices, with an emphasis on the latter. It can be used for a course at the graduate or advanced undergraduate level or for independent study. Prerequisites are kept to a minimum, but an introductory course in abstract algebra is highly recommended, since many of the examples are drawn from this area. This is a book on pure mathematics: I do not discuss the applications of lattice theory to physics, computer science or other disciplines. Lattice theory began in the early 1890s, when Richard Dedekind wanted to know the answer to the following question: Given three subgroups EF , and G of an abelian group K, what is the largest number of distinct subgroups that can be formed using these subgroups and the operations of intersection and sum (join), as in E?FßÐE?FÑ?GßE?ÐF?GÑ and so on? In lattice-theoretic terms, this is the number of elements in the relatively free modular lattice on three generators. Dedekind [15] answered this question (the answer is #)) and wrote two papers on the subject of lattice theory, but then the subject lay relatively dormant until Garrett Birkhoff, Oystein Ore and others picked it up in the 1930s. Since then, many noted mathematicians have contributed to the subject, including Garrett Birkhoff, Richard Dedekind, Israel Gelfand, George Grätzer, Aleksandr Kurosh, Anatoly Malcev, Oystein Ore, Gian-Carlo Rota, Alfred Tarski and Johnny von Neumann.
Publisher: Springer Science & Business Media
ISBN: 0387789014
Category : Mathematics
Languages : en
Pages : 307
Book Description
This book is intended to be a thorough introduction to the subject of order and lattices, with an emphasis on the latter. It can be used for a course at the graduate or advanced undergraduate level or for independent study. Prerequisites are kept to a minimum, but an introductory course in abstract algebra is highly recommended, since many of the examples are drawn from this area. This is a book on pure mathematics: I do not discuss the applications of lattice theory to physics, computer science or other disciplines. Lattice theory began in the early 1890s, when Richard Dedekind wanted to know the answer to the following question: Given three subgroups EF , and G of an abelian group K, what is the largest number of distinct subgroups that can be formed using these subgroups and the operations of intersection and sum (join), as in E?FßÐE?FÑ?GßE?ÐF?GÑ and so on? In lattice-theoretic terms, this is the number of elements in the relatively free modular lattice on three generators. Dedekind [15] answered this question (the answer is #)) and wrote two papers on the subject of lattice theory, but then the subject lay relatively dormant until Garrett Birkhoff, Oystein Ore and others picked it up in the 1930s. Since then, many noted mathematicians have contributed to the subject, including Garrett Birkhoff, Richard Dedekind, Israel Gelfand, George Grätzer, Aleksandr Kurosh, Anatoly Malcev, Oystein Ore, Gian-Carlo Rota, Alfred Tarski and Johnny von Neumann.
Abelian Groups and Representations of Finite Partially Ordered Sets
Author: David Arnold
Publisher: Springer Science & Business Media
ISBN: 1441987509
Category : Mathematics
Languages : en
Pages : 256
Book Description
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.
Publisher: Springer Science & Business Media
ISBN: 1441987509
Category : Mathematics
Languages : en
Pages : 256
Book Description
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.
Ordered Sets
Author: Egbert Harzheim
Publisher: Springer Science & Business Media
ISBN: 0387242228
Category : Mathematics
Languages : en
Pages : 391
Book Description
This detailed textbook presents a great deal of material on ordered sets not previously published in the still rather limited textbook literature. It should be suitable as a text for a course on order theory.
Publisher: Springer Science & Business Media
ISBN: 0387242228
Category : Mathematics
Languages : en
Pages : 391
Book Description
This detailed textbook presents a great deal of material on ordered sets not previously published in the still rather limited textbook literature. It should be suitable as a text for a course on order theory.
Fixed Point Theory in Ordered Sets and Applications
Author: Siegfried Carl
Publisher: Springer Science & Business Media
ISBN: 1441975853
Category : Mathematics
Languages : en
Pages : 482
Book Description
This monograph provides a unified and comprehensive treatment of an order-theoretic fixed point theory in partially ordered sets and its various useful interactions with topological structures. The material progresses systematically, by presenting the preliminaries before moving to more advanced topics. In the treatment of the applications a wide range of mathematical theories and methods from nonlinear analysis and integration theory are applied; an outline of which has been given an appendix chapter to make the book self-contained. Graduate students and researchers in nonlinear analysis, pure and applied mathematics, game theory and mathematical economics will find this book useful.
Publisher: Springer Science & Business Media
ISBN: 1441975853
Category : Mathematics
Languages : en
Pages : 482
Book Description
This monograph provides a unified and comprehensive treatment of an order-theoretic fixed point theory in partially ordered sets and its various useful interactions with topological structures. The material progresses systematically, by presenting the preliminaries before moving to more advanced topics. In the treatment of the applications a wide range of mathematical theories and methods from nonlinear analysis and integration theory are applied; an outline of which has been given an appendix chapter to make the book self-contained. Graduate students and researchers in nonlinear analysis, pure and applied mathematics, game theory and mathematical economics will find this book useful.
Linear Representations of Partially Ordered Sets and Vector Space Categories
Author: Daniel Simson
Publisher: CRC Press
ISBN: 9782881248283
Category : Mathematics
Languages : en
Pages : 516
Book Description
This volume provides an elementary yet comprehensive introduction to representations of partially ordered sets and bimodule matrix problems, and their use in representation theory of algebras. It includes a discussion of representation types of algebras and partially ordered sets. Various characterizations of representation-finite and representation-tame partially ordered sets are offered and a description of their indecomposable representations is given. Auslander-Reiten theory is demonstrated together with a computer accessible algorithm for determining in decomposable representations and the Auslander-Reiten quiver of any representation-finite partially ordered set.
Publisher: CRC Press
ISBN: 9782881248283
Category : Mathematics
Languages : en
Pages : 516
Book Description
This volume provides an elementary yet comprehensive introduction to representations of partially ordered sets and bimodule matrix problems, and their use in representation theory of algebras. It includes a discussion of representation types of algebras and partially ordered sets. Various characterizations of representation-finite and representation-tame partially ordered sets are offered and a description of their indecomposable representations is given. Auslander-Reiten theory is demonstrated together with a computer accessible algorithm for determining in decomposable representations and the Auslander-Reiten quiver of any representation-finite partially ordered set.
Combinatorics and Partially Ordered Sets
Author: William T. Trotter
Publisher: Johns Hopkins University Press
ISBN: 9780801869778
Category : Mathematics
Languages : en
Pages : 0
Book Description
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.
Publisher: Johns Hopkins University Press
ISBN: 9780801869778
Category : Mathematics
Languages : en
Pages : 0
Book Description
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.
Finite Ordered Sets
Author: Nathalie Caspard
Publisher: Cambridge University Press
ISBN: 1107080002
Category : Mathematics
Languages : en
Pages : 351
Book Description
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.
Publisher: Cambridge University Press
ISBN: 1107080002
Category : Mathematics
Languages : en
Pages : 351
Book Description
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.