On crossings of hyperplanes on the \(n\)-dimensional torus (Q1359014)

In 1988, \textit{P. M. Salzberg} [Tomography in projective spaces: A heuristic for limited angle reconstructive models, SIAM J. Matrix Anal. Appl. 9, No. 3, , 393-398 (1988; Zbl 0651.65094)] proposed a new model for CT-scan (Computerized Tomography scan), the so-called heuristic for limited angle reconstructive models, based on a complete set of orthogonal Latin squares \(M^k={({m^k}_{ij})}_{p\times p}\) of prime order \(p\), defined by \({m^k}_{ij}\equiv i+kj\pmod p\), \(0\leq k\leq p-1\), and \({m^p}_{ij}=j\). Correspondently, in the projective plane \(\text{PG} (2,p)\), each such Latin square represents a family of parallel lines \(x+ky=a\), \(0\leq a\leq p-1\), if \(0\leq k\leq p\), and a family of parallel lines \(y=a\), \(0\leq a\leq p-1\), if \(k=p\). Each line \(x+ky=a\) in \(\text{PG} (2,p)\) corresponds in Euclidean space to a set of line segments on the \(2\)-dimensional torus \([0,1)\times [0,1)\). Such line segments are called the lines of the torus and the resulting geometry is called the overlapping geometry. The problem is to determine the pattern of crossing among the lines of the overlapping geometry. The case of the \(2\)-dimensional torus is almost solved, as well as the case of lines on the \(n\)-dimensional torus. In the paper under review, the problem is solved for hyperplanes on the \(n\)-dimensional torus.