Let S be a finite set of cardinality k. I consider subsets of S that I order by set inclusion. For any given k, this defines the partially ordered set S_k.
To a given partially ordered set P, I associate the smallest k such that P can be embedded in S_k (every element of P is paired with an element of S_k and the order is preserved).
What is this smallest k equal to? How efficiently can it be computed?
To get things started, there are a number of easy observations.
First, $k$ is bounded above by $|P|$, since you can map every $p$ in $P$ to the lower cone $\{q\in P\mid q\leq p\}$.
Second, $k$ is bounded below by the size of the longest chain in $P$ (minus one), since as you move up the chain, you must add at least one new element. This bound is clearly realized in any linear order, as well as in many nearly linear orders.
It is not true in general that $k$ need be bounded below by the size of the largest antichain in $P$, since $S_k$ can have antichains (families of pairwise incomparable subsets) larger than $k$. For example, in $S_4$, there are six subsets of size $2$, forming an antichain.
If $P$ is separative, then the optimal $k$ is bounded above by the number of minimal elements of $P$. The reason is that every node in a separative $P$ is determined the set of minimal elements below it. (Note, a partial order is separative, if whenever $q\not\leq p$, then there is $q'\leq p$ with $q$ and $q'$ incompatible, meaning that their lower cones are disjoint.) This case includes any Boolean algebra (with 0 removed), which amounts essentially to the $S_k$ themselves.
But I expect a much better answer is possible...
