English

On cubic polynomials with the cyclic Galois group

Number Theory 2024-01-23 v1

Abstract

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots x1,x2,x3x_1,x_2,x_3 (enumerated in some order) are real. There exists (and only one) quadratic polynomial qq with rational coefficients such that q(x1)=x2,q(x2)=x3,q(x3)=x1q(x_1)=x_2, q(x_2)=x_3, q(x_3)=x_1. The polynomial r=q(q) mod pr=q(q)\text{ mod } p cyclically permutes roots of pp in the opposite order: r(x1)=x3,r(x3)=x2,r(x2)=x1r(x_1)=x_3, r(x_3)=x_2, r(x_2)=x_1. We prove that there exist a unique Galois polynomial p1p_1 and a unique Galois polynomial p2p_2 such that the polynomial qq cyclically permutes roots of p1p_1 and the polynomial rr do the same with roots of p2p_2. Polynomials pp and p1p_1 (and also pp and p2p_2) will be called \emph{coupled}. Two polynomials are \emph{linear equivalent}, if one of them is obtained from another by a linear change of variable. By C(p)C(p) we denote the class of polynomials, linear equivalent to pp. The coupling realizes a bijection between classes C(p)C(p) and C(p1)C(p_1) (and between classes C(p)C(p) and C(p2)C(p_2)). Classes C(p)C(p) and C(p1)C(p_1) (and classes C(p)C(p) and C(p2)C(p_2)) will be called \emph{adjacent}. We consider a graph: its vertices -- are classes of the linear equivalency and two vertices are connected by an edge, if the corresponded classes are adjacent. Connected components of this graph will be called \emph{superclasses}. In this work we give a description of superclasses.

Keywords

Cite

@article{arxiv.2401.11208,
  title  = {On cubic polynomials with the cyclic Galois group},
  author = {Yury Kochetkov},
  journal= {arXiv preprint arXiv:2401.11208},
  year   = {2024}
}

Comments

3 pages

R2 v1 2026-06-28T14:22:25.708Z