English
Related papers

Related papers: Heights of divisors of x^n-1

200 papers

The height of a polynomial $f(x)$ is the largest coefficient of $f(x)$ in absolute value. Let B(n) be the largest height of a polynomial in $\mathbb{Z}[x]$ dividing $x^n-1$. In this paper we investigate the maximal height of divisors of…

Number Theory · Mathematics 2014-01-13 Shaozu Wang

Define B(n) to be the largest height of a polynomial in $\mathbb{Z}[x]$ dividing $x^n-1$. We formulate a number of conjectures related to the value of B(n) when $n$ is of a prescribed form. Additionally, we prove a lower bound for…

Number Theory · Mathematics 2010-09-30 Nathan C. Ryan , Bryan C. Ward , Ryan Ward

Let $N=p_1p_2... p_n$ be a product of $n$ distinct primes. Define $P_N(x)$ to be the polynomial $(1-x^N)\prod_{1\leq i<j\leq n}(1-x^{N/(p_ip_j)})/\prod_{i=1}^n (1-x^{N/p_i})$. (When $n=2$, $P_{pq}(x)$ is the $pq$-th cyclotomic polynomial,…

Number Theory · Mathematics 2012-09-27 Ricky Ini Liu

For the $n$th cyclotomic polynomial $\Phi_n$, let $A(n)$ denote the greatest absolute value of its coefficients, its height, and let $D(n)$ denote the difference between its largest and smallest coefficients, its diameter. We show that for…

Number Theory · Mathematics 2026-02-10 Gennady Bachman

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

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.

Number Theory · Mathematics 2024-03-21 Akos Borsanyi

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

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

In the paper we obtain the asymtotic number of integral quadratic polynomials with bounded heights and discriminants as the upper bound of heights tends to infinity.

Number Theory · Mathematics 2013-08-12 F. Götze , D. Kaliada , M. Korolev

We show that for any positive integer $h$, either $h$ or $h+1$ is a height of some cyclotomic polynomial $\Phi_n$, where $n$ is a product of three distinct primes.

Number Theory · Mathematics 2025-03-05 Gennady Bachman , Christopher Bao , Shenlone Wu

Let $a(r,n)$ be $r$th coefficient of $n$th cyclotomic polynomial. Suzuki proved that $\{a(r,n)|r\geq 1,n\geq 1\}=\mathbb{Z}$. If $m$ and $n$ are two natural numbers we prove an analogue of Suzuki's theorem for divisors of $x^n-1$ with…

Number Theory · Mathematics 2015-11-13 Sai Teja Somu

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

Number Theory · Mathematics 2017-07-12 Randell Heyman

We prove that for every $\varepsilon>0$ and a nonnegative integer $\omega$ there exist primes $p_1,p_2,\ldots,p_\omega$ such that for $n=p_1p_2\ldots p_\omega$ the height of the cyclotomic polynomial $\Phi_n$ is at least…

Number Theory · Mathematics 2016-06-27 Bartlomiej Bzdega

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

Number Theory · Mathematics 2020-08-28 Andreas Decker , Pieter Moree

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

Combinatorics · Mathematics 2014-12-04 Jiyou Li

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

Number Theory · Mathematics 2022-10-04 Artūras Dubickas , Min Sha

Let $K/\mathbb{Q}$ be a finite extension. We prove that the minimal height of polynomials of degree $n$ of which all roots are in $K^\times$ increases exponentially in $n$. We determine the implied constant exactly for totally real $K$ and…

Number Theory · Mathematics 2025-09-16 Thian Tromp

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

Number Theory · Mathematics 2021-11-18 Rainer Dietmann , Alina Ostafe , Igor E. Shparlinski

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

A special case of the Menshov--Rademacher theorem implies for almost all polynomials $x_1Z+\ldots +x_d Z^{d} \in {\mathbb R}[Z]$ of degree $d$ for the Weyl sums satisfy the upper bound $$ \left| \sum_{n=1}^{N}\exp\left(2\pi i \left(x_1…

Number Theory · Mathematics 2020-03-20 Changhao Chen , Igor E. Shparlinski
‹ Prev 1 2 3 10 Next ›