Classifying orbits of the affine group over the integers

Abstract

For each n=1,2,…, let GL(n,Z) Zn be the affine group over the integers. For every point x=(x1,…,xn) ∈ Rn let orb(x)=\γ(x)∈ Rnγ∈ GL(n,Z) Zn\. Let Gx be the subgroup of the additive group R generated by x1,…,xn, 1. If rank(Gx)≠ n then orb(x)=\y∈Rn Gy=Gx\. Thus,Gx is a complete classifier of orb(x). By contrast, if rank(Gx)=n, knowledge of Gx alone is not sufficient in general to uniquely recover orb(x): as a matter of fact, Gx determines precisely max(1,φ(d)2) different orbits, where d is the denominator of the smallest positive nonzero rational in Gx, and φ is Euler function. To get a complete classification, rational polyhedral geometry provides an integer 1≤ cx≤ max(1,d/2) such that orb(y)=orb(x) iff (Gx,cx)=(Gy,cy).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…