English

Projective Equivalence for the Roots of Unity

Number Theory 2022-06-28 v1 Combinatorics

Abstract

Let μC\mu_{\infty}\subseteq\mathbb{C} be the collection of roots of unity and Cn:={(s1,,sn)μn:sisj for any 1i<jn}\mathcal{C}_{n}:=\{(s_{1},\cdots,s_{n})\in\mu_{\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)\gamma\in\text{PGL}(2,\mathbb{C}) such that γ(si)=ti\gamma(s_{i})=t_{i} for any 1in1\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.

Keywords

Cite

@article{arxiv.1905.01510,
  title  = {Projective Equivalence for the Roots of Unity},
  author = {Hang Fu},
  journal= {arXiv preprint arXiv:1905.01510},
  year   = {2022}
}