Exact distributions for shapes of random triangles in convex sets

1985 ◽  
Vol 17 (02) ◽  
pp. 308-329 ◽  
Author(s):  
D. G. Kendall
Keyword(s):  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Direct Proof ◽  
Circular Disk ◽  
Compact Convex Set ◽  
Exact Evaluation ◽  
Exact Distributions ◽  
New Formula ◽  
Relevant Section

The paper starts with a simple direct proof that . A new formula is given for the shape-density for a triangle whose vertices are i.i.d.-uniform in a compact convex set K, and an exact evaluation of that shape-density is obtained when K is a circular disk. An (x, y)-diagram for an auxiliary shape-density is then introduced. When K = circular disk, it is shown that is virtually constant over a substantial region adjacent to the relevant section of the collinearity locus, large enough to contain the work-space for most collinearity studies, and particularly appropriate when the ‘strip’ method is used to assess near-collinearity.

Exact distributions for shapes of random triangles in convex sets

1985 ◽  
Vol 17 (2) ◽  
pp. 308-329 ◽  
Author(s):  
D. G. Kendall
Keyword(s):  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Direct Proof ◽  
Circular Disk ◽  
Compact Convex Set ◽  
Exact Evaluation ◽  
Exact Distributions ◽  
New Formula ◽  
Relevant Section

The paper starts with a simple direct proof that . A new formula is given for the shape-density for a triangle whose vertices are i.i.d.-uniform in a compact convex set K, and an exact evaluation of that shape-density is obtained when K is a circular disk. An (x, y)-diagram for an auxiliary shape-density is then introduced. When K = circular disk, it is shown that is virtually constant over a substantial region adjacent to the relevant section of the collinearity locus, large enough to contain the work-space for most collinearity studies, and particularly appropriate when the ‘strip’ method is used to assess near-collinearity.

Rates of convergence for random approximations of convex sets

1996 ◽  
Vol 28 (02) ◽  
pp. 384-393 ◽  
Author(s):  
Lutz Dümbgen ◽  
Günther Walther
Keyword(s):  
Convex Subset ◽  
Hausdorff Distance ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Almost Sure Convergence ◽  
Rates Of Convergence ◽  
Random Sets ◽  
Compact Convex Set

The Hausdorff distance between a compact convex set K ⊂ ℝd and random sets is studied. Basic inequalities are derived for the case of being a convex subset of K. If applied to special sequences of such random sets, these inequalities yield rates of almost sure convergence. With the help of duality considerations these results are extended to the case of being the intersection of a random family of halfspaces containing K.

scholarly journals Mazur's intersection property of balls for compact convex sets

1987 ◽  
Vol 35 (2) ◽  
pp. 267-274 ◽  
Author(s):  
J. H. M. Whitfield ◽  
V. Zizler
Keyword(s):  
Banach Space ◽  
Uniform Convergence ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Extreme Points ◽  
Intersection Property ◽  
Compact Sets ◽  
Compact Convex Set ◽  
Mazur's Intersection Property

We show that every compact convex set in a Banach space X is an intersection of balls provided the cone generated by the set of all extreme points of the dual unit ball of X* is dense in X* in the topology of uniform convergence on compact sets in X. This allows us to renorm every Banach space with transfinite Schauder basis by a norm which shares the mentioned intersection property.

A geometric characterization concerning compact, convex sets

1991 ◽  
Vol 109 (2) ◽  
pp. 351-361 ◽  
Author(s):  
Christopher J. Mulvey ◽  
Joan Wick Pelletier
Keyword(s):  
Normed Space ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Necessary And Sufficient Condition ◽  
Categorical Logic ◽  
Compact Convex Set ◽  
Necessary And Sufficient ◽  
Formal Statement

In this paper, we are concerned with establishing a characterization of any compact, convex set K in a normed space A in an arbitrary topos with natural number object. The characterization is geometric, not in the sense of categorical logic, but in the intuitive one, of describing any compact, convex set K in terms of simpler sets in the normed space A. It is a characterization of the compact, convex set in the sense that it provides a necessary and sufficient condition for an element of the normed space to lie within it. Having said this, we should immediately qualify our statement by stressing that this is the intuitive content of what is proved; the formal statement of the characterization is required to be in terms appropriate to the constructive context of the techniques used.

Weakly prime compact convex sets and uniform algebras

1977 ◽  
Vol 81 (2) ◽  
pp. 225-232 ◽  
Author(s):  
A. J. Ellis
Keyword(s):  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Uniform Algebra ◽  
Reduction Theory ◽  
Natural Analogue ◽  
Uniform Algebras ◽  
Compact Convex Set ◽  
Analytic Sets

1. Introduction. We introduce the notion of a weakly prime compact convex set, and we develop a reduction theory for spaces A(K). The notion is less restrictive in general than the prime compact convex sets of Chu, but gives a finer reduction than the Bishop and Silov decompositions forA(K) (12). The natural analogue for uniform algebras is related to the concept of weakly analytic sets due to Arenson, but unlike maximal weakly analytic sets the maximal weakly prime sets are always generalized peak sets; the uniform algebra can always be retrieved from the restrictions of the algebra to the maximal weakly prime sets.

scholarly journals Circumradius-diameter and width-inradius relations for lattice constrained convex sets

1999 ◽  
Vol 59 (1) ◽  
pp. 147-152 ◽  
Author(s):  
Poh Wah Awyong ◽  
Paul R. Scott
Keyword(s):  
Lattice Point ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Integer Lattice ◽  
Lattice Points ◽  
Compact Convex Set ◽  
Planar Convex ◽  
Rectangular Lattices

Let K be a planar, compact, convex set with circumradius R, diameter d, width w and inradius r, and containing no points of the integer lattice. We generalise inequalities concerning the ‘dual’ quantities (2R − d) and (w − 2r) to rectangular lattices. We then use these results to obtain corresponding inequalities for a planar convex set with two interior lattice points. Finally, we conjecture corresponding results for sets containing one interior lattice point.

Two Inequalities for Planar Convex Sets

1985 ◽  
Vol 28 (1) ◽  
pp. 60-66 ◽  
Author(s):  
George Tsintsifas
Keyword(s):  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Compact Convex Set ◽  
Planar Convex ◽  
Straight Lines

AbstractB. Grünbaum, J. N. Lillington and lately R. J. Gardner, S. Kwapien and D. P. Laurie have considered inequalities defined by three concurrent straight lines in the interior of a planar compact convex set. In this note we prove two elegant conjectures by R. J. Gardner, S. Kwapien and D. P. Laurie.

Convex Sets, Cantor Sets and a Midpoint Property

1976 ◽  
Vol 19 (4) ◽  
pp. 467-471 ◽  
Author(s):  
Harold Reiter
Keyword(s):  
Final Section ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Sufficient Conditions ◽  
Convex Polytope ◽  
One Dimensional ◽  
Higher Dimensional ◽  
Compact Convex Set ◽  
Necessary And Sufficient

It is well known that every point of the closed unit interval I can be expressed as the midpoint of two points of the Cantor ternary set D. See [2, p. 549] and [3, p. 105]. Regarding J as a one dimensional compact convex set, it seems natural to try to generalize the above result to higher dimensional convex sets. We prove in section 3 that every convex polytope K in Euclidean space Rd contains a topological copy C of D such that each point of K is expressible as a midpoint of two points of C. Also, we give necessary and sufficient conditions on a planar compact convex set for it to contain a copy of D with the midpoint property above. In the final section we prove a result on minimal midpoint sets.

The Embedding of Compact Convex Sets in Locally Convex Spaces

1978 ◽  
Vol 30 (03) ◽  
pp. 449-454 ◽  
Author(s):  
James W. Roberts
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorems ◽  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Locally Convex Spaces ◽  
Hausdorff Topological Vector Space ◽  
Compact Convex Set ◽  
Affine Functions ◽  
Locally Convex

In studying compact convex sets it is usually assumed that the compact convex set X is contained in a Hausdorff topological vector space L where the topology on X is the relative topology. Usually one assumes that L is locally convex. The reason for this is that most of the major theorems such as the Krein-Milman, Choquet-Bishop-de Leeuw, and most of the fixed point theorems require that there be enough continuous affine functions on X to separate points.

Tensor products of compact convex sets and Banach algebras

1978 ◽  
Vol 83 (3) ◽  
pp. 419-427 ◽  
Author(s):  
C. J. K. Batty
Keyword(s):  
Convex Sets ◽  
Convex Set ◽  
Compact Convex ◽  
Banach Algebras ◽  
Tensor Products ◽  
Unit Space ◽  
Compact Convex Set ◽  
Affine Functions ◽  
Left Annihilator ◽  
Order Unit Space

Alfsen and Andersen(2) defined the centre of the complete order-unit space A(K) associated with a compact convex set K to be the set of functions in A(K) which multiply with A(K) pointwise on the extreme boundary of K, thereby generalizing the concept of centres of C*-algebras. It is therefore possible to extend this definition to include the space A (K; B) of continuous affine functions of K into a Banach algebra B. Such spaces arise in the theory of weak tensor products E ⊗λB of B with a Banach space E, which may be embedded in A(K; B) where K is the unit ball of E* in the weak* topology. Andersen and Atkinson(4) considered multipliers in A(K; B) and showed that if B is unital, then the multipliers are precisely those functions which are continuous in the facial topology on the extreme boundary. It is shown here that this result extends to non-unital Banach algebras with trivial left annihilator.

Sign in / Sign up

Export Citation Format

Share Document