All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 9 Next

Displaying 161 – 180 of 212

Showing per page

Convexity in subsets of lattices.

Sergei V. Ovchinnikov (1980)

Stochastica

The notion of convex set for subsets of lattices in one particular case was introduced in [1], where it was used to study Paretto's principle in the theory of group choice. This notion is based on a betweenness relation due to Glivenko [2]. Betweenness is used very widely in lattice theory as basis for lattice geometry (see [3], and, especially [4 part 1]).In the present paper the relative notions of convexity are considered for subsets of an arbitrary lattice.In section 1 certain relative notions...

Convexity ranks in higher dimensions

Menachem Kojman (2000)

Fundamenta Mathematicae

A subset of a vector space is called countably convex if it is a countable union of convex sets. Classification of countably convex subsets of topological vector spaces is addressed in this paper. An ordinal-valued rank function ϱ is introduced to measure the complexity of local nonconvexity points in subsets of topological vector spaces. Then ϱ is used to give a necessary and sufficient condition for countable convexity of closed sets. Theorem. Suppose that S is a closed subset of a Polish linear...

Convexity theories 0 fin. Foundations.

Heinrich Kleisli, Helmut Röhrl (1996)

Publicacions Matemàtiques

In this paper we study big convexity theories, that is convexity theories that are not necessarily bounded. As in the bounded case (see [4]) such a convexity theory Γ gives rise to the category ΓC of (left) Γ-convex modules. This is an equationally presentable category, and we prove that it is indeed an algebraic category over Set. We also introduce the category ΓAlg of Γ-convex algebras and show that the category Frm of frames is isomorphic to the category of associative, commutative, idempotent...

Countably convex G δ sets

Vladimir Fonf, Menachem Kojman (2001)

Fundamenta Mathematicae

We investigate countably convex G δ subsets of Banach spaces. A subset of a linear space is countably convex if it can be represented as a countable union of convex sets. A known sufficient condition for countable convexity of an arbitrary subset of a separable normed space is that it does not contain a semi-clique [9]. A semi-clique in a set S is a subset P ⊆ S so that for every x ∈ P and open neighborhood u of x there exists a finite set X ⊆ P ∩ u such that conv(X) ⊈ S. For closed sets this condition...

Currently displaying 161 – 180 of 212