Tiling a rectangle with the fewest squares

Journal of Combinatorial Theory. Series A

Volumn 76, Issue 2, 1996, Pages 272-291

  Kenyon, Richard ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030295686     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1996.0104     Document Type: Article

References (8)

1. 1. P. Billingsley, "Ergodic Theory and Information," Wiley, New York, 1965.
2. 2. B. Bollobas, "Graph Theory: An Introductory Course," Springer-Verlag, New York, 1979.
3. 3. R. L. Brooks, C. A. B. Smith, A. H. Stone, and W. T. Tutte, The dissection of rectangles into squares, Duke Math J. 7 (1940), 312-340.
4. 4. R. Burton and R. Pemantle, Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances, Ann. Probab. 21 (1993), 1329-1371.
5. 5. M. Dehn, Zerlegung von Rechtecke in Rechtecken, Math. Ann. 57 (1903), 314-332.
6. 6. H. G. Diamond and J. D. Vaaler, Estimates for partial sums of continued fraction partial quotients, Pacific J. Math. 122 (1986), 73-82.
7. 7. M. Hall, On the sum and product of continued fractions, Ann. of Math. 48 (1947), 966-993.
8. 8. G. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilen galvanischer Ströme geführt wird, Ann. Phys. Chem. 72 (1847), 497-508.