1999
DOI: 10.1006/jabr.1999.8033
|View full text |Cite
|
Sign up to set email alerts
|

Galois Groups of Trinomials

Abstract: Galois groups of irreducible trinomials X n + aX s + b ∈ X are investigated assuming the classification of finite simple groups. We show that under some simple yet general hypotheses bearing on the integers n s a and b only very specific groups can occur. For instance, if the two integers nb and as n − s are coprime and if s is a prime number, then already the Galois group of f X is either the alternating group A n or the symmetric group S n . This significantly extends work of Osada.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(10 citation statements)
references
References 11 publications
0
10
0
Order By: Relevance
“…+ · · · + x + 1 contains A n , the alternating group on n letters for every n (see [12]). In this paper, we extend the above mentioned result of Schur to polynomials f n (x) defined by (1). Precisely stated, we prove: Theorem 1.1.…”
Section: Introductionmentioning
confidence: 57%
See 3 more Smart Citations
“…+ · · · + x + 1 contains A n , the alternating group on n letters for every n (see [12]). In this paper, we extend the above mentioned result of Schur to polynomials f n (x) defined by (1). Precisely stated, we prove: Theorem 1.1.…”
Section: Introductionmentioning
confidence: 57%
“…By Hensel's Lemma [8,Chap. II,4.6], f (x) factors over the field Q q of q-adic numbers into monic polynomials as f 1 …”
Section: Lemma 2ementioning
confidence: 99%
See 2 more Smart Citations
“…It is also worth remarking that the topic of Galois groups of trinomials over double-struckQ has been extensively studied (see, for example, ). Hilbert used trinomials to prove the existence, for each degree d, of a polynomial over double-struckQ whose Galois group is Sd .…”
Section: Introductionmentioning
confidence: 99%