We present a new bound on $A = \max_n |a_{pqr}(n)|$, where $a_{pqr}(n)$ are the coefficients of a ternary cyclotomic polynomial. We also prove that two consecutive coefficients of such a polynomial differ by at most one.
In this paper, we give an explicit expression for a certain family of ternary cyclotomic polynomials: specifically $Φ_{p_{1}p_{2}p_{3}}$, where $p_{1}<p_{2}<p_{3}$ are odd primes such that $p_{2} \equiv1 \mod p_{1}$ and $p_{3} \equiv1 \mod {p_{1}p_{2}}$. As an application of the explicit expressions, we give an exact formula for the number of nonzero terms in the polynomials in the family, which in turn immediately shows that the density (number of non-zeros terms / degree) is roughly inversely proportional to $p_{2}$, when $p_{1}$ is sufficiently large.
We study the number of non-zero terms in two specific families of ternary cyclotomic polynomial, we find formulas for the number of terms by writing the cyclotomic polynomial as a sum of smaller sub-polynomials and study the properties of these polynomial.
An integer $n$ is said to be ternary if it is composed of three distinct odd primes. In this paper, we asymptotically count the number of ternary integers $n \leq x$ with the constituent primes satisfying various constraints. We apply our results to the study of the simplest class of (inverse) cyclotomic polynomials that can have coefficients that are greater than 1 in absolute value, namely to the $n^{th}$ (inverse) cyclotomic polynomials with ternary $n$. We show, for example, that the corrected Sister Beiter conjecture is true for a fraction $\ge 0.925$ of ternary integers.
In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.
令$a(n, k)$为$n$第分圆多项式的第$k$系数。最近,Ji,Li和Moree证明了对任意整数$m\ge1$,$\{a(mn, k)| n, k\in\mathbb{N}\}=\mathbb{Z}$ .本文改进了这一结果,证明了对任意整数$s>t\ge0$,$$\{a(ns+t, k)| n, k\in\mathbb{N}\}=\mathbb{Z}.$$
In this article, we provide a short and elementary proof of the following result: For $n \geq 3$ the middle coefficient of $Φ_n(x)$ is either zero (when $n$ is a power of $2$) or an odd integer.
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. Previous surveys on this topic were given by Lenstra (1979), Vaughan (1989),…
This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with $t\geq 3$ odd, then the numbers $-(r-2),-(r-3),\ldots, r-2, r-1$ are all coefficients of the cyclotomic polynomial $Φ_{2n}$. Furthermore, if $1+p_r<p_1+p_2$ then $1-r$ is also a coefficient of $Φ_{2n}$.} In the experimental part, in two instances we present computational evidence for asymptotic symmetry between distribution of positive and negative coefficien…
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $Φ_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime factors using numerical semigroups, respectively Bachman's inclusion-exclusion polynomials. Given $m\ge 1$ we show that every integer occurs as a coefficient of $Φ^*_{mn}(x)$ for some $n\ge 1$. Here $n$ will typically have many different prime factors. We also consider similar questions for the polynomials $(x^n-1)/Φ_n^*(x),$ the inverse unitary cyclotomic polyno…
A unitary cyclotomic polynomial of order three is a polynomial of the form \[ Φ^*_{PQR}(x)=\frac{(x^{PQR}-1)(x^P-1)(x^Q-1)(x^R-1)}{(x^{PQ}-1)(x^{QR}-1)(x^{RP}-1)(x-1)}, \] where $P$, $Q$ and $R$ are powers of three distinct primes $p$, $q$ and $r$. Fixing any such prime triple generates a family of these polynomials corresponding to all possible choices of $P=p^a$, $Q=q^b$ and $R=r^c$. We study the coefficients of polynomials in such a family. In particular, we show that the coefficients of polynomials in every such family cover all of $\mathbb{Z}$.
Borwein and Choi conjectured that a polynomial $P(x)$ with coefficients $\pm1$ of degree $N-1$ is cyclotomic iff $$P(x)=\pm Φ_{p_1}(\pm x)Φ_{p_2}(\pm x^{p_1})\cdots Φ_{p_r}(\pm x^{p_1p_2\cdots p_{r-1}})$$ where $N=p_1p_2\cdots p_{r}$ and the $p_i$ are primes, not necessarily distinct. Here $Φ_p(x):=(x^p-1)/(x-1)$ is the $p-$th cyclotomic polynomial. In \cite{1}, they also proved the conjecture for $N$ odd or a power of 2. In this paper we introduce a so-called $E-$transformation, by which we prove the conjecture for a wider variety of cases and present the key as well as a new approach to inve…
We present a method to deal with the values of polynomials of type $P(z)=\prod_{d\in D}(1-z^d)^{j_d}$ on the unit circle. We use it to improve the known bounds on various measures of coefficients of cyclotomic and similar polynomials.
The $n^{th}$ cyclotomic polynomial $Φ_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Its coefficients are the subject of intensive study and some formulas are known for them. Here we are interested in formulas which are valid for all natural numbers $n$. In these a host of famous number theoretical objects such as Bernoulli numbers, Stirling numbers of both kinds and Ramanujan sums make their appearance, sometimes even at the same time! In this paper we present a survey of these formulas which until now were scattered in the literature and introduce an unified approach…
We show that polynomials associated with automatic sequences satisfy a certain recurrence relation when evaluated at a root of unity, which generalizes a result of Brillhart, Lomont and Morton on the Rudin--Shapiro polynomials. We study the minimal order of such a relation and the integrality of its coefficients.
We determine necessary conditions for when powers corresponding to positive/negative coefficients of $Φ_{n}$ are in arithmetic progression. When $n = pq$ for any primes $q>p>2$, our conditions are also sufficient. Finally, we generalize the result when $n = pq$ to the so-called inclusion-exclusion polynomials first introduced by Bachman.
Given any positive integer $n,$ let $A(n)$ denote the height of the $n^{\text{th}}$ cyclotomic polynomial, that is its maximum coefficient in absolute value. It is well known that $A(n)$ is unbounded. We conjecture that every natural number can arise as value of $A(n)$ and prove this assuming that for every pair of consecutive primes $p$ and $p'$ with $p\ge 127$ we have $p'-p<\sqrt{p}+1.$ We also conjecture that every natural number occurs as maximum coefficient of some cyclotomic polynomial and show that this is true if Andrica's conjecture that always $\sqrt{p'}-\sqrt{p}<1$ holds. This is th…
Linear Feedback Shift Registers (LFRS) are tools commonly used in cryptography in many different context, for example as pseudo-random numbers generators. In this paper we characterize LFRS with certain symmetry properties. Related to this question we also classify polynomials f of degree n satisfying the property that if a is a root of f then $f(a^n)=0$. The classification heavily depends on the choice of the fields of coefficients of the polynomial; we consider the cases $K=\mathbb{F}_p$ and $K=\mathbb{Q}$.
We present an algorithm that computes the product of two n-bit integers in O(n log n (4\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n}). We also prove that for a fixed prime p, polynomials in F_p[X] of degree n may be multiplied in O(n log n 4^{log^* n}) bit operations; the previous best bound was O(n log n 8^{log^* n}).
The $n^{th}$ cyclotomic polynomial $Φ_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Hence $Φ_n(x)$ is trivially zero at primitive $n^{th}$ roots of unity. Using finite Fourier analysis we derive a formula for $Φ_n(x)$ at the other roots of unity. This allows one to explicitly evaluate $Φ_n(e^{2πi/m})$ with $m\in \{3,4,5,6,8,10,12\}$. We use this evaluation with $m=5$ to give a simple reproof of a result of Vaughan (1975) on the maximum coefficient (in absolute value) of $Φ_n(x)$. We also obtain a formula for $Φ_n'(e^{2πi/m}) / Φ_n(e^{2πi/m})$ with $n \ne m$, which is …
The scaled inverse of a nonzero element $a(x)\in \mathbb{Z}[x]/f(x)$, where $f(x)$ is an irreducible polynomial over $\mathbb{Z}$, is the element $b(x)\in \mathbb{Z}[x]/f(x)$ such that $a(x)b(x)=c \pmod{f(x)}$ for the smallest possible positive integer scale $c$. In this paper, we investigate the scaled inverse of $(x^i-x^j)$ modulo cyclotomic polynomial of the form $Φ_{p^s}(x)$ or $Φ_{p^s q^t}(x)$, where $p, q$ are primes with $p<q$ and $s, t$ are positive integers. Our main results are that the coefficient size of the scaled inverse of $(x^i-x^j)$ is bounded by $p-1$ with the scale $p$ modul…
It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to exhibit this property. In this article, we propose a method to show that ``cyclotomic polynomials $Φ_{\ell}(X)$ take square free values with positive proportion". Following this method, conditionally, we do prove the Square-free conjecture for all cyclotomic polynomials. The method is applicable to some other class of polynomials as well. Moreover we show t…
Galois-Orbit Structure, Ramanujan Sums, and Stable-Range Collapse for Cyclotomic Cosine Formulas
Departamento de Matemáticas, Sede Medellín, Universidad Nacional de Colombia(哥伦比亚国立大学麦德林校区数学系);Departamento de Matemáticas, Universidad EAFIT(伊法蒂大学数学系)
Let $p$ be an odd prime number. In this paper, we study the growth of the Sylow $p$-subgroups of the even $K$-groups of rings of integers in a $p$-adic Lie extension. Our results generalize previous results of Coates and Ji-Qin, where they considered the situation of a cyclotomic $\mathbb{Z}_p$-extension. Our method of proof differs from these previous work. Their proof relies on an explicit description of certain Galois group via Kummer theory afforded by the context of a cyclotomic $\mathbb{Z}_p$-extension, whereas our approach is via considering the Iwasawa cohomology groups with coefficien…
For any positive integers $n \ge 3$ and $r \ge 1$, we prove that the number of monic irreducible polynomials of degree $n$ over $\mathbb{F}_{2^r}$ in which the coefficients of $T^{n-1}$, $T^{n-2}$ and $T^{n-3}$ are prescribed has period $24$ as a function of $n$, after a suitable normalization. A similar result holds over $\mathbb{F}_{5^r}$, with the period being $60$. We also show that this is a phenomena unique to characteristics $2$ and $5$. The result is strongly related to the supersingularity of certain curves associated with cyclotomic function fields, and in particular it complements a…