pith. sign in

arxiv: 1206.5477 · v2 · pith:ZTLKECF3new · submitted 2012-06-24 · 🧮 math.CO

Kronecker covers, V-construction, unit-distance graphs and isometric point-circle configurations

classification 🧮 math.CO
keywords configurationsv-constructionadmissiblefirst-neighboursgraphsisometrickroneckerpoint-circle
0
0 comments X
read the original abstract

We call a polytope P of dimension 3 admissible if it has the following two properties: (1) for each vertex of P the set of its first-neighbours is coplanar; (2) all planes determined by the first-neighbours are distinct. It is shown that the Levi graph of a point-plane configuration obtained by V-construction from an admissible polytope P is the Kronecker cover of its 1-skeleton. We investigate the combinatorial nature of the V-construction and use it on unit-distance graphs to construct novel isometric point-circle configurations. In particular, we present an infinite series whose all members are subconfigurations of the renowned Clifford configurations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.