Resolvable

A balanced incomplete Block Design is called resolvable if there existsa Partition of its set of blocks into Parallel Classes, each of which in turn partitions the set . The partition is called a Resolution.

References

Abel, R. J. R. and Furino, S. C. ``Resolvable and Near Resolvable Designs.'' §I.6 in The CRC Handbook of Combinatorial Designs (Ed. C. J. Colbourn and J. H. Dinitz). Boca Raton, FL: CRC Press, pp. 4 and 87-94, 1996.

• Richardson's Theorem
• Richard's Paradox
• Ridders' Method
• Ridge
• Riemann-Christoffel Tensor
• Riemann Curve Theorem
• Riemann Differential Equation
• Riemann Function
• Riemann Hypothesis
• Riemannian Geometry
• Riemannian Geometry (Non-Euclidean)
• Riemannian Manifold
• Riemannian Metric
• Riemann Integral
• Riemann-Lebesgue Lemma
• Riemann-Mangoldt Function
• Riemann Mapping Theorem
• Riemann P-Differential Equation
• Riemann P-Series
• Riemann-Roch Theorem
• Riemann Series Theorem
• Riemann's Formula
• Riemann-Siegel Functions
• Riemann's Integral Theorem
• Riemann's Moduli Problem