English
Related papers

Related papers: Lower bounds for coefficients of certain cyclotomi…

200 papers

The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best…

Number Theory · Mathematics 2011-11-24 Lola Thompson

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.

Number Theory · Mathematics 2015-05-13 Bartlomiej Bzdega

We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.

Number Theory · Mathematics 2026-03-26 Tomohiro Yamada

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

Optimization and Control · Mathematics 2025-12-01 Nguyen Hong Duc , Vu Trung Hieu

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

Number Theory · Mathematics 2023-10-06 Florian Breuer , Fabien Pazuki

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

Number Theory · Mathematics 2007-05-23 Greg Martin

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Number Theory · Mathematics 2020-08-03 Anuj Jakhar , Srinivas Koytada

The largest coefficient (in absolute value) of a cyclotomic polynomial $\Phi_n$ is called its height $A(n)$. In case $p$ is a fixed prime it turns out that as $q$ and $r$ range over all primes satisfying $p<q<r$, the height $A(pqr)$ assumes…

Number Theory · Mathematics 2023-04-20 Branko Juran , Pieter Moree , Adrian Riekert , David Schmitz , Julian Völlmecke

Let $\Psi_n(x)$ be the monic polynomial having precisely all non-primitive $n$th roots of unity as its simple zeros. One has $\Psi_n(x)=(x^n-1)/\Phi_n(x)$, with $\Phi_n(x)$ the $n$th cyclotomic polynomial. The coefficients of $\Psi_n(x)$…

Number Theory · Mathematics 2012-07-30 Pieter Moree

Let a(n,k) be the kth coefficient of the nth cyclotomic polynomial. The first two authors showed in part I that if m is a prime power and n and k range over the non-negative integers, then a(mn,k) assumes every integer value. Here this…

Number Theory · Mathematics 2012-07-30 Chun-Gang Ji , Wei-Ping Li , Pieter Moree

The maximum gap $g(f)$ of a polynomial $f$ is the maximum of the differences (gaps) between two consecutive exponents that appear in $f$. Let $\Phi_{n}$ and $\Psi_{n}$ denote the $n$-th cyclotomic and $n$-th inverse cyclotomic polynomial,…

Number Theory · Mathematics 2017-02-27 Mary Ambrosino , Hoon Hong , Eunjeong Lee

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…

Number Theory · Mathematics 2020-08-27 Bartlomiej Bzdega , Andres Herrera-Poyatos , Pieter Moree

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…

Number Theory · Mathematics 2009-10-13 Jia Zhao , Xianke Zhang

We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.

Number Theory · Mathematics 2012-07-04 Bartlomiej Bzdega

Let p and r be two primes and n, m be two distinct divisors of pr. Consider the n-th and m-th cyclotomic polynomials. In this paper, we present lower and upper bounds for the coefficients of the inverse of one of them modulo the other one.…

Number Theory · Mathematics 2019-02-20 Clement Dunand

We give a new lower bound for the discrete norm of a polynomial on the circle

Complex Variables · Mathematics 2012-03-13 V. N. Dubinin

Let $A_n$ denote the height of cyclotomic polynomial $\Phi_n$, where $n$ is a product of $k$ distinct odd primes. We prove that $A_n \le \epsilon_k\phi(n)^{k^{-1}2^{k-1}-1}$ with $-\log\epsilon_k\sim c2^k$, $c>0$. The same statement is true…

Number Theory · Mathematics 2012-07-04 Bartlomiej Bzdega

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…

Number Theory · Mathematics 2019-02-14 Marcin Mazur , Bogdan V. Petrenko

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…

Number Theory · Mathematics 2020-12-01 Alexandre Kosyak , Pieter Moree , Efthymios Sofos , Bin Zhang
‹ Prev 1 2 3 10 Next ›