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 and c_2 such that $$c_1 x/(log x) \leq F(x) \leq c_2 x/(log x).$$
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We give necessary conditions satisfied by the set of odd prime divisors of binary perfect polynomials. This allows us to get a new characterization of all the known perfect binary polynomials.
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 divisors of some single polynomial. By combining this result with a theorem of Ax we get that for any system $F$ of multivariate polynomial equations with integer coefficients, the set of primes $p$ for which $F$ is solvable modulo $p$ is the set of prime divisors of some univariate polynomial. In addition, we prove results on the densities of the prime divisors of…
In this article, we prove an asymptotic formula for mean values of long Dirichlet polynomials with higher order shifted divisor functions, assuming a smoothed additive divisor conjecture for higher order shifted divisor functions. As a consequence of this work, we prove special cases of conjectures of Conrey-Keating on mean values of long Dirichlet polynomials with higher order shifted divisor functions as coefficients.
In this paper, we obtain analogues of Zsigmondy's theorem and the primitive divisor results for the Lucas and Lehmer sequences in polynomial rings of several variables.
On Divisor Function Polynomials and Dirichlet Series
该研究针对和集系计数函数推导狄利克雷级数与收敛界，定义并研究了除数函数多项式，揭示其与伯努利数、有序贝尔多项式的关联。
Let $\mathcal{A}$ and $\mathcal{B}$ be sets of polynomials of degree $n$ over a finite field. We show, that if $\mathcal{A}$ and $\mathcal{B}$ are large enough, then $A+B$ has an irreducible divisor of large degree for some $A\in\mathcal{A}$ and $B\in \mathcal{B}$.
Given a polynomial $ϕ$ over a global function field $K$ and a wandering base point $b\in K$, we give a geometric condition on $ϕ$ ensuring the existence of primitive prime divisors for almost all points in the orbit $\mathcal{O}_ϕ(b):=\{ϕ^n(b)\}_{n\geq0}$
This paper deals with function field analogues of famous theorems of Laudau which counted the number of integers which have $t$ prime factors and R. Hall which researched the distribution of divisors of integers in residue classes.\;We extend the Selberg-Delange method to handle the following problems.\;The number of monic polynomials with degree $n$ have $t$ irreducible factors;\;The number of monic polynomials with degree $n$ in some residue classes have $t$ irreducible factors and the residue classes distribution of divisors of monic polynomial.\;
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 proportion of polynomials, whose set of degrees of divisors has no gaps of size greater than $m$. To that end, we first derive an improved estimate for the proportion of polynomials of degree $n$, all of whose non-constant divisors have degree greater than $m$. In the limit as $q \to \infty$, these results coincide with corresponding estimates related to the c…
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 result for the function field analogue of a classical problem in number theory.
The divisor function along arithmetic progressions and binary cubic polynomials
该研究提出带两个小因子模的算术级数中除数函数的新等分布估计，给出两项应用：指数2/3的几乎所有模的算术级数上除数函数的渐近公式，以及沿非齐次二元三次多项式XY²+1的除数函数渐近公式。
All bi-unitary perfect polynomials over $\F_2$ with only Mersenne primes as odd divisors
该研究针对二元素域$\boldsymbol{\text{F}}_2$，找到了仅以梅森多项式为奇不可约因子的所有非分裂双酉完美多项式，是经典算术问题的多项式变体研究成果。
We give an asymptotic formula for the divisor sum $\sum_{c<n\leq N}τ\left((n-b)(n-c)\right)$ for integers $b<c$ of the same parity. Interestingly, the coefficient of the main term does not depend on the discriminant as long as it is a full square. We also provide effective upper bounds of the average divisor sum for some of the reducible quadratic polynomials considered before, with the same main term as in the asymptotic formula.
Consider the divisor sum $\sum_{n\leq N}τ(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 the maximal possible number of $D(-1)$-quadruples.
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 polynomials $f(x) \in \mathbb{Z}[x]$ to satisfy $f(p) \mid f(p^{p})$ for all primes $p$.
Mean values of long Dirichlet polynomials with divisor coefficients
本文研究带除数系数的长光滑Dirichlet多项式的均值问题，借助已有一般性定理推导出含所有低阶项与幂节省误差项的渐近公式，在除数函数情形下强化了Conrey与Gonek的猜想。
Motivated by a question of Venkataramana, we consider the greatest common divisor of $ϕ(f(n))$ where $f$ is a primitive polynomial with integer coefficients, and $n$ ranges over all natural numbers. Assuming Schinzel's hypothesis, we establish that this gcd may be bounded just in terms of the degree of the polynomial $f$. Unconditionally we establish such a bound for quadratic polynomials, as well as polynomials that split completely into linear factors. The paper also addresses a question of Calegari, and establishes that there are infinitely many $n$ such that $n^2+1$ is not divisible by any…
The only (unitary) perfect polynomials over $\mathbb{F}_2$ that are products of $x$, $x+1$ and Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$. Other consequences of such a factorization are new results about odd perfect polynomials.
A positive integer $n$ is called $φ$-practical if the polynomial $X^n-1$ has a divisor in $\mathbb{Z}[X]$ of every degree up to $n$. In this paper, we show that the count of $φ$-practical numbers in $[1, x]$ is asymptotic to $C x/\log x$ for some positive constant $C$ as $x \rightarrow \infty$.
Divisor moments of polynomials in Fourier coefficients of modular forms
研究非CM新形式傅里叶系数多项式表达式上除数函数高阶矩，证明中对数指数取决于多项式不可约因子数且在佐藤-泰特限制下不变，结合多种定理及算术、均值估计得出结论。
We address an arithmetic problem in the ring $\F_2[x]$ related to the fixed points of the sum of divisors function. We study some binary polynomials $A$ such that $σ(A)/A $ is still a binary polynomial. Technically, we prove that the only (unitary) perfect polynomials over $\F_2$ that are products of $x$, $x+1$ and of Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$.
Greatest common divisors for polynomials in almost units and applications to linear recurrence sequences
本文利用 Schmidt 子空间定理界定互素多元多项式在代数数处取值的最大公因子，并将其应用于改进两类线性递推序列项间 gcd 的已有结果。
In a recent paper, Lapkova uses a Tauberian theorem to derive the asymptotic formula for the divisor sum $\sum_{n \leq x} d( n (n+v))$ where $v$ is a fixed integer and $d(n)$ denotes the number of divisors of $n$. We reprove her result by following a suggestion of Hooley, namely investigating the relationship between this sum and the well-known sum $\sum_{n \leq x} d( n ) d (n+v)$. As such, we are able to furnish additional terms in the asymptotic formula.
On the greatest common divisor of integer parts of polynomials
本文受Bergelson和Richter的问题启发，研究了正整数与多项式整数部分构成互素元组的计数问题，并给出了误差项强度依赖于首项系数丢番图性质的渐近公式。
We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too sparse, and we use it to compute the logarithm of the maximum of the divisor function at every degree up to an error of a constant, which is significantly smaller than in the case of the integers, even assuming the Riemann Hypothesis.
Consider the divisor sum $\sum_{n\leq N}τ(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main term. As an application we give an improvement of the maximal possible number of $D(-1)$-quadruples.
Generalized cyclotomic polynomials associated with regular systems of divisors and arbitrary sets of positive integers
本文引入与正则除数系和任意正整数集相关的广义分圆多项式，证明其具有整数系数并可分解为经典分圆多项式的乘积，同时给出新的 Menon 型恒等式。
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 determine the order of magnitude of $H_F(x, y, z)$ uniformly for $y+y/\log^C y < z\le y^2$ and $y\le x^{1-δ}$, showing that the order is the same as the order of $H(x,y,z)$, the number of positive integers $n\le x$ with a divisor in $(y,z]$. Here $C$ is an arbitrarily large constant and $δ>0$ is arbitrarily small.
Let $F({\bf x})={\bf x}^tQ_{\bf x}+\mathbf{b}^t{\bf x}+c\in\mathbb{Z}[{\bf x}]$ be a quadratic polynomial in $\ell (\ge 3 )$ variables ${\bf x} =(x_{1},...,x_{\ell})$, where $F({\bf x})$ is positive when ${\bf x}\in\mathbb{R}_{\ge 1}^{\ell}$, $Q\in {\rm M}_{\ell}(\mathbb{Z})$ is an $\ell\times\ell$ matrix and its discriminant $\det\left(Q^t+Q\right)\neq 0$. It gives an explicit asymptotic formula for the following sum \[\sum_{{\bf x}\in [1,X]^{\ell}\cap\mathbb{Z}^{\ell}}τ\left(F({\bf x})\right), \] where $τ$ is the divisor function.
We show that if two monic polynomials with integer coefficients have square-free resultant, then all positive divisors of the resultant arise as the greatest common divisor of the values of the two polynomials at a suitable integer.
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 $x^{pq^b}-1$ and prove that some conjectures on the maximal height of divisors of $x^{pq^b}-1$ are true.
Let $F({\bf x})\in\mathbb{Z}[x_1,x_2,\dots,x_n]$ be a quadratic polynomial in $n\geq 3$ variables with a nonsingular quadratic part. Using the circle method we derive an asymptotic formula for the sum $$ Σ_{k,F}(X; {\mathcal{B}})=\sum_{{\bf x}\in X\mathcal{B}\cap\mathbb{Z}^{n}}τ_{k}\left(F({\bf x})\right), $$ for $X$ tending to infinity, where $\mathcal{B}\subset\mathbb{R}^n$ is an $n$-dimensional box such that $\min\limits_{{\bf x}\in X\mathcal{B}}F({\bf x})\ge 0$ for all sufficiently large $X$, and $τ_{k}(\cdot)$ is the $k$-th divisor function for any integer $k\ge 2$.
Primitive prime divisors play an important role in group theory and number theory. We study a certain number theoretic quantity, called $Φ^*_n(q)$, which is closely related to the cyclotomic polynomial $Φ_n(x)$ and to primitive prime divisors of $q^n-1$. Our definition of $Φ^*_n(q)$ is novel, and we prove it is equivalent to the definition given by Hering. Given positive constants $c$ and $k$, we give an algorithm for determining all pairs $(n,q)$ with $Φ^*_n(q)\le cn^k$. This algorithm is used to extend (and correct) a result of Hering which is useful for classifying certain families of subgr…
Algorithmic aspects of Newman polynomials and their divisors
研究确定哪些整数多项式能整除新曼多项式，发现一个度数为10的多项式不整除任何新曼多项式，改进了关于所有整数多项式均能整除新曼多项式的上界。
In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper is concerned with the precise input of the conjectural formula for the classical shifted convolution problem for divisor sums so as to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of length up to $T^2$ with divisor functions as coefficients.
Let $ \mathbb{F}_q[T]$\, be the ring of polynomials over a finite field $ \mathbb{F}_q $. Let $ g: \mathbb{F}_q[T] \rightarrow \mathbb{R} $ be a multiplicative function such that for any irreducible polynomial $ P $ over $ \mathbb{F}_q $ and any $ k \ge 1 $, the equality $ d_k = g (P ^ k) $ holds for some arbitrary sequence of reals $\{d_k\}_{k=1}^{\infty}$. In this paper, we get an explicit formula for the sum $$ T (N) = \sum\limits_{\substack{°F=N F \text{ is monic}}}{g (F)}, $$ and also derive different asymptotics when this sum in cases of $ q \to \infty; \ q \to \infty, \ N \to \infty; \ …
The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best possible upper bound of n^{ψ(n)} for almost all n, where ψ(n) is any function that approaches infinity as n tends to infinity. We will discuss the related problem of bounding the maximal height over all polynomial divisors of x^n - 1 and give an analogue of Maier's result in this scenario.
Let $F({\bf x})={\bf x}^tQ_m{\bf x}+\mathbf{b}^t{\bf x}+c\in\mathbb{Z}[{\bf x}]$ be a quadratic polynomial in $\ell (\ge 3 )$ variables ${\bf x} =(x_{1},...,x_{\ell})$, where $F({\bf x})$ is positive when ${\bf x}\in\mathbb{R}_{\ge 1}^{\ell}$, $Q_m\in {\rm M}_{\ell}(\mathbb{Z})$ is an $\ell\times\ell$ matrix and its discriminant $\det\left(Q_m^t+Q_m\right)\neq 0$. It gives explicit asymptotic formulas for the following sum \[ T_{k,F}(X)=\sum_{{\bf x}\in [1,X]^{\ell}\cap\mathbb{Z}^{\ell}}τ_{k}\left(F({\bf x})\right) \] with the help of the circle method. Here $τ_{k}(n)=\#\{(x_1,x_2,...,x_{k})\i…
For a prime number $p$ we study the zeros modulo $p$ of divisor polynomials of rational elliptic curves $E$ of conductor $p$. Ono made the observation that these zeros of are often $j$-invariants of supersingular elliptic curves over $\overline{\mathbb{F}_p}$. We show that these supersingular zeros are in bijection with zeros modulo $p$ of an associated quaternionic modular form $v_E$. This allows us to prove that if the root number of $E$ is $-1$ then all supersingular $j$-invariants of elliptic curves defined over $\mathbb{F}_{p}$ are zeros of the corresponding divisor polynomial. If the roo…
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 polynomial x^n-1 has a divisor in F_p[x] of every degree up to n, where p is a rational prime. Assuming the validity of the Generalized Riemann Hypothesis, we show that such integers n have asymptotic density 0.
In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper begins the general study of what we call Type II sums which utilize a circle method framework and a convolution of shifted convolution sums to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of length up to $T^3$ with divisor functions as coefficients.
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 integer $n$, we also obtain a complete description of the ideal of polynomials in $\mathbb{Z}[X]$ whose fixed divisor is divisible by $p^n$ in terms of its primary components.
In this series of papers we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper completes the general study of what we call Type II sums which utilize a circle method framework and a convolution of shifted convolution sums to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of arbitrary length with divisor functions as coefficients.
We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must have density zero, regardless of choice of a_0. The proof relies on tools from group theory and probability theory to develop a zero-density criterion in terms of arithmetic properties of the forward orbit of the critical point of f. This provides an analogy to results in real and complex dynamics, where analytic properties of the forward orbit of the critica…
We consider a few modifications of the Big prime modular $\gcd$ algorithm for polynomials in $\Z[x]$. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors of a resultant and on finding preliminary bounds on degrees of common divisors using auxiliary primes. These modifications are used to suggest improved algorithms for $\gcd$ calculation and for coprime polynomials detection. To illustrate the ideas we apply the constructed algorithms on certain polynomials, in particular, on polynomials from Knuth's example o…
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 fixed divisors in various algebraic settings as well as the applications of fixed divisors to various algebraic and number theoretic problems. The work is presented in an orderly fashion so as to start from the simplest case of $\Z,$ progressively leading up to the case of Dedekind domains. We also ask a few open questions according to their context, which …
Greatest common divisors of values of integer polynomials and an application to maximal tori
本文给出计算两个整系数多项式在所有整数点取值的最大公因数的方法，并将其用于确定例外李型群中全部极大环面的初等因子结构。
On the largest prime divisor of polynomial and related problem
本文研究多项式值的最大素因子问题，识别出满足整除阶乘性质的多项式，并对三次、可约四次及Chebyshev多项式分别给出最大素因子的上界估计。
Let $d \ge 3$ be an integer and let $P \in \mathbb{Z}[x]$ be a polynomial of degree $d$ whose Galois group is $S_d$. Let $(a_n)$ be a linearly recuresive sequence of integers which has $P$ as its characteristic polynomial. We prove, under the generalized Riemann hypothesis, that the lower density of the set of primes which divide at least one element of the sequence $(a_n)$ is positive.
Let $F$ be a number field, $O_F$ the integral closure of $\mathbb{Z}$ in $F$ and $P(T) \in O_F[T]$ a monic separable polynomial such that $P(0) \not=0$ and $P(1) \not=0$. We give precise sufficient conditions on a given positive integer $k$ for the following condition to hold: there exist infinitely many non-zero prime ideals $\mathcal{P}$ of $O_F$ such that the reduction modulo $\mathcal{P}$ of $P(T)$ has a root in the residue field $O_F/\mathcal{P}$, but the reduction modulo $\mathcal{P}$ of $P(T^k)$ has no root in $O_F/\mathcal{P}$. This makes a result from a previous paper (motivated by a …
Let D be a Krull domain and Int(D) the ring of integer-valued polynomials on D. For any f in Int(D), we explicitly construct a divisor homomorphism from [f], the divisor-closed submonoid of Int(D) generated by f, to a finite sum of copies of (N_0,+). This implies that [f] is a Krull monoid. For V a discrete valuation domain, we give explicit divisor theories of various submonoids of Int(V). In the process, we modify the concept of polynomial closure in such a way that every subset of D has a finite polynomially dense subset. The results generalize to Int(S,V), the ring of integer-valued polyno…
Non-splitting bi-unitary perfect polynomials over $\mathbb{F}_4$ with less than five prime factors
本文确定了有限域 $\mathbb{F}_4$ 上所有至多包含四个不可约因子的非分裂双酉完美多项式，并指出此类因子有无限多个。
Divisors in Residue Classes Revisited
针对Lenstra提出的剩余类除数算法无法直接推广到更大欧几里得数环的问题，本文提出一种可推广到更大类欧几里得环与多项式环$\mathbb{Z}[x]$的新方法，经实现计时证实其具备多项式运行时间。
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the simplest model. Explicit formulas defining reduced divisors for some particular cases are found. The reduced divisors are obtained in the form of solution of the Jacobi inversion problem which provides the way of computing Abelian functions on arbitrary non-special divisors. An effective reduction algorithm is proposed, which has the advantage that it involve…
The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having the same prime factors are called exponentially coprime if $(a_i,b_i)=1$ for every $1\le i\le r$. In the paper we investigate asymptotic properties of certain arithmetic functions involving exponential divisors and exponentially coprime integers.
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of terms with a primitive divisor has a natural density. We discuss two heuristic arguments to suggest a value for that density, one using recent advances made about the distribution of roots of polynomial congruences.
Let $(b_n) = (b_1, b_2, ...)$ be a sequence of integers. A primitive prime divisor of a term $b_k$ is a prime which divides $b_k$ but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial $f(z)$ is a sequence of integers $(c_n)$ where the $n$-th term is the $n$-th iterate of $f$ at 0. We consider primitive prime divisors of zero orbits of polynomials. In this note, we show that for integers $c$ and $d$, where $d > 1$ and $c \neq \pm 1$, every iterate in the zero orbit of $f(z) = z^d + c$ contains a primitive prime whenever zero has an infinite orbit. If $c = \…
We investigate a relationship between MacMahon's generalized sum-of-divisors functions and Chebyshev polynomials of the first kind. This determines a recurrence relation to compute these functions, as well as proving a conjecture of MacMahon about their general form by relating them to quasi-modular forms. These functions arise as solutions to a curve-counting problem on Abelian surfaces.
Primitive Divisors of Lucas Sequences in Polynomial Rings
本文研究多项式环中 Lucas 序列的本原除子，建立与经典正则 Lucas 序列相对应的结果，并纠正既有定理。
In this article we extend a theorem of Andrews, Crippa, and Simon on the asymptotic behavior of polynomials defined by a general class of recursive equations. Here the polynomials are in the variable $q$, and the recursive definition at step $n$ introduces a polynomial in $n$. Our extension replaces the polynomial in $n$ with either an exponential or periodic function of $n$.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。