Alex Kreitzberg #20: Yeah, I should have specified that I meant the subset with ordering.
Can we define a hierarchy of ordering within posets in order to make a totally ordered set? So given a poset made up of two types of objects, one letters and …
One example of a monotone map would the simple substitution cipher mapping letters to numbers, so given \( (A,\le_A) \)= ({a,b, ... , z}, alphabetical order ) and \( (B,\le_B) \) = ({1,2, ... , 26}, numerical order), then the monotone map from \(A\)…
So, can we compare posets to other posets? So, if all corresponding comparable subsets of one poset are equal to the other then can we say the two posets are equal?
So, this is a bit of a dumb question but I'm trying to understand why it's called a "partially ordered set" and not just an "ordered set," so according to old, handy Wikipedia/Partially ordered set:
the word "partial" in the names "partial order…
Thanks, very interesting! Not sure formally, but I usually think of Information Retrieval as a complimentary approach to Databases where IR is usually dealing with unstructured data and Databases are usually dealing with structured relationships. Us…