Complete and computable orbit invariants in the geometry of the affine group over the integers (Q2196663): Difference between revisions

The subject matter of this paper is the geometry of the affine group over the integers,\(\mathrm{GL}(n,\mathbb Z)\ltimes \mathbb Z^{n}\). Turing-computable complete \(\mathrm{GL}(n,\mathbb Z)\ltimes \mathbb Z^{n}\)-orbit invariants are constructed for rational affine spaces, angles, segments, triangles and ellipses. In rational affine \(\mathrm{GL}(n,\mathbb Q)\ltimes \mathbb Q^{n}\)-geometry, ellipses are classified by the Clifford-Hasse-Witt invariant, via the Hasse-Minkowski theorem. They classify ellipses in \(\mathrm{GL}(n,\mathbb Z)\ltimes \mathbb Z^{n}\)-geometry combining results by Apollonius of Perga and Pappus of Alexandria with the Hirzebruch-Jung continued fraction algorithm. They then consider rational polyhedra, i.e., finite unions of simplexes in \(\mathbb{R}^{n}\) with rational vertices. Markov's unrecognizability theorem for combinatorial manifolds states the undecidability of the problem whether two rational polyhedra \(P\) and \(P^{\prime }\) are continuously \(\mathrm{GL}(n,\mathbb Q)\ltimes \mathbb Q^{n}\)-equidissectable. The same problem for the continuous \(\mathrm{GL}(n,\mathbb Z)\ltimes \mathbb Z^{n}\)-equidissectability of \(P\) and \(P^{\prime }\) is open. They prove the decidability of the problem whether two rational polyhedra \(P\) and \(P^{\prime }\) in \(\mathbb{R}\) have the same \(\mathrm{GL}(n,\mathbb Z)\ltimes \mathbb Z^{n}\)-orbit.