English
Related papers

Related papers: On Arithmetic Progressions of Powers in Cyclotomic…

200 papers

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

Number Theory · Mathematics 2018-11-29 Michael A. Bennett , Greg Martin , Kevin O'Bryant , Andrew Rechnitzer

We get some results about the factorization of $\phi_p(M) \in {\mathbb{F}}_2[x]$, where $p$ is a prime number, $\phi_p$ is the corresponding cyclotomic polynomial and $M$ is a Mersenne prime (polynomial). By the way, we better understand…

Number Theory · Mathematics 2021-06-21 Luis H. Gallardo , Olivier Rahavandrainy

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

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 $p$ be a prime and $q$ a power of $p$. For $n\ge 0$, let $g_{n,q}\in\Bbb F_p[{\tt x}]$ be the polynomial defined by the functional equation $\sum_{a\in\Bbb F_q}({\tt x}+a)^n=g_{n,q}({\tt x}^q-{\tt x})$. When is $g_{n,q}$ a permutation…

Combinatorics · Mathematics 2012-08-15 Neranga Fernando , Xiang-dong Hou , Stephen D. Lappano

Let $S_p(n)$ denote the sum of $p$th powers of the first $n$ positive integers $1^p + 2^p + \cdots + n^p$. In this paper, first we express $S_p(n)$ in the so-called Faulhaber form, namely, as an even or odd polynomial in $(n + 1/2)$,…

Number Theory · Mathematics 2021-03-16 José L. Cereceda

For functions $f$ in Dirichlet-type spaces we study how to determine constructively optimal polynomials $p_n$ that minimize $\|p f-1\|_\alpha$ among all polynomials $p$ of degree at most $n$. Then we give upper and lower bounds for the rate…

Classical Analysis and ODEs · Mathematics 2015-07-03 Catherine Bénéteau , Alberto Condori , Constanze Liaw , Daniel Seco , Alan Sola

We identify new sufficiency conditions for coercivity of general multivariate polynomials $f\in\mathbb{R}[x]$ which are expressed in terms of their Newton polytopes at infinity and which consist of a system of affine-linear inequalities in…

Optimization and Control · Mathematics 2020-01-13 Tomas Bajbar , Yoshiyuki Sekiguchi

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

Number Theory · Mathematics 2012-03-06 Lior Bary-Soroker , Moshe Jarden

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

Cyclotomic polynomials play an important role in several areas of mathematics and their study has a very long history, which goes back at least to Gauss (1801). In particular, the properties of their coefficients have been intensively…

Number Theory · Mathematics 2021-12-16 Carlo Sanna

For a prime p and nonnegative integers n,k, consider the set A_{n,k}^{(p)}={x is in [0,1,...,n]: p^k||binom {n} {x}}. Let the expansion of n+1 in base p be: n+1=alpha_{0} p^{\nu}+alpha_{1}p^{nu-1}+...+alpha_{nu}, where 0<=alpha_{i}<=…

Number Theory · Mathematics 2009-07-31 Vladimir Shevelev

Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$, we say an index $i$ is a peak if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$. Given any set $S$ of positive integers, define…

Combinatorics · Mathematics 2024-06-05 Sara Billey , Matthew Fahrbach , Alan Talmage

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

Number Theory · Mathematics 2025-11-04 Boyuan Xiong

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Number Theory · Mathematics 2018-10-16 Oleksiy Klurman , Marc Munsch

Let $\Phi_n(q)$ be the $n$-th cyclotomic polynomial in $q$. Recently, the author and Zudilin provide a creative microscoping method to prove some $q$-supercongruences mainly modulo $\Phi_n(q)^3$ by introducing an additional parameter $a$.…

Number Theory · Mathematics 2018-12-18 Victor J. W. Guo

Mersenne primes and Fermat primes may be thought of as primes of the form $\Phi_m(2)$, where $\Phi_m(x)$ is the $m$th cyclotomic polynomial. This paper discusses the more general problem of primes and composites of this form.

Number Theory · Mathematics 2024-12-05 Carl Pomerance

Inspired by the recent work of Chen-Sti\'enon-Xu on Atiyah classes associated to inclusions of Lie algebroids, we give a very simple criterium (in terms of those classes) for relative Poincar\'e-Birkhoff-Witt type results to hold. The tools…

Quantum Algebra · Mathematics 2016-01-21 Damien Calaque

Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpha^m>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha^{m-1}$. We prove that if there exist…

Number Theory · Mathematics 2023-01-03 Jitender Singh , Sanjeev Kumar

In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…

Computational Complexity · Computer Science 2025-10-01 Katzper Michno