English
Related papers

Related papers: Bounds on ternary cyclotomic coefficients

200 papers

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

Number Theory · Mathematics 2021-04-08 Jozsef Solymosi , Ethan P. White , Chi Hoi Yip

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…

Number Theory · Mathematics 2015-08-24 John Abbott

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…

Combinatorics · Mathematics 2017-10-20 Koichi Betsumiya , Mitsugu Hirasaka , Takao Komatsu , Akihiro Munemasa

In this article we prove an upper bound for a Hilbert polynomial on quaternionic Kaehler manifolds of positive scalar curvature. As corollaries we obtain bounds on the quaternionic volume and the degree of the associated twistor space.…

Differential Geometry · Mathematics 2007-05-23 Uwe Semmelmann , Gregor Weingart

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

Classical Analysis and ODEs · Mathematics 2014-08-28 A. I. Aptekarev , J. S. Geronimo

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 a family of inverse ternary cyclotomic polynomials $\Psi_{pqr}$ in which $r\le\varphi(pq)$ is a positive linear combination of $p$ and $q$. We derive a formula for the height of such polynomial and characterize all flat polynomials…

Number Theory · Mathematics 2014-07-15 Bartlomiej Bzdega

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

Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that…

Number Theory · Mathematics 2019-03-19 Tai Do Duc , Ka Hin Leung , Bernhard Schmidt

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

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

Number Theory · Mathematics 2017-09-01 Simon Macourt

This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If $a_r$ is the coefficient of the $q^r$ term in the chromatic polynomial $P(G,q)$, where…

Combinatorics · Mathematics 2007-05-23 Shu-Chiuan Chang

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

Number Theory · Mathematics 2025-08-06 Laura De Carli , Maurizio Laporta

Let $P$ be a polynomial of degree $d$ in independent Bernoulli random variables which has zero mean and unit variance. The Bonami hypercontractivity bound implies that the probability that $|P| > t$ decays exponentially in $t^{2/d}$.…

Probability · Mathematics 2022-02-21 Bo'az Klartag , Sasha Sodin

We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.

Number Theory · Mathematics 2017-03-28 Simon Macourt

We present a lower bound on the Kronecker coefficients for tensor squares of the symmetric group via the characters of~$S_n$, which we apply to obtain various explicit estimates. Notably, we extend Sylvester's unimodality of $q$-binomial…

Combinatorics · Mathematics 2016-05-04 Igor Pak , Greta Panova

This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…

Combinatorics · Mathematics 2017-02-15 Zhongshan Li , Fuzhen Zhang , Xiao-Dong Zhang

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

Let a_n(k) be the kth coefficient of the nth cyclotomic polynomial Phi_n(x). As n ranges over the integers, a_n(k) assumes only finitely many values. For any such value v we determine the density of integers n such that a_n(k)=v. Also we…

Number Theory · Mathematics 2012-07-30 Yves Gallot , Pieter Moree , Huib Hommersom

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