2016
DOI: 10.1016/j.jnt.2016.02.021
|View full text |Cite
|
Sign up to set email alerts
|

On prime divisors of the index of an algebraic integer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
11
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 12 publications
0
11
0
Order By: Relevance
“…We have arranged the expression in (18) so that the summands are multiplicative with respect to d. This enables us to complete the sum over all gcd(d, αβ) = 1 and factor it into an Euler product, up to some manageable error. By (18) and bounding the tail of the completed sum trivially,…”
Section: 1mentioning
confidence: 99%
See 3 more Smart Citations
“…We have arranged the expression in (18) so that the summands are multiplicative with respect to d. This enables us to complete the sum over all gcd(d, αβ) = 1 and factor it into an Euler product, up to some manageable error. By (18) and bounding the tail of the completed sum trivially,…”
Section: 1mentioning
confidence: 99%
“…Main results. Recently, Jakhar, Khanduja and Sangwan [17,18] have given necessary and sufficient conditions, based solely on n, m, A, B, for an irreducible trinomial f (x) = x n + Ax m + B to be monogenic. While examples are provided in [18] for the situation where n = tm + u, with 0 ≤ u ≤ m − 1, and either u = 0 or u is a divisor of m, no indication is given as to whether there exist infinite families of such trinomials.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…As this work was in final edits for release, the authors were made aware of an overlapping recent parallel research line. Using an extension of Dedekind's index criterion, Jakhar, Khanduja, and Sangwan ( [10] and [11]) established necessary and sufficient conditions for any trinomial to be monogenic. Their work is more complete than our Theorems 3.5 and 3.6, but our methods are distinct (we use the Montes Algorithm).…”
Section: Introductionmentioning
confidence: 99%