English
Related papers

Related papers: Maximum Gap in (Inverse) Cyclotomic Polynomial

200 papers

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

Cyclotomic polynomials play fundamental roles in number theory, combinatorics, algebra and their applications. Hence their properties have been extensively investigated. In this paper, we study the maximum gap $g$ (maximum of the…

Number Theory · Mathematics 2020-01-24 Ala'a Al-Kateeb , Mary Ambrosino , Hoon Hong , Eunjeong Lee

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…

Number Theory · Mathematics 2026-05-12 Antonio Cafure , Eda Cesaratto

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

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 f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

alg-geom · Mathematics 2008-02-03 Ricardo Garcia Lopez

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

Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Assume that $v_p(f(n))\ge s_1$ and $v_p(g(n))\ge s_2$ hold for all integers $n$ for some $s_1, s_2$ fixed non-negative integers. Let $S$ denote…

Number Theory · Mathematics 2021-11-12 Kristof Szabo

Let $\Phi_n(X)$ and $\Psi_n(X)=\frac{X^{n}-1}{\Phi_{n}(X)}$ be the $n$-th cyclotomic and inverse cyclotomic polynomials respectively. In this short note, for any pair of divisors $ d_{1} \neq d_{2} $ of $ n $, and integers $l_1$ and $l_2$…

Number Theory · Mathematics 2022-08-31 Jianfeng Xie

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

Number Theory · Mathematics 2026-05-22 Cheng-TIng Wang

Let $p_n$ denote the $n$th prime and $g_n:=p_{n+1}-p_n$ the $n$th prime gap. We demonstrate the existence of infinitely many values of $n$ for which $g_n>g_{n+1}>\cdots>g_{n+m}$ with $m\gg \log\log\log n$ and similarly for the reversed…

Number Theory · Mathematics 2016-04-12 D. K. L. Shiu

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Combinatorics · Mathematics 2007-05-23 Robert Guralnick , David Perkinson

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…

Number Theory · Mathematics 2018-01-18 Ala'a Al-Kateeb , Hoon Hong , Eunjeong Lee

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

General Mathematics · Mathematics 2016-04-25 N. A. Carella

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 $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of…

Number Theory · Mathematics 2018-06-12 Péter E. Frenkel , Gergely Zábrádi

The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $\Phi_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime…

Number Theory · Mathematics 2019-11-06 G. Jones , P. I. Kester , L. Martirosyan , P. Moree , L. Tóth , B. B. White , B. Zhang

Let S(n,0) be the set of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ denote by $|p|_{0}$ the distance from the origin to the zero set of $p'$. We…

Complex Variables · Mathematics 2007-05-23 Julius Borcea

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 show that the number of all maximal $\alpha$-gapped repeats and palindromes of a word of length $n$ is at most $3(\pi^2/6 + 5/2) \alpha n$ and $7 (\pi^2 / 6 + 1/2) \alpha n - 5 n - 1$, respectively.

Formal Languages and Automata Theory · Computer Science 2018-03-01 Tomohiro I , Dominik Köppl
‹ Prev 1 2 3 10 Next ›