Projective Equivalence for the Roots of Unity

preprint2019arXivOpen access

Abstract

Let μ∞⊆Cμ_{\infty}\subseteq\mathbb{C} be the collection of roots of unity and Cn:={(s1,⋯ ,sn)∈μ∞n:si≠sj for any 1≤i<j≤n}\mathcal{C}_{n}:=\{(s_{1},\cdots,s_{n})\inμ_{\infty}^{n}:s_{i}\neq s_{j}\text{ for any }1\leq i<j\leq n\}. Two elements (s1,⋯ ,sn)(s_{1},\cdots,s_{n}) and (t1,⋯ ,tn)(t_{1},\cdots,t_{n}) of Cn\mathcal{C}_{n} are said to be projectively equivalent if there exists γ∈PGL(2,C)γ\in\text{PGL}(2,\mathbb{C}) such that γ(si)=tiγ(s_{i})=t_{i} for any 1≤i≤n1\leq i\leq n. In this article, we will give a complete classification for the projectively equivalent pairs. As a consequence, we will show that the maximal length for the nontrivial projectively equivalent pairs is 1414.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.