Geodesic
A Packing Problem for Measurable Sets
Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 749-756

Voir la notice de l'article provenant de la source Cambridge University Press

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 Λ? 
Sankoff, D.; Dawson, D. A. A Packing Problem for Measurable Sets. Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 749-756. doi: 10.4153/CJM-1967-068-x
@article{10_4153_CJM_1967_068_x,
     author = {Sankoff, D. and Dawson, D. A.},
     title = {A {Packing} {Problem} for {Measurable} {Sets}},
     journal = {Canadian journal of mathematics},
     pages = {749--756},
     year = {1967},
     volume = {19},
     number = {1},
     doi = {10.4153/CJM-1967-068-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-068-x/}
}
TY  - JOUR
AU  - Sankoff, D.
AU  - Dawson, D. A.
TI  - A Packing Problem for Measurable Sets
JO  - Canadian journal of mathematics
PY  - 1967
SP  - 749
EP  - 756
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-068-x/
DO  - 10.4153/CJM-1967-068-x
ID  - 10_4153_CJM_1967_068_x
ER  - 
%0 Journal Article
%A Sankoff, D.
%A Dawson, D. A.
%T A Packing Problem for Measurable Sets
%J Canadian journal of mathematics
%D 1967
%P 749-756
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-068-x/
%R 10.4153/CJM-1967-068-x
%F 10_4153_CJM_1967_068_x

[1] 1. Dantzig, G. B., “Formulating and solving linear programs,” Modern mathematics for the engineer, vol. 2 (New York, 1961). Google Scholar

[2] 2. Lorentz, G. G., Metric entropy and approximation, Bull. Amer. Math. Soc., 72 (1966), 903–937. Google Scholar

[3] 3. Ryser, H. J., Combinatorial mathematics, Carus Mathematical Monograph No. 14 (1963). Google Scholar

[4] 4. Spitzer, F., Principles of random walk (Princeton, 1964). Google Scholar

Cité par Sources :