Sciweavers

Share
JSYML
2010
129views more  JSYML 2010»
9 years 6 months ago
On changing cofinality of partially ordered sets
It is shown that under GCH every poset preserves its cofinality in any cofinality preserving extension. On the other hand, starting with measurable cardinals, a model with a part...
Moti Gitik
MST
2011
237views Hardware» more  MST 2011»
9 years 6 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson
ORDER
2008
61views more  ORDER 2008»
9 years 11 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
CORR
2007
Springer
104views Education» more  CORR 2007»
9 years 11 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
DM
2008
73views more  DM 2008»
9 years 12 months ago
On multipartite posets
Let m 2 be an integer. We say that a poset P = (X, ) is m-partite if X has a partition X = X1
Geir Agnarsson
books