Related papers: Sparse binary cyclotomic polynomials

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…

For odd prime numbers $p < q$, let $\Phi_{pq} \in \mathbb{Z}[X]$ be the binary cyclotomic polynomial of order $pq$. In this paper, we prove that the second gap of $\Phi_{pq}$ is the maximum of $r-1$ and $p-r-1$, where $r$ is the remainder…

Given two cyclotomic polynomials $\Phi_n(x)$ and $\Phi_m(x)$, $n\not= m$, we determine the minimal natural number k such that we can write $$k=a(x)\Phi_n (x)+b(x)\Phi_m(x),$$ with a(x) and b(x) integer polynomials.

In this paper I prove a conjecture which gives a lower bound for the largest absolute value of the coefficients of the n-th cyclotomic polynomial for some n. Moreover this estimate is essentially sharp.

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

In this article, we give upper bounds for cyclotomic numbers of order e over a finite field with q elements, where e is a divisor of q-1. In particular, we show that under certain assumptions, cyclotomic numbers are at most…

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

We present several approaches on finding necessary and sufficient conditions on $n$ so that $\Phi_k(x^n)$ is irreducible where $\Phi_k$ is the $k$-th cyclotomic polynomial.

The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Hence $\Phi_n(x)$ is trivially zero at primitive $n^{th}$ roots of unity. Using finite Fourier analysis we derive a formula for…

We obtain bounds on fractional parts of binary forms of the shape $$\Psi(x,y)=\alpha_k x^k+\alpha_l x^ly^{k-l}+\alpha_{l-1}x^{l-1}y^{k-l+1}+\cdots+\alpha_0 y^k$$ with $\alpha_k,\alpha_l,\ldots,\alpha_0\in\mathbb{R}$ and $l\leq k-2.$ By…

We give two proofs of a folkore result relating numerical semigroups of embedding dimension two and binary cyclotomic polynomials and explore some consequences. In particular, we give a more conceptual reproof of a result of Hong et al.…

Mersenne primes and Fermat primes may be thought of as primes of the form $\Phi_m(2)$, where $\Phi_m(x)$ is the $m$th cyclotomic polynomial. This paper discusses the more general problem of primes and composites of this form.

We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that $m = 5$ is the minimal number such that the sums of any two distinct polynomials in a set of $m$ polynomials over $\F_2[x]$ cannot all be of…

For each $ d \geq 2$, the Hilbert transform with a polynomial oscillation as below satisfies a $ (1, r )$ sparse bound, for all $ r>1$ $$ H _{ \ast } f (x) = \sup _{\epsilon } \Bigl\lvert \int_{|y| > \epsilon} f (x-y) \frac { e ^{2 \pi i y…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

In this paper, we give an explicit expression for a certain family of ternary cyclotomic polynomials: specifically $\Phi_{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…

In this article we study the irreducibility of polynomials of the form $x^n+\epsilon_1 x^m+p^k\epsilon_2$, $p$ being a prime number. We will show that they are irreducible for $m=1$. We have also provided the cyclotomic factors and…