AbstractWe study optimal coverings of lattices associated with a given n -cube by frames ( = Hamming spheres of radius one) and extended frames under certain constraints, e.g., by constituting at the same time packings of the edge system in such finite lattices. These investigations also yield results on different types of packings and coverings of the n -cube by rectangular simplices whose vertices are taken from the vertex set of the cube
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
AbstractIn this paper we consider the problem of packing a set of d-dimensional congruent cubes into...
We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to dis...
AbstractWe study optimal coverings of lattices associated with a given n -cube by frames ( = Hamming...
We address the problem of covering ℝ n with congruent balls, while minimizing the number of balls th...
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...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
AbstractThe general problem of packing regions of n-dimensional space with shapes composed of unit c...
Let m = m (n) denote the smallest dimension m such that the vertices of the n-dimensional cube can b...
The sphere packing problem in dimension N asks for an arrangement of non-overlapping spheres of equa...
In this thesis, we study different kinds of packing problems. A packing is an arrangement of geometr...
AbstractWe consider sequential random packing of cubes z+[0,1]n with z∈1NZn into the cube [0,2]n and...
AbstractWe present a comprehensive survey of the theory of hypercube graphs. Basic properties relate...
This thesis explores several problems in discrete geometry, focusing on covering problems. We first ...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
AbstractIn this paper we consider the problem of packing a set of d-dimensional congruent cubes into...
We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to dis...
AbstractWe study optimal coverings of lattices associated with a given n -cube by frames ( = Hamming...
We address the problem of covering ℝ n with congruent balls, while minimizing the number of balls th...
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...
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping uni...
AbstractThe general problem of packing regions of n-dimensional space with shapes composed of unit c...
Let m = m (n) denote the smallest dimension m such that the vertices of the n-dimensional cube can b...
The sphere packing problem in dimension N asks for an arrangement of non-overlapping spheres of equa...
In this thesis, we study different kinds of packing problems. A packing is an arrangement of geometr...
AbstractWe consider sequential random packing of cubes z+[0,1]n with z∈1NZn into the cube [0,2]n and...
AbstractWe present a comprehensive survey of the theory of hypercube graphs. Basic properties relate...
This thesis explores several problems in discrete geometry, focusing on covering problems. We first ...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
AbstractIn this paper we consider the problem of packing a set of d-dimensional congruent cubes into...
We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to dis...