Efficient packing of unit squares in a square.
Kearney, Michael J., Shiu, Peter (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The compound of three octahedra and a remarkable compound of three square dipyramids, the Escher's solid”
Efficient packing of unit squares in a square.
Tiling proofs of some formulas for the Pell numbers of odd index.
Shattuck, Mark (2009)
Integers
Similarity:
On the completion of incomplete latin squares.
R. Dacic (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Lucas' square pyramid problem revisited
Michael A. Bennett (2002)
Acta Arithmetica
Similarity:
Determinants of Latin squares of order 8.
Ford, David, Johnson, Kenneth W. (1996)
Experimental Mathematics
Similarity:
On biembeddings of Latin squares.
Grannell, M.J., Griggs, T.S., Knor, M. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The disjoint -flower intersection problem for Latin squares.
Lefevre, James G., McCourt, Thomas A. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Atomic Latin squares based on cyclotomic orthomorphisms.
Wanless, Ian M. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tiling a -board with squares and dominoes.
Katz, Matt, Stenson, Catherine (2009)
Journal of Integer Sequences [electronic only]
Similarity:
On-line Packing Squares into n Unit Squares
Janusz Januszewski (2010)
Bulletin of the Polish Academy of Sciences. Mathematics
Similarity:
If n ≥ 3, then any sequence of squares of side lengths not greater than 1 whose total area does not exceed ¼(n+1) can be on-line packed into n unit squares.
Packing unit squares in a rectangle.
Nagamochi, Hiroshi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Latin squares of order 10.
McKay, Brendan D., Rogoyski, Eric (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity: