Sciweavers

3928 search results - page 24 / 786
» order 2006
Sort
View
ORDER
2006
97views more  ORDER 2006»
13 years 9 months ago
Chain Dominated Orders
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampo...
ORDER
2007
89views more  ORDER 2007»
13 years 9 months ago
On-line Chain Partitioning of Up-growing Interval Orders
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
Patrick Baier, Bartlomiej Bosek, Piotr Micek
JSYML
2002
66views more  JSYML 2002»
13 years 9 months ago
Open Questions in The Theory of Spaces of Orderings
f orderings provide an abstract framework in which to study spaces of orderings of formally real fields. Spaces of orderings of finite chain length are well understood [9] [12]. Th...
Murray A. Marshall
MLQ
2010
124views more  MLQ 2010»
13 years 8 months ago
Countably categorical coloured linear orders
Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical coloured linear orders, generalizing Rosenstein’s characterization of ℵ0-categorica...
Feresiano Mwesigye, John K. Truss
ORDER
2006
99views more  ORDER 2006»
13 years 9 months ago
Countably Complementable Linear Orderings
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L do...
Antonio Montalbán