Poset extensions, convex sets, and semilattice presentations
نویسندگان
چکیده
منابع مشابه
Modeling Poset Convex Subsets
A subset S of a poset (partially ordered set) is convex if and only if S contains every poset element which is between any two elements in S. Poset convex subsets arise in applications that involve precedence constraints, such as in project scheduling, production planning, and assembly line balancing. We give a strongly polynomial time algorithm which, given a poset and element weights (of arbi...
متن کاملExtensions of convex and semiconvex functions and intervally thin sets
We call A ⊂ RN intervally thin if for all x, y ∈ RN and ε > 0 there exist x′ ∈ B(x, ε), y′ ∈ B(y, ε) such that [x′, y′] ∩ A = ∅. Closed intervally thin sets behave like sets with measure zero (for example such a set cannot ”disconnect” an open connected set). Let us also mention that if the (N − 1)-dimensional Hausdorff measure of A is zero, then A is intervally thin. A function f is preconvex ...
متن کاملLinear extensions and order-preserving poset partitions
We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving partitions) of a finite n-element poset P with n ≥ 3 is homotopy equivalent to a wedge of spheres of dimension n − 3. If P is connected, then the number of spheres is...
متن کاملAdjoint Semilattice and Minimal Brouwerian Extensions of a Hilbert Algebra*
Let A := (A,→, 1) be a Hilbert algebra. The monoid of all unary operations on A generated by operations αp : x → (p → x), which is actually an upper semilattice w.r.t. the pointwise ordering, is called the adjoint semilattice of A. This semilattice is isomorphic to the semilattice of finitely generated filters of A, it is subtractive (i.e., dually implicative), and its ideal lattice is isomorph...
متن کاملConvex Sets and Convex Combinations
Convexity is one of the most important concepts in a study of analysis. Especially, it has been applied around the optimization problem widely. Our purpose is to define the concept of convexity of a set on Mizar, and to develop the generalities of convex analysis. The construction of this article is as follows: Convexity of the set is defined in the section 1. The section 2 gives the definition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.09.021