Sciweavers

80 search results - page 1 / 16
» Antichains in Products of Linear Orders
Sort
View
76
Voted
ORDER
2002
73views more  ORDER 2002»
14 years 9 months ago
Antichains in Products of Linear Orders
We show that: (1) For many regular cardinals (in particular, for all successors of singular strong limit cardinals, and for all successors of singular -limits), for all n {2, 3, ...
Martin Goldstern, Saharon Shelah
81
Voted
ORDER
2006
105views more  ORDER 2006»
14 years 10 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
JCT
2010
91views more  JCT 2010»
14 years 8 months ago
Lattice path matroids: The excluded minors
A lattice path matroid is a transversal matroid for which some antichain of intervals in some linear order on the ground set is a presentation. We characterize the minor-closed cla...
Joseph E. Bonin
65
Voted
JSYML
2006
86views more  JSYML 2006»
14 years 10 months ago
Degrees of monotone complexity
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
William C. Calhoun
91
Voted
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
14 years 9 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch