Facets with fewest vertices

Forv>d≧3, letm(v, d) be the smallest numberm, such that every convexd-polytope withv vertices has a facet with at mostm vertices. In this paper, bounds form(v, d) are found; in particular, for fixedd≧3, $$\frac{{r - 1}}{r} \leqslant \mathop {\lim \inf }\limits_{\upsilon \to \infty } \frac{{m(\upsilon ,d)}}{\upsilon } \leqslant \mathop {\lim \sup }\limits_{\upsilon \to \infty } \frac{{m(\upsilon ,d)}}{\upsilon } \leqslant \frac{{d - 3}}{{d - 2}}$$ , wherer=[1/3(d+1)].     

Rectangular convexity of convex domains of constant width

An E R ² is r-convex if for every x, y E there exists a closed rectangle R such that x, y R and R E. Several results about r-convexity appeared in [1]. Its authors formulated a conjecture about conditions for a compact, convex set in R ² to be r-convex. We prove this conjecture in the case of convex domains of constant width.     

The evaluation of Cauchy principal value integrals involving unknown poles

A method is described for the evaluation of a Cauchy principal value integral of the formf ₀ ^p f(t)dt, wheref is analytic in the interval [0,p] except at a simple pole at an unknown point in (0,p), with an unknown residue. The method is based on the trapezoidal rule.