Chapter 7: Problem 7
Give an example of a poset with 5 minimal (maximal) elements but no least (greatest) element.
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 7: Problem 7
Give an example of a poset with 5 minimal (maximal) elements but no least (greatest) element.
All the tools & learning materials you need for study success - in one app.
Get started for free
If \(A=[1,2,3,4\\}\), give an example of a relation \(\mathscr{R}\) on \(A\) that is a) reflexive and symmetric, but not transitive b) reflexive and transitive, but not symmetric c) symmetric and transitive, but not reflexive
At the computer center Maria is faced with running 10 computer programs which, because of priorities, are restricted by the following conditions: (a) \(10>8,3\); (b) \(8>7\); (c) \(7>5\); (d) \(3>9,6 ;\) (e) \(6>4,1\); (f) \(9>4,5 ;\) (g) \(4,5,1>2\); where, for example, \(10>8,3\) means that program number 10 must be run before programs 8 and 3 . Determine an order for running these programs so that the priorities are satisfied.
How many of the equivalence relations on \(A=\) \(\\{a, b, c, d, e, f\\}\) have (a) exactly two equivalence classes of size 3 ? (b) exactly one equivalence class of size \(3 ?\) (c) one equivalence class of size \(4 ?\) (d) at least one equivalence class with three or more elements?
If the complete graph \(K_{n}\) has 703 edges, how many vertices. does it have?
Let \(A=\\{1,2,3,4,5,6,7,8\\}\). In how many ways can we partition \(A\) as \(A_{1} \cup A_{2} \cup A_{3}\) with a) \(1,2 \in A_{1}, 3,4 \in A_{2}\), and \(5,6,7 \in A_{3}\) ? b) \(1,2 \in A_{1}, 3,4 \in A_{2}, 5,6 \in A_{3}\), and \(\left|A_{1}\right|=3 ?\) c) \(1,2 \in A_{1}, 3,4 \in A_{2}\), and \(5,6 \in A_{3}\) ?
What do you think about this solution?
We value your feedback to improve our textbook solutions.