English
Related papers

Related papers: Variations on a question concerning the degrees of…

200 papers

In a recent paper, we considered integers n for which the polynomial x^n - 1 has a divisor in Z[x] of every degree up to n, and we gave upper and lower bounds for their distribution. In this paper, we consider those n for which the…

Number Theory · Mathematics 2012-06-19 Lola Thompson

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

Number Theory · Mathematics 2011-11-24 Lola Thompson

Define B(n) to be the largest height of a polynomial in $\mathbb{Z}[x]$ dividing $x^n-1$. We formulate a number of conjectures related to the value of B(n) when $n$ is of a prescribed form. Additionally, we prove a lower bound for…

Number Theory · Mathematics 2010-09-30 Nathan C. Ryan , Bryan C. Ward , Ryan Ward

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

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

Number Theory · Mathematics 2013-08-15 Alexei Entin

Fix a field $F$. In this paper, we study the sets $\D_F(n) \subset [0,n]$ defined by [\D_F(n):= {0 \leq m \leq n: T^n-1\text{has a divisor of degree $m$ in} F[T]}.] When $\D_F(n)$ consists of all integers $m$ with $0 \leq m \leq n$, so that…

Number Theory · Mathematics 2012-06-12 Paul Pollack , Lola Thompson

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

Number Theory · Mathematics 2020-06-02 Olli Järviniemi

Let $\omega^*(n)$ denote the number of divisors of $n$ that are shifted primes, that is, the number of divisors of $n$ of the form $p-1$, with $p$ prime. Studied by Prachar in an influential paper from 70 years ago, the higher moments of…

Number Theory · Mathematics 2024-03-20 Steve Fan , Carl Pomerance

We characterize all monic polynomials $f(x) \in \mathbb{Z}[x]$ that have the property that \[f(p) \mid f(p^{p}),~\text{for all sufficiently large primes }p \geq N(f). \] We also give necessary conditions and a sufficient condition for monic…

Number Theory · Mathematics 2022-02-07 Benjamin Klahn

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

Discrete Mathematics · Computer Science 2021-04-10 Rachel N. Berman , Ron M. Roth

We study the splitting fields of the family of polynomials $f_n(X)= X^n-X-1$. This family of polynomials has been much studied in the literature and has some remarkable properties. Serre related the function on primes $N_p(f_n)$, for a…

Number Theory · Mathematics 2022-11-01 Chandrashekhar B. Khare , Alfio Fabio La Rosa , Gabor Wiese

Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Guoyou Qian

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

Number Theory · Mathematics 2016-05-25 Andreas Weingartner

In this article, we compile the work done by various mathematicians on the topic of the fixed divisor of a polynomial. This article explains most of the results concisely and is intended to be an exhaustive survey. We present the results on…

Number Theory · Mathematics 2020-09-02 Devendra Prasad , Krishnan Rajkumar , A. Satyanarayana Reddy

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

The height of a polynomial $f(x)$ is the largest coefficient of $f(x)$ in absolute value. Let B(n) be the largest height of a polynomial in $\mathbb{Z}[x]$ dividing $x^n-1$. In this paper we investigate the maximal height of divisors of…

Number Theory · Mathematics 2014-01-13 Shaozu Wang

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 study the existence of non-special divisors of degree $g$ and $g-1$ for algebraic function fields of genus $g\geq 1$ defined over a finite field $\F_q$. In particular, we prove that there always exists an effective non-special divisor of…

Number Theory · Mathematics 2007-05-23 Stephane Ballet , Dominique Le Brigand

Let $x$ and $n$ be positive integers. We prove a non-trivial lower bound for $x$, dependant only on $\omega_n$, the number of distinct prime factors of $x^n-1$. By considering the divisibility of $\varphi \mid x^n-1$ for $\varphi \mid n$,…

Number Theory · Mathematics 2024-12-03 Gustav Kjærbye Bagger

Let $n$ be a positive integer and $f(x) := x^{2^n}+1$. In this paper, we study orders of primes dividing products of the form $P_{m,n}:=f(1)f(2)\cdots f(m)$. We prove that if $m > \max\{10^{12},4^{n+1}\}$, then there exists a prime divisor…

Number Theory · Mathematics 2019-12-10 Stephan Baier , Pallab Kanti Dey
‹ Prev 1 2 3 10 Next ›