I can indicate the type of refinement mentioned in the title by referring to Kirchberger's theorem [4]. Its picturesque form in the plane is: if sheep and goats are grazing in a field and for every four animals there exists a line separating the sheep from the goats then there exists such a line for all the animals. The refinement is that the words ‘every four animals’ may be replaced by ‘every four animals including an arbitraily chosen animal’; this reduces the ‘Kirchberger number’ from four to, effectively, three.
In a paper (1) by Harding there is a tacit invitation to seek the connection between the following two problems:(i) Find the number, t] k (N), of regions into which a Ar-dimensional space is partitioned by a set of N (k-l)-dimensional hyperplanes. (ii) Find the number, v k (N), of distinct partitions of a given set of N points in a ^-dimensional space E that can be induced by (k-l)-dimensional hyperplanes. Schlafli (2) solved the first problem and Harding (1) solved the second. I wish to show that the first problem can be expressed as a dual of the second and thus provide an alternative derivation of Harding's result.First, form the dual E, of E in the following way. Let the dual of a point u in E be the half-space V = {r | u . r ^ 1} of E; in particular let the dual of the origin of E be all of E. Let the dual of the half-space V={r\v.r£l) of E be the point v of E. Note that u 6 V^>v . u ^ l=>y e U, so incidence properties of points and half-spaces are preserved in the transformation. Now consider N points in E and place the origin at one of the points. The dual of the N points will be (JV-1) half-spaces and the whole space of E, dividing E into r\ k {N-1) regions, each expressible as an intersection I of some of the half-spaces and the complements of the remaining half-spaces.Let a (k -l)-dimensional hyperplane in E separate the N points into two parts-a set P containing the origin and another set P'. Let 8P denote the family of all half-spaces that contain P and are disjoint with i". The dual of 9 is a set 2P of points E; and each point of (P will belong to the intersection Ip of the half-spaces which are duals of points of P and the complements of the half-spaces which are duals of points of P'. Conversely any point of 1 P will be the dual of a half-space containing P but disjoint with P' and so must belong to &. It follows that 1 P is identical with &.We have therefore established a one-to-one correspondence between the partitions of the Af points and the regions defined by (N-1) half-spaces in E. It follows that
The purpose of this paper is to consider the question: if p is the probability that a player P will win a given rally against a player Q, what is the probability that P will win a given game? The answer, of course, depends upon the method of scoring; and the methods considered here will be those used in squash and, for comparison table tennis.In table tennis P earns a point each time that he wins a rally. But in squash he must serve the rally that he wins in order to gain a point; and he relinquishes the service when he loses a rally that he serves.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.