A proof of the Corrected Beiter conjecture
Jia Zhao, Xianke Zhang

TL;DR
This paper proves the Corrected Beiter conjecture, establishing an upper bound on the maximum coefficient of cyclotomic polynomials of order three, which refines previous conjectures and corrects earlier false claims.
Contribution
The paper provides a rigorous proof of the Corrected Beiter conjecture, confirming the new upper bound for coefficients of cyclotomic polynomials of order three.
Findings
Confirmed the bound A(pqr) <= 2p/3 for cyclotomic polynomials of order three.
Resolved a long-standing conjecture in algebraic number theory.
Refined previous bounds and corrected earlier false conjectures.
Abstract
We say that a cyclotomic polynomial \Phi_{n}(x) has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of \Phi_{n}(x) and M(p) be the maximum of A(pqr). In 1968, Sister Marion Beiter conjectured that A(pqr)<=(p+1)/2. In 2008, Yves Gallot and Pieter Moree showed that the conjecture is false for every p>=11, and they proposed the Corrected Beiter conjecture: A(pqr)<=2p/3. Here we will give a proof of this conjecture.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematics and Applications · Advanced Algebra and Geometry
A proof of the Corrected Beiter conjecture
Jia Zhao
Xianke Zhang
Abstract
We say that a cyclotomic polynomial has order three if is the product of three distinct primes, . Let be the largest absolute value of a coefficient of and be the maximum of . In 1968, Sister Marion Beiter conjectured that . In 2008, Yves Gallot and Pieter Moree showed that the conjecture is false for every , and they proposed the Corrected Beiter conjecture: . Here we will give a proof of this conjecture.
keywords:
Cyclotomic polynomial , Corrected Beiter conjecture
MSC:
[1991] 11B83 , 11C08
1 Introduction
The th cyclotomic polynomial is the monic polynomial whose roots are the primitive th roots of unity and are all simple. It is defined by
[TABLE]
The degree of is , where is the Euler totient function. It is known that the coefficients , where , are all integers.
Definition 1.1**.**
[TABLE]
For , . It was once conjectured that this would hold for all , however . Note that 105 is the smallest positive integer that is the product of three distinct odd primes. In fact, it is easy to prove that and for distinct primes . Besides, we have the following useful propositions.
Proposition 1.2**.**
The nonzero coefficients of alternate between and .
Proposition 1.3**.**
*Let be a prime.
If , then , so .
If , then .
If is odd, then , so .*
Proof.
See [9] for details. ∎
By the proposition above, it suffices to consider squarefree values of to determine . For squarefree , the number of distinct odd prime factors of is the order of the cyclotomic polynomial . Therefore the cyclotomic polynomials of order three are the first non-trivial case with respect to . We also call them ternary cyclotomic polynomials.
Assume are odd primes, Bang [2] proved the bound . This was improved by Beiter [3, 4], who proved that , and made the following conjecture.
Conjecture 1.4** ((Beiter)).**
.
Beiter proved her conjecture for and also in case either or [3]. If this conjecture holds, it is the strongest possible result of this form. This is because Möller [10] indicated that for any prime there are infinitely many pairs of primes such that . Define
[TABLE]
where the prime is fixed, and and are arbitrary primes. Now with Möller’s result, we can reformulate Beiter’s conjecture.
Conjecture 1.5**.**
For , we have .
However, Gallot and Moree [6] showed that Beiter’s conjecture is false for every . Based on extensive numerical computations, they gave many counter-examples and proposed the Corrected Beiter conjecture.
Conjecture 1.6** ((Corrected Beiter conjecture)).**
We have .
This is the strongest corrected version of Beiter’s conjecture because they also proved that for any , for every sufficiently large prime . In this paper, we will give a proof of the Corrected Beiter conjecture.
2 Main theorem
First we introduce some notation for the rest of the paper. Let be odd primes. Let
[TABLE]
and
[TABLE]
For or , or , we set .
Notation 2.1**.**
, let be the unique integer such that and .
Definition 2.2**.**
For any , define a map
[TABLE]
by
[TABLE]
It is easy to certify that the value of only depends on and . That means for any , we have
[TABLE]
With notation as above, now we recall some important results. For the details, we refer the reader to our previous paper [11].
Lemma 2.3**.**
We have
[TABLE]
Corollary 2.4**.**
For any integer ,
[TABLE]
Corollary 2.5**.**
We have
[TABLE]
Remark 2.6**.**
If and interchange, we will have similar arguments as above.
By corollary 2.3, we know it is sufficient for estimating the upper bound of to consider Therefore we need to study the coefficients of
Notation 2.7**.**
For any distinct primes and , let be the unique integer such that and . Let be the unique integer such that and .
About the coefficients of , Lam and Leung [8] showed
Theorem 2.8** ((T.Y. Lam and K.H. Leung, 1996)).**
Let . For , we have
(A) if and only if for some and ;
(B) if and only if for some and ;
(C) otherwise.
The numbers of terms of the former two kinds are, respectively, and , with difference since .
About , the best known general upper bound to date is due to Bartłomiej Bzdȩga [5]. He gave the following important result
Theorem 2.9** ((Bartłomiej Bzdȩga, 2008)).**
Set
[TABLE]
and satisfying . Put . Then we have
[TABLE]
Now we can prove our main theorem.
Theorem 2.10** ((Corrected Beiter conjecture)).**
Assume are odd primes. Let and . Then we have .
Proof.
Suppose , we will show that this is a contradiction. Let us first assume
[TABLE]
By Remark 1, we can observe that the proof is similar for the other cases. According to Theorem 2.5, it follows , and . Since , so we easily get
[TABLE]
By Corollary 2.3, we know there exist a pair of integers such that
[TABLE]
By Theorem 2.4, we can divide the nonzero terms of into classes depending on the value of or . From the definition of , we can simply verify that for any given class, there is at most one term such that . For the case , we have the similar result.
Since , it follows
[TABLE]
We claim that
[TABLE]
By (2.3), we know or . However the number of the classes of is just , hence
[TABLE]
If the former holds, then
[TABLE]
Thus there must exist and such that . By (2.4), we have and . Hence , their contributions to the left side of (2.6) are zero. This is a contradiction, so we establish our claim.
With the arguments above, now we can give the following definition. For any class , , if there exist such that , and , then we say it is a special class. If there exists either or satisfying the above conditions, we say it is a plain class. If there exists neither nor satisfying the above conditions, we say it is a null class. Similarly for any class , , if there exist such that , and , then we say it is a special class. If there exists either or satisfying the above conditions, we say it is a plain class. If there exists neither nor satisfying the above conditions, we say it is a null class. Let , and denote the sets of the special classes, the plain classes and the null classes respectively.
By Corollary 2.2 and (2.3), we immediately obtain
[TABLE]
By (2.3) and (2.7), it is easy to verify that
[TABLE]
The number of the classes , is just , so there must exist at least one , such that . Let be the largest value of such that . Next we will consider three cases according to the value of and derive a contradiction to (2.8) to complete the proof.
Case 1.
First we claim that for any class , , if , then .
Obviously we only need to show the first inequality. Suppose and . By the definition of the special class, we know there exist such that
[TABLE]
and
[TABLE]
This yields
[TABLE]
hence
[TABLE]
On the other hand,
[TABLE]
The equality holds because . Therefore we derive a contradiction and prove our claim.
Now we consider the classes , . Since , . If not, then there exists such that . By (2.4), we get . On the other hand, there exists such that . By the definition of , we have , however it is impossible.
Suppose and . Similarly we know , but . Moreover, if , then the contributions of these two classes to the left side of (2.8) are zero, thus we can ignore them. If , then we say the class is a valid special class. Let denote the set of the valid special classes.
Suppose and . We claim that and .
Since , there exist such that , and . This implies that
[TABLE]
or
[TABLE]
Since , there exist such that , and . This implies that
[TABLE]
or
[TABLE]
If (2.9) and (2.11) hold simultaneously, then we get
[TABLE]
Hence
[TABLE]
This is impossible. Similarly (2.10) and (2.12) can not hold simultaneously either, so without loss of generality we assume (2.10) and (2.11) are correct. By (2.4), we have . Because , we know there exists such that and . Hence
[TABLE]
or
[TABLE]
If (2.14) holds, by (2.10) we get
[TABLE]
Hence
[TABLE]
On the other hand, by
[TABLE]
we have
[TABLE]
Note that
[TABLE]
so we can get
[TABLE]
This contradicts (2.15) and establishes the validity of (2.13).
Now if , then there exist such that , and . By (2.10), we have
[TABLE]
We recall that and refer the reader to the proof of the main result in [11]. Combining (2.10), (2.13) and (2.16) yields
[TABLE]
Hence
[TABLE]
Moreover, we have because and . It follows
[TABLE]
The equality is easily obtained by (2.10) and (2.16). Therefore
[TABLE]
and
[TABLE]
On the other hand, by (2.11) and (2.13) we get
[TABLE]
In view of the ranges of , and , we certainly have
[TABLE]
and
[TABLE]
By (2.18) and (2.19), we get
[TABLE]
Since , it is a contradiction, so we prove our claim.
Finally, we need to show that if , then and can not hold simultaneously. Otherwise, there exist such that , and . By (2.4), we have
[TABLE]
Because , we know there exists such that and
[TABLE]
Hence it follows
[TABLE]
Combining (2.10), (2.13) and (2.20) yields
[TABLE]
Hence
[TABLE]
Moreover and , so
[TABLE]
and
[TABLE]
By (2.19) and (2.22), we get a contradiction and establish the claim. Now combining our arguments above shows that
[TABLE]
This contradicts (2.8) and completes the proof. In the remaining two cases, the methods which will be used are similar to the present case, so we will introduce our ideas and omit the straightforward details.
Case 2.
First we know for any class , , if , then .
Suppose and . Then and .
For any class , , we consider the class . Obviously, . If , then the class or . Combining the arguments above, we get
[TABLE]
By (2.8), it follows , so
[TABLE]
If and , then and . Thus we have
[TABLE]
We claim that for any class , , there must exist such that and . Obviously it holds for the classes and . If it is not correct for a class , then for the class , by (2.4), there does not exist such that and . Therefore , . Then there exists such that and . It is not difficult to obtain that . This implies . It contradicts (2.24) and establishes the claim.
By (2.24), we know . Similar to the arguments in case 1, we can get . Thus . Moreover, by the previous claim, we know . In fact, for any , we have . Otherwise, , then and . This implies the class . However, and can not hold simultaneously.
With the arguments above, we know there exist such that and . By (2.11), we get
[TABLE]
By (2.4), we have and . By the claim above, we know there exist such that and . By (2.13), we get
[TABLE]
and
[TABLE]
Combining (2.25), (2.26) and (2.27) yields
[TABLE]
We also have . It follows
[TABLE]
hence we have
[TABLE]
Since , there exists such that . Thus by (2.29), we have
[TABLE]
On the other hand, . By (2.10), we have
[TABLE]
(2.30) and (2.31) yields
[TABLE]
Note that . Hence (2.32) means that , but it is impossible. Therefore we get a contradiction and complete the proof of the present case.
Case 3.
Suppose and , then we have . If , then . Therefore we have
[TABLE]
This contradicts (2.8) and completes the proof of the theorem. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Bachman, On the coefficients of ternary cyclotomic polynomials, J. Number Theory 100 (2003) 104-116.
- 2[2] A.S. Bang, Om Lingingen Φ n ( x ) = 0 subscript Φ 𝑛 𝑥 0 \Phi_{n}(x)=0 , Tidsskr. Math. 6 (1895) 6–12.
- 3[3] M. Beiter, Magnitude of the coefficients of the cyclotomic polynomial F p q r subscript 𝐹 𝑝 𝑞 𝑟 F_{pqr} , Amer. Math. Monthly 75 (1968) 370–372.
- 4[4] M. Beiter, Magnitude of the coefficients of the cyclotomic polynomial F p q r subscript 𝐹 𝑝 𝑞 𝑟 F_{pqr} , II, Duke Math. J. 38 (1971) 591–594.
- 5[5] B. Bzdȩga, Bounds on ternary cyclotomic coefficients, ar Xiv:0812.4024, preprint.
- 6[6] Y. Gallot and P. Moree, Ternary cyclotomic polynomials having a large coefficient, J. Reine Angew. Math. 632(2009), 105-125.
- 7[7] N. Kaplan, Flat cyclotomic polynomials of order three, J. Number Theory 127 (2007) 118–126.
- 8[8] T.Y. Lam, K.H. Leung, On the cyclotomic polynomial Φ p q ( X ) subscript Φ 𝑝 𝑞 𝑋 \Phi_{pq}(X) , Amer. Math. Monthly 103 (1996) 562-564.
