English

Perpendicular dissections of space

Combinatorics 2010-01-26 v1

Abstract

For each pair (Qi,Qj)(Q_i,Q_j) of reference points and each real number rr there is a unique hyperplane hQiQjh \perp Q_iQ_j such that d(P,Qi)2d(P,Qj)2=rd(P,Q_i)^2 - d(P,Q_j)^2 = r for points PP in hh. Take nn reference points in dd-space and for each pair (Qi,Qj)(Q_i,Q_j) a finite set of real numbers. The corresponding perpendiculars form an arrangement of hyperplanes. We explore the structure of the semilattice of intersections of the hyperplanes for generic reference points. The main theorem is that there is a real, additive gain graph (this is a graph with an additive real number associated invertibly to each edge) whose set of balanced flats has the same structure as the intersection semilattice. We examine the requirements for genericity, which are related to behavior at infinity but remain mysterious; also, variations in the construction rules for perpendiculars. We investigate several particular arrangements with a view to finding the exact numbers of faces of each dimension. The prototype, the arrangement of all perpendicular bisectors, was studied by Good and Tideman, motivated by a geometric voting theory. Most of our particular examples are suggested by extensions of that theory in which voters exercise finer discrimination. Throughout, we propose many research problems.

Keywords

Cite

@article{arxiv.1001.4435,
  title  = {Perpendicular dissections of space},
  author = {Thomas Zaslavsky},
  journal= {arXiv preprint arXiv:1001.4435},
  year   = {2010}
}

Comments

45 pages, 10 figures. This is a post-publication version with an accidentally omitted reference (by Voronoi) restored

R2 v1 2026-06-21T14:39:02.960Z