AbstractIt is impossible to pack 3-space with cubes in such a way that no two neighbouring cubes are the same size and that no ball contains infinitely many of the cubes
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
In 1984, Stein and his co-authors posed a problem concerning simple three-dimensional shapes, known ...
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a ...
AbstractIn this paper it is shown that 3-space cannot be filled with cubes such that neighbouring cu...
AbstractIt is impossible to pack 3-space with cubes in such a way that no two neighbouring cubes are...
AbstractThe main result of the paper is the following: Suppose x1≥x2≥… are the sides of cubes in the...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
AbstractThe main result of the paper is the following: Suppose x1≥x2≥… are the sides of cubes in the...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractIn 1984, Stein and his co-authors posed a problem concerning simple three-dimensional shapes...
AbstractIn this paper it is shown that 3-space cannot be filled with cubes such that neighbouring cu...
AbstractMoser asked whether the collection of rectangles of dimensions 1×12, 12×13, 13×14, …, whose ...
AbstractWe study optimal coverings of lattices associated with a given n -cube by frames ( = Hamming...
A rectangular storage area orbin, of widthwand heighth, stores nonoverlapping square objects, of siz...
AbstractIn this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed i...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
In 1984, Stein and his co-authors posed a problem concerning simple three-dimensional shapes, known ...
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a ...
AbstractIn this paper it is shown that 3-space cannot be filled with cubes such that neighbouring cu...
AbstractIt is impossible to pack 3-space with cubes in such a way that no two neighbouring cubes are...
AbstractThe main result of the paper is the following: Suppose x1≥x2≥… are the sides of cubes in the...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
AbstractThe main result of the paper is the following: Suppose x1≥x2≥… are the sides of cubes in the...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractIn 1984, Stein and his co-authors posed a problem concerning simple three-dimensional shapes...
AbstractIn this paper it is shown that 3-space cannot be filled with cubes such that neighbouring cu...
AbstractMoser asked whether the collection of rectangles of dimensions 1×12, 12×13, 13×14, …, whose ...
AbstractWe study optimal coverings of lattices associated with a given n -cube by frames ( = Hamming...
A rectangular storage area orbin, of widthwand heighth, stores nonoverlapping square objects, of siz...
AbstractIn this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed i...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
In 1984, Stein and his co-authors posed a problem concerning simple three-dimensional shapes, known ...
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a ...
DOI
Add to ORKG