Papers
Topics
Authors
Recent
Search
2000 character limit reached

Classifying orbits of the affine group over the integers

Published 15 Mar 2014 in math.GR and math.MG | (1403.3827v1)

Abstract: For each $n=1,2,\dots$, let $\mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}n$ be the affine group over the integers. For every point $x=(x_1,\dots,x_n) \in \mathbb{R}n$ let $\mathrm{orb}(x)={\gamma(x)\in \mathbb{R}n\mid\gamma\in \mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}n}.$ Let $G_{x}$ be the subgroup of the additive group $\mathbb R$ generated by $x_1,\dots,x_n, 1$. If $\mathrm{rank}(G_x)\neq n$ then $\mathrm{orb}(x)={y\in\mathbb{R}n\mid G_y=G_x}$. Thus,$G_x$ is a complete classifier of $\mathrm{orb}(x)$. By contrast, if $\mathrm{rank}(G_x)=n$, knowledge of $G_x$ alone is not sufficient in general to uniquely recover $\mathrm{orb}(x)$: as a matter of fact, $G_x$ determines precisely $\mathrm{max}(1,\frac{\phi(d)}{2})$ different orbits, where $d$ is the denominator of the smallest positive nonzero rational in $G_x,$ and $\phi$ is Euler function. To get a complete classification, rational polyhedral geometry provides an integer $1\leq c_x\leq \mathrm{max}(1,d/2)$ such that $\mathrm{orb}(y)=\mathrm{orb}(x) $ iff $(G_{x},c_{x})=(G_{y},c_{{y}})$.

Authors (2)

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.

Collections

Sign up for free to add this paper to one or more collections.