8 search results - page 1 / 2 » On a poset of trees |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
ACS
2008
13 years 5 months ago
2008
We show that the Priestley sum of finite trees contains no cyclic finite poset.
COMBINATORICA
2010
13 years 2 months ago
2010
JCT
1998
13 years 5 months ago
1998
If P is an upper semilattice whose Hasse diagram is a tree and whose cartesian powers are Macaulay, it is shown that Hasse diagram of P is actually a spider in which all the legs ...
DAM
2008
13 years 5 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...