Purchase Solution

Set Partitions : Coarseness and Fineness

Not what you're looking for?

Ask Custom Question

The meet of the partitions f1,...,fI is the finest partition that is coarser then each fi. The join of the partitions f1,...,fI is the coarsest partition that is finer than each fi. The meet of partitions is denoted and the join of partitions is denoted
I I
Λ fi (meet) V fi (join)
i = 1 i = 1

(a) If f1,...,fI represent the information of the different traders, what do the meet and join represent?

(b) For:
f1 = { {ω1},{ ω2, ω3, ω4},{ ω5, ω6, ω7} }
f2 = { {ω1, ω2, ω3},{ω4},{ ω5, ω6,},{ω7} }
compute the meet f1 Λ f2.

Attachments
Purchase this Solution
Solution Summary

Coarseness and finess of partitions is investigated. The solution is detailed and well presented. The response received a rating of "5/5" from the student who originally posted the question.

Solution Preview

The answers are written along with the questions, and explained in the attached Word file.

=======
The meet of the partitions f1,...,fI is the finest partition that is coarser then each fi. The join of the partitions f1,...,fI is the coarsest partition that is finer than each fi. The meet of partitions is denoted and the join of partitions is denoted
I I
Λ fi (meet) V fi (join)
i = 1 i = 1

(a) If f1,...,fI represent the ...

Purchase this Solution
Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Probability Quiz

Some questions on probability

View More Free Quizzes
Related BrainMass Solutions

  • Partitions of a Set

    122158 Partitions of a Set : Coarseness and Fineness Prove that if a partition g is finer than a partition f, then any union of sets of f is a union of sets of g. A partition of a set A is a family of subsets of A whose union is equal to A.

  • Partitions on a Set

    Therefore, we get Set partitions are investigated. The solution is detailed and well-presented.

  • Recurrence Relations : Stirling Numbers

    And there are 3 different ways to split 4 numbers into groups of 2 ( ab-cd, ac-bd, and ad-bc). Therefore there are 3*(n 4) partitions of type B. Type A and Type B together account for S_{n,n-2} = (n 3) + 3*(n 4) partitions.

  • Adaptation Experiments

    ., Results) Let's assume that you rated the coarseness 7 for the first exposure, and then, on the second exposure to the sandpaper, you rated the coarseness 4. And, on the third exposure, you rated the coarseness 2.

  • Psychology Experiments

    ., Results) Let's assume that you rated the coarseness 7 for the first exposure, and then, on the second exposure to the sandpaper, you rated the coarseness 4. And, on the third exposure, you rated the coarseness 2.

  • Set Partitions and Bit Strings

    150853 Set Partitions and Bit Strings Which of these collections of subsets are partitions on the set of bit strings of length 8?

  • Challenge problems based on combinatorics theory

    Note that there is not a simple explicit formula for the number of natural number partitions like there is for set partitions. This approach is called using a generating function and it's a very important approach in combinatorics. e.

  • Abstract Algebra : Mappings and Partitions

    the claim follows Mappings and partitions are investigated.

  • Equivalence relations and partitions

    232840 Equivalence Relations and Partitions See attached Let R be the relation on the set {1,2} defined by 2R2 and the relation R holds for no other ordered pair except the pair (2,2).

View More Related Solutions