The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: What does this problem mean?
Replies: 1   Last Post: Jan 31, 2013 12:02 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ] Topics: [ Previous | Next ]

Posts: 132
Registered: 11/27/12
Re: What does this problem mean?
Posted: Jan 31, 2013 12:02 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

> "If |P| < infinity,
This is the crucial part. This says that P is a FINITE set. Yes, "partially ordered" is all you need because the condition is "if xsubi < xsubj, then i<j". If it were the other way around, "if i<j, then xsubi < xsubj", you would need a total order because the counting numbers are ordered.

All this is saying is that BECAUSE P IS FINITE, you can look through P, find its smallest members (a member, x, such that there is NO y in the set with y< x) and call it "xsub1" through "xsubi" in whatever order you want. Then look through the remaining members to find ITS smallest remaining members, put them nest in the list, in any order, etc.

> then its elements can be ordered
> xsub1,...,xsubn so that if xsubi < xsubj, then i<j
> Estimate the growth (with n) of the number of such
> orderings. Call such admissible."
> I think P is supposed to be a poset. Other than that
> I am not sure what the question is asking. Any help
> appreciated.
> Message was edited by: Alex

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.