Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T23:12:18.606Z Has data issue: false hasContentIssue false

A Packing Problem for Measurable Sets

Published online by Cambridge University Press:  20 November 2018

D. Sankoff
Affiliation:
Department of Mathematics, McGill University, Montreal, Quebec
D. A. Dawson
Affiliation:
Department of Mathematics, McGill University, Montreal, Quebec
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.

Given a probability measure space (Ω, , P) consider the following packing problem. What is the maximum number, b(K, Λ), of sets which may be chosen from so that each set has measure K and no two sets have intersection of measure larger than Λ < K?

In this paper the packing problem is solved for any non-atomic probability measure space. Rather than obtaining the solution explicitly, however, it is convenient to solve the following minimal paving problem. In a non-atomic a-finite measure space (Ω, , μ) what is the measure, V(b, K, Λ), of the smallest set which is the union of exactly b subsets of measure K such that no subsets have intersection of measure larger than Λ?

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1967