On the reducibility type of trinomials

DOI10.4064/AA153-4-2zbMATH Open1273.11153arXiv1112.4267OpenAlexW2963185426MaRDI QIDQ2883256FDOQ2883256

Authors: Andrew Bremner, Maciej Ulas 

Publication date: 11 May 2012

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: Say a trinomial $x^n+A{x}^m+BinQ[x]$ has reducibility type $(n_1,n_2,\mathrm{...},n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_{1}leq{n}_{2}leq\mathrm{...}leq{n}_k$. Specifying the reducibility type of a monic polynomial of fixed degree is equivalent to specifying rational points on an algebraic curve. When the genus of this curve is 0 or 1, there is reasonable hope that all its rational points may be described; and techniques are available that may also find all points when the genus is 2. Thus all corresponding reducibility types may be described. These low genus instances are the ones studied in this paper.

Full work available at URL: https://arxiv.org/abs/1112.4267

Recommendations

• scientific article; zbMATH DE number 4087777
• scientific article; zbMATH DE number 510179
• scientific article; zbMATH DE number 1111408
• On reducible trinomials. IV
• On reducible trinomials. II

zbMATH Keywords

reducibilitytrinomial

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Rational points (14G05) Polynomials (irreducibility, etc.) (11R09) Special polynomials in general fields (12E10)

Cited In (5)

• On the factorization of the trinomials \(x^n + cx^{n-1} + d\)
• Some observations concerning reducibility of quadrinomials
• Title not available (Why is that?)
• On trinomials having irreducible quadratic factors
• On reducible trinomials. IV

This page was built for publication: On the reducibility type of trinomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883256)