Sciweavers

ORDER
2006
97views more  ORDER 2006»
13 years 11 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
2006
105views more  ORDER 2006»
13 years 11 months ago
Descending Chains and Antichains of the Unary, Linear, and Monotone Subfunction Relations
The C-subfunction relations on the set of functions on a finite base set A defined by function classes C are examined. For certain clones C on A, it is determined whether the part...
Erkko Lehtonen
ORDER
2006
102views more  ORDER 2006»
13 years 11 months ago
Profinite Completions and Canonical Extensions of Heyting Algebras
Guram Bezhanishvili, Mai Gehrke, Ray Mines, Patric...
ORDER
2006
128views more  ORDER 2006»
13 years 11 months ago
Algebras Defined from Ordered Sets and the Varieties they Generate
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
Joel Berman, Willem J. Blok
ORDER
2006
97views more  ORDER 2006»
13 years 11 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood
ORDER
2006
99views more  ORDER 2006»
13 years 11 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
ORDER
2006
86views more  ORDER 2006»
13 years 11 months ago
Range of the Fractional Weak Discrepancy Function
Alan Shuchat, Randy Shull, Ann N. Trenk
ORDER
2006
154views more  ORDER 2006»
13 years 11 months ago
A Bipartite Analogue of Dilworth's Theorem
Let r be a fixed positive integer. It is shown that, given any partial orders >1, . . ., >r on the same n-element set P, there exist disjoint subsets A, B P, each with at l...
Jacob Fox