Values of coefficients of cyclotomic polynomials II

Let a(n,k) be the kth coefficient of the nth cyclotomic polynomial. In part I it was proved that , in the case when m is a prime power. In this paper we show that the result also holds true in the case when m is an arbitrary positive integer.     

A survey on coefficients of cyclotomic polynomials

Cyclotomic polynomials play an important role in several areas of mathematics and their study has a very long history, which goes back at least to Gauss (1801). In particular, the properties of their coefficients have been intensively studied by several authors, and in the last 10 years there has been a burst of activity in this field of research. This concise survey attempts to collect the main results regarding the coefficients of the cyclotomic polynomials and to provide all the relevant references to their proofs.     

Explicit factorizations of generalized Dickson polynomials of order 2m via generalized cyclotomic polynomials over finite fields

We derive explicit factorizations of generalized cyclotomic polynomials of order $2^m$ and generalized Dickson polynomials of the first kind of order $2^m$ over finite field $F_q$.     

Explicit factors of generalized cyclotomic polynomials and generalized Dickson polynomials of order 2m3 over finite fields

In this paper, we derive explicit factorizations of generalized cyclotomic polynomials and generalized Dickson polynomials of the first kind of order $2^{m}3$, over finite field $F_q$.     

A note on inverses of cyclotomic mapping permutation polynomials over finite fields

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation polynomials that are involutions. Our results provide a fast algorithm (only modular operations are involved) to generate many classes of generalized cyclotomic permutation polynomials, their inverses, and involutions.     

Fractalized cyclotomic polynomials

For each prime power , we realize the classical cyclotomic polynomial as one of a collection of different polynomials in . We show that the new polynomials are similar to in many ways, including that their discriminants all have the form . We show also that the new polynomials are more complicated than in other ways, including that their complex roots are generally fractal in appearance.

     

Coefficients of ternary cyclotomic polynomials

It is customary to define a cyclotomic polynomial Φn(x) to be ternary if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of Φn(x) and M(p) be the maximum of A(pqr). In 1968, Sister Marion Beiter (1968, 1971) [3] and [4] conjectured that . In 2008, Yves Gallot and Pieter Moree (2009) [6] showed that the conjecture is false for every p≥11, and they proposed the Corrected Beiter conjecture: . Here we will give a sufficient condition for the Corrected Beiter conjecture and prove it when p=7.     

Piecewise constructions of inverses of cyclotomic mapping permutation polynomials

Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite fields.     

On Irreducibles in the Polynomial Semigroup

We consider the asymptotic behavior of the number of irreducible polynomials over a finite field in arithmetic progressions.     

On the coefficients of ternary cyclotomic polynomials

We study coefficients of ternary cyclotomic polynomials Φ_pqr(z)=∏_ρ(z−ρ), where p, q, and r are distinct odd primes and the product is taken over all primitive pqrth roots of unity ρ.     

On a multivariable extension of the Humbert polynomials

In this paper, we present a multivariable extension of the Humbert polynomials, which is motivated by the Chan-Chyan-Srivastava multivariable polynomials, the multivariable extension of the familiar Lagrange-Hermite polynomials and Erkus-Srivastava multivariable polynomials. We derive various families of multilinear and mixed multilateral generating functions for these polynomials. Other miscellaneous properties of these multivariable polynomials are also discussed. Some special cases of the results presented in this study are also indicated.     

On a problem regarding coefficients of cyclotomic polynomials

Let an(k) be the coefficient of tk in the nth cyclotomic polynomial

     

Sister Beiter and Kloosterman: A tale of cyclotomic coefficients and modular inverses

For a fixed prime p$p$, the maximum coefficient (in absolute value) M(p)$M\left(p\right)$ of the cyclotomic polynomial _Φpqr(x)${\Phi }_{pqr}\left(x\right)$, where r$r$ and q$q$ are free primes satisfying r>q>p$r>q>p$ exists. Sister Beiter conjectured in 1968 that M(p)≤(p+1)/2$M\left(p\right)\le (p+1)/2$. In 2009 Gallot and Moree showed that M(p)≥2p(1−?)/3$M\left(p\right)\ge 2p(1-?)/3$ for every p$p$ sufficiently large. In this article Kloosterman sums (‘cloister man sums’) and other tools from the distribution of modular inverses are applied to quantify the abundancy of counter-examples to Sister Beiter’s conjecture and sharpen the above lower bound for M(p)$M\left(p\right)$.     

Cyclotomy and permutation polynomials of large indices

We use cyclotomy to construct new classes of permutation polynomials over finite fields. This allows us to generate permutation polynomials in an algorithmic way and also to unify several previous constructions. Many permutation polynomials constructed in this way have large indices.