English
Related papers

Related papers: Factorization of cyclotomic polynomial values at M…

200 papers

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

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

Number Theory · Mathematics 2007-05-23 K. Belabas , M. van Hoeij , J. Klueners , A. Steel

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

We characterize the fixed divisor of a polynomial $f(X)$ in $\mathbb{Z}[X]$ by looking at the contraction of the powers of the maximal ideals of the overring ${\rm Int}(\mathbb{Z})$ containing $f(X)$. Given a prime $p$ and a positive…

Commutative Algebra · Mathematics 2018-10-03 Giulio Peruginelli

We consider the distance to the nearest integer of f(p), where f is a quadratic polynomial with irrational leading coefficient. This distance is very small as a function of p, for infinitely many primes p. We give a 14% improvement in the…

Number Theory · Mathematics 2017-04-21 Roger Baker

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

Number Theory · Mathematics 2016-04-25 Michele Elia , Federico Pintore

Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})<p^{\alpha}$ and $f(p)\vert f(p^{\alpha})$. Suppose also that any prime that…

Number Theory · Mathematics 2015-01-27 Colin Defant

For a fixed prime $p$, the maximum coefficient (in absolute value) $M(p)$ of the cyclotomic polynomial $\Phi_{pqr}(x)$, where $r$ and $q$ are free primes satisfying $r>q>p$ exists. Sister Beiter conjectured in 1968 that $M(p)\le(p+1)/2$. In…

Number Theory · Mathematics 2020-08-27 Cristian Cobeli , Yves Gallot , Pieter Moree , Alexandru Zaharescu

The Mersenne primes are primes which can be written as some prime power of 2 minus 1. These primes were studied from antiquity in that their close connection with perfect numbers and even to present day in that their easiness for primality…

Number Theory · Mathematics 2022-08-09 Taekyun Kim , Dae san Kim

This paper was removed due to an error in the proof (Claim 4.12 as stated is not true). The authors would like to thank Ilya Volkovich for pointing out a counterexample to this paper's main result in positive characteristic: If $F$ is a…

Computational Complexity · Computer Science 2014-08-10 Zeev Dvir , Rafael Mendes de Oliveira

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

Number Theory · Mathematics 2017-05-17 A. J. Irving

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We…

Number Theory · Mathematics 2018-09-07 Lucas Reis

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…

Number Theory · Mathematics 2012-04-23 Jens-Dietrich Bauch , Enric Nart , Hayden D. Stainsby

Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…

Number Theory · Mathematics 2021-10-11 Paolo Minelli

Define the $n$-th fibotomic polynomial to be the product of the monic irredicible factors of the $n$-th Fibonacci polynomial which are not factors of any Fibonacci polynomial of smaller degree. In this paper, we prove a number of properties…

Number Theory · Mathematics 2025-06-24 Cameron Byer , Tyler Dvorachek , Emily Eckard , Joshua Harrington , Lindsey Wise , Tony W. H. Wong

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

Number Theory · Mathematics 2023-08-28 Christian Elsholtz , Benjamin Klahn , Marc Technau

We study some properties of the exponents of the terms appearing in the splitting perfect polynomials over $\mathbb{F}_{p^2}$, where $p$ is a prime number. This generalizes the work of Beard et al. over $\mathbb{F}_p$. Corrected paper.…

Number Theory · Mathematics 2009-11-10 Luis H. Gallardo , Olivier Rahavandrainy

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

Number Theory · Mathematics 2007-05-23 Tom Weston , Elena Zaurova

Let G be a piecewise constant $n\times n$ matrix function which is defined on a smooth closed curve $\Gamma$ in the complex sphere and which has m jumps. We consider the problem of determining the partial indices of the factorization of the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Torsten Ehrhardt , Ilya M. Spitkovsky

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

Computational Complexity · Computer Science 2022-04-01 V. Arvind , Pushkar S. Joglekar
‹ Prev 1 4 5 6 7 8 10 Next ›