English
Related papers

Related papers: Bounds on ternary cyclotomic coefficients

200 papers

Let $g(f)$ denote the maximum of the differences (gaps) between two consecutive exponents occurring in a polynomial $f$. Let $\Phi_n$ denote the $n$-th cyclotomic polynomial and let $\Psi_n$ denote the $n$-th inverse cyclotomic polynomial.…

Number Theory · Mathematics 2011-01-25 Hoon Hong , Eunjeong Lee , Hyang-Sook Lee , Cheol-Min Park

We generalize the definition of overconvergent $p$-adic multiple polylogarithms and of $p$-adic cyclotomic multiple zeta values and we prove a bound on their norm. A byproduct of the proof is a characterization of these objects in terms of…

Number Theory · Mathematics 2020-05-21 David Jarossay

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

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

A short note on bounds on distance to variety of a point in terms of the Taylor coefficients at the point.

Complex Variables · Mathematics 2017-01-31 Vikram Sharma

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…

Number Theory · Mathematics 2022-08-01 Ala'a Al-Kateeb , Afnan Dagher

Let $a(n, k)$ be the $k$-th coefficient of the $n$-th cyclotomic polynomial. Recently, Ji, Li and Moree \cite{JLM09} proved that for any integer $m\ge1$, $\{a(mn, k)| n, k\in\mathbb{N}\}=\mathbb{Z}$. In this paper, we improve this result…

Number Theory · Mathematics 2009-09-08 Pingzhi Yuan

We use Turan type inequalities to give new non-asymptotic bounds on the extreme zeros of orthogonal polynomials in terms of the coefficients of their three term recurrence. Most of our results deal with symmetric polynomials satisfying the…

Classical Analysis and ODEs · Mathematics 2025-10-20 Ilia Krasikov

The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these polynomials can be realized as Ehrhart polynomials of inside-out…

Combinatorics · Mathematics 2010-04-21 Felix Breuer , Aaron Dall

In a recent paper, Bruns and von Thaden established a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves…

Combinatorics · Mathematics 2021-02-10 Michael von Thaden

We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…

Combinatorics · Mathematics 2014-04-30 Nicolas Bonifas , Marco Di Summa , Friedrich Eisenbrand , Nicolai Hähnle , Martin Niemeier

We extend the best known bound on the largest subset of {1,2,...,N} with no square differences to the largest possible class of quadratic polynomials.

Classical Analysis and ODEs · Mathematics 2012-03-29 Mariah Hamel , Neil Lyall , Alex Rice

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

Given $n$ polynomials $p_1, \dots, p_n$ of degree at most $n$ with $\|p_i\|_\infty \le 1$ for $i \in [n]$, we show there exist signs $x_1, \dots, x_n \in \{-1,1\}$ so that \[\Big\|\sum_{i=1}^n x_i p_i\Big\|_\infty < 30\sqrt{n}, \] where…

Classical Analysis and ODEs · Mathematics 2020-09-30 Victor Reis

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…

Complex Variables · Mathematics 2024-03-22 Marko Slapar

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

Combinatorics · Mathematics 2021-11-02 Zhicheng Gao

We derive upper bounds for probabilities of the form $P(g(\mathbf{X})\geq t)$ using the southwest boundary (recently introduced in our previous work) $\partial_{\mathrm{SW}} Q(g^{-1}[t,\infty))$, where $Q$ is a reflection to the first…

Probability · Mathematics 2026-04-27 Stephen Jordan Harrison

We give a bound on the order of the Schur multiplier of $p$-groups refining earlier bounds. As an application we complete the classification of groups having Schur multiplier of maximum order. Finally we prove that the order of the Schur…

Group Theory · Mathematics 2017-05-09 Pradeep K. Rai

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

Combinatorics · Mathematics 2022-05-17 Sergey Agievich

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

Number Theory · Mathematics 2015-10-21 Kostadinka Lapkova