Projective Equivalence for the Roots of Unity

Abstract

Let μ∞⊂eqC be the collection of roots of unity and Cn:=\(s1,·s,sn)∈μ∞n:si≠ sj for any 1≤ i<j≤ n\. Two elements (s1,·s,sn) and (t1,·s,tn) of Cn are said to be projectively equivalent if there exists γ∈PGL(2,C) such that γ(si)=ti for any 1≤ i≤ 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 14.

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…