Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T21:16:17.117Z Has data issue: false hasContentIssue false

a-convexity

Published online by Cambridge University Press:  24 October 2008

R. G. E. Pinch
Affiliation:
Department of Mathematics, University of Glasgow
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For a ε R, we define a subset V of Rn to be a-convex if x, y ε V implies

Clearly V is (1 — a)-convex iff it is a-convex: V is convex iff it is a-convex for all a ε [0, 1], and any set is 1-convex. We define the a-convex hull of V to be the intersection of all a-convex subsets of Rn containing V. Put D = 0,1} and D(a) the a-convex hull of D in R1. If V is a-convex and x, y ε V, then V must contain the points of the line through x, y given by {tx + (1 — t) y: t ε D(a)} and so in this paper we concentrate on the study of D(a).

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1985