JCT
1998
13 years 7 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 ...
JCT
2000
13 years 7 months ago
2000
Let Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same length l (cf. Fig. 1). We show that for any n 1 the nth cartesian power of
DAM
2008
13 years 7 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...
ICFCA
2004
Springer
14 years 26 days ago
2004
Springer
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...