Papers
Topics
Authors
Recent
Search
2000 character limit reached

Basic geometry of the affine group over Z

Published 3 Feb 2019 in math.DS | (1902.00971v1)

Abstract: The subject matter of this paper is the geometry of the affine group over the integers, GL(n,Z)⋉Z<sup>n\mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}<sup>n. Turing-computable complete GL(n,Z)⋉Z<sup>n\mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}<sup>n-orbit invariants are constructed for angles, segments, triangles and ellipses. In rational affine GL(n,Q)⋉Q<sup>n\mathsf{GL}(n,\mathbb Q)\ltimes \mathbb Q<sup>n-geometry, ellipses are classified by the Clifford--Hasse--Witt invariant, via the Hasse-Minkowski theorem. We classify ellipses in GL(n,Z)⋉Z<sup>n\mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}<sup>n-geometry combining results by Apollonius of Perga and Pappus of Alexandria with the Hirzebruch-Jung continued fraction algorithm and the Morelli-W\l odarczyk solution of the weak Oda conjecture on the factorization of toric varieties. We then consider {\it rational polyhedra}, i.e., finite unions of simplexes in R<sup>n\mathbb R<sup>n with rational vertices. Markov's unrecognizability theorem for combinatorial manifolds states the undecidability of the problem whether two rational polyhedra PP and $P&#39;$ are continuously GL(n,Q)⋉Q<sup>n\mathsf{GL}(n,\mathbb Q)\ltimes \mathbb Q<sup>n-equidissectable. The same problem for the continuous GL(n,Z)⋉Z<sup>n\mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}<sup>n-equi-dis-sect-ability of PP and $P&#39;$ is open. We prove the decidability of the problem whether two rational polyhedra P,QP,Q in R<sup>n\mathbb R<sup>n have the same GL(n,Z)⋉Z<sup>n\mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}<sup>n-orbit.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.