On cubic polynomials with the cyclic Galois group

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,x3 (enumerated in some order) are real. There exists (and only one) quadratic polynomial q with rational coefficients such that q(x1)=x2, q(x2)=x3, q(x3)=x1. The polynomial r=q(q) mod p cyclically permutes roots of p in the opposite order: r(x1)=x3, r(x3)=x2, r(x2)=x1. We prove that there exist a unique Galois polynomial p1 and a unique Galois polynomial p2 such that the polynomial q cyclically permutes roots of p1 and the polynomial r do the same with roots of p2. Polynomials p and p1 (and also p and p2) will be called coupled. Two polynomials are linear equivalent, if one of them is obtained from another by a linear change of variable. By C(p) we denote the class of polynomials, linear equivalent to p. The coupling realizes a bijection between classes C(p) and C(p1) (and between classes C(p) and C(p2)). Classes C(p) and C(p1) (and classes C(p) and C(p2)) will be called 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 superclasses. In this work we give a description of superclasses.

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…