AbstractWe give a representation for [4]3 by circles in the plane. We also show that representing the Boolean lattice B6 by 4-spheres in R5 is equivalent to placing 26 − 2 points on the unit sphere in R5 such that certain distance requirements are satisfied. As a consequence of this result, there is no symmetric embedding of B6 by 4-spheres in R5
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
Our goal in this paper is to give a new estimate for the number of integer lattice points lying in a...
AbstractIf each four spheres in a set of five unit spheres in R3 have nonempty intersection, then al...
It is well known that if a planar order P is bounded, i.e. has only one minimum and one maximum, the...
AbstractLet Rn be euclidean n-space with a cartesian coordinate system in which O is the origin. Let...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
With a new method based on the notion of genetic algorithm and the explicit enumeration of orders, w...
Spherical circle planes are topological incidence geometries; one has a 2- sphere P and a collectio...
We give examples of monohedral tilings of the 2-dimensional sphere by quadrangles, three of whose ed...
AbstractGiven a partially ordered set P = (X, P), a function F which assigns to each x ∈ X a set F(x...
A spherical quadrangulation is an embedding of a graph G in the sphere in which each facial boundary...
Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so t...
The paper addresses the problem if the n-dimensional Euclidean space can be tiled with translated co...
AbstractThe number of visible (primitive) lattice points in the sphere of radius R is well approxima...
Abstract. In a previous paper ([10]) the second author showed that if M is a pseudomanifold with com...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
Our goal in this paper is to give a new estimate for the number of integer lattice points lying in a...
AbstractIf each four spheres in a set of five unit spheres in R3 have nonempty intersection, then al...
It is well known that if a planar order P is bounded, i.e. has only one minimum and one maximum, the...
AbstractLet Rn be euclidean n-space with a cartesian coordinate system in which O is the origin. Let...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
With a new method based on the notion of genetic algorithm and the explicit enumeration of orders, w...
Spherical circle planes are topological incidence geometries; one has a 2- sphere P and a collectio...
We give examples of monohedral tilings of the 2-dimensional sphere by quadrangles, three of whose ed...
AbstractGiven a partially ordered set P = (X, P), a function F which assigns to each x ∈ X a set F(x...
A spherical quadrangulation is an embedding of a graph G in the sphere in which each facial boundary...
Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so t...
The paper addresses the problem if the n-dimensional Euclidean space can be tiled with translated co...
AbstractThe number of visible (primitive) lattice points in the sphere of radius R is well approxima...
Abstract. In a previous paper ([10]) the second author showed that if M is a pseudomanifold with com...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
Our goal in this paper is to give a new estimate for the number of integer lattice points lying in a...
AbstractIf each four spheres in a set of five unit spheres in R3 have nonempty intersection, then al...
DOI
Add to ORKG