Root separation for reducible integer polynomials
英文摘要:
We construct parametric families of (monic) reducible polynomials having two roots very close to each other.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Yann Bugeaud, Andrej Dujella
We construct parametric families of (monic) reducible polynomials having two roots very close to each other.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
We study root separation of reducible monic integer polynomials of odd degree. Let h(P) be the naive height, sep(P) the minimal distance between two distinct roots of an integer polynomial P(x) and sep(P)=h(P)^{-e(P)}. Let e_r*(d)=limsup_{deg(P)=d, h(P)-> +infty} e(P), where the limsup is taken over the reducible monic integer polynomials P(x) of degree d. We prove that e_r*(d) <= d-2. We also obtain a lower bound for e_r*(d) for d odd, which improves previously known lower bounds for e_r*(d) when d = 5, 7, 9.
A Diophantine $m$-tuple is a set $A$ of $m$ positive integers such that $ab+1$ is a perfect square for every pair $a,b$ of distinct elements of $A$. We derive an asymptotic formula for the number of Diophantine quadruples whose elements are bounded by $x$. In doing so, we extend two existing tools in ways that might be of independent interest. The Erd\H os-Turán inequality bounds the discrepancy between the number of elements of a sequence that lie in a particular interval modulo 1 and the expected number; we establish a version of this inequality where the interval is allowed to vary. We also…
Hooley proved that if $f\in \Bbb Z [X]$ is irreducible of degree $\ge 2$, then the fractions $\{ r/n\}$, $0<r<n$ with $f(r)\equiv 0\pmod n$, are uniformly distributed in $(0,1)$. In this paper we study such problems for reducible polynomials of degree $2$ and $3$ and for finite products of linear factors. In particular, we establish asymptotic formulas for exponential sums over these normalized roots.
We prove some separation results for the roots of the generalized Fibonacci polynomials and their absolute values
While the separation (the minimal nonzero distance) between roots of a polynomial is a classical topic, its absolute counterpart (the minimal nonzero distance between their absolute values) does not seem to have been studied much. We present the general context and give tight bounds for the case of real roots.
We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).
Counting integer polynomials with several roots of maximal modulus
该研究对固定次数、高度有界且恰有指定数量最大模根的首一整系数多项式集合基数给出上下界,分别计数可约与不可约情形,得到全根等模的不可约多项式在奇偶次数下的数量估计。
$p$-Adic quotient sets: linear recurrence sequences with reducible characteristic polynomials
本文针对特征多项式在有理数域上可约的一类线性递推序列,解答了Sanna提出的判断其$p$-进商集在$p$-进数域中是否稠密的公开问题,补充了此前不可约情形下的相关研究结论。
Given an odd prime $p$, we provide formulas for the Hensel lifts of polynomial roots modulo $p$, and give an explicit factorization over the ring of formal power series with integer coefficients for certain reducible polynomials whose constant term is of the form $p^w$ with $w>1$. All of our formulas are given in terms of partial Bell polynomials and rely on the inversion formula of Lagrange.
Whittaker spaces for reducible unitary principal series representations of $\widetilde{SL_2(F)}$
本文研究了 Kubota 构造的 $\widetilde{SL_2(F)}$ 的可约幺正真主级数表示,计算了其两个不可约直和项的 Whittaker 泛函空间维数,探讨了特征标修改的影响,并应用于确定扭曲 Kazhdan-Patterson 覆盖的作用,适用于分歧与非分歧表示。
Upper Bounds on Polynomial Root Separation
本文证明了复系数多项式根分离度以Mahler测度和次数表示的上界,并指出该界在常数因子意义下最优,同时探讨了实根情形下的常数改进。
Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $β_1 < \dots < β_m$ the distinct real roots of the discriminant $Δ_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $γ$ be the number of real roots of $g(x)=\sum_{k=0}^s t_{s-k} x^{s-k}$. For any $ξ> | β_m |$, if $n-s$ is odd then the number of real roots of $f(ξ, x)$ is $γ+1$, and if $n-s$ is even then the number of real roots of $f(ξ, x)$ is $γ$, $γ+2$ if $t_s>0$ or $t_s < 0$ respectively. A special case of the above result is constructing a family of totally complex polynomials which are reducible over $\m…
We give a separation bound for the complex roots of a trinomial $f \in \mathbb{Z}[X]$. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of $f$; in particular, it is polynomial in $\log (°f)$. It is known that no such bound is possible for 4-nomials (polynomials with 4 monomials). For trinomials, the classical results (which are based on the degree of $f$ rather than the number of monomials) give separation bounds that are exponentially worse.As an algorithmic application, we show that the number of real roots of a trinomial $f$ can be comput…
Absolute root separation
该研究针对整系数多项式的绝对根分离问题,改进了现有相关下界,并通过低次数实验发现当前界仍偏保守。
p-adic root separation and the discriminant of integer polynomials
研究固定次数和有界高度的整数多项式的p-adic根分离问题,以及判别式被素数幂整除的计数问题,证明了存在大量具有几乎素数幂判别式的不可约多项式。
Intersective Polynomials and Universal Separation of Divosor Profiles
该研究针对任意次数的互素多项式对及所有次数不超过2的多项式对,分类了除数剖面的通用分离问题,得出互素多项式对通用无界分离的充要条件,并解决了次数不超过2的多项式对的有限p进边界问题,证明结合了根进展的一致殆素数值与自适应局部路由论证。
Consider a random polynomial $$ G_Q(x)=ξ_{Q,n}x^n+ξ_{Q,n-1}x^{n-1}+...+ξ_{Q,0} $$ with independent coefficients uniformly distributed on $2Q+1$ integer points $\{-Q, ..., Q\}$. Denote by $D(G_Q)$ the discriminant of $G_Q$. We show that there exists a constant $C_n$, depending on $n$ only such that for all $Q\ge 2$ the distribution of $D(G_Q)$ can be approximated as follows $$ \sup_{-\infty\leq a\leq b\leq\infty}|\mathbb{P}(a\leq \frac{D(G_Q)}{Q^{2n-2}}\leq b)-\int_a^bφ_n(x)\, dx|\leq\frac{C_n}{\log Q}, $$ where $φ_n$ denotes the distribution function of the discriminant of a random polynomial …
On the Natural Density of Monic Integer Polynomials with Roots in a Fixed Number Field
本文研究了具有固定数域根的单项整数多项式族的统计分布和渐进行为,通过结合马赫勒测度、狄利克雷单位定理和迪克辛策数的残差分析,证明了密度趋于零的速度依赖于多项式次数,并建立了几何数论原理的显式组合界限,用于计数可约和不可约多项式。
Primitive Quadratic Polynomials in Additive Coset Families
该研究针对奇素数幂\textit{q}>204931的情况,结合特征和估计、改进素数筛法及精确有限计算,证明了Gow–McGuire关于本原二次多项式的猜想3,同时也证明了该范围内的猜想1和2。
Let $K$ be a field of characteristic different from $2$, $\bar{K}$ its algebraic closure. Let $n \ge 3$ be an odd prime such that $2$ is a primitive root modulo $n$. Let $f(x)$ and $h(x)$ be degree $n$ polynomials with coefficients in $K$ and without repeated roots. Let us consider genus $(n-1)/2$ hyperelliptic curves $C_f: y^2=f(x)$ and $C_h: y^2=h(x)$, and their jacobians $J(C_f)$ and $J(C_h)$, which are $(n-1)/2$-dimensional abelian varieties defined over $K$. Suppose that one of the polynomials is irreducible and the other reducible. We prove that if $J(C_f)$ and $J(C_h)$ are isogenous ove…
Hilbert's Theorem 90, periodicity, and roots of Artin-Schreier polynomials
本文研究了特征为p>0的域扩张中希尔伯特定理90的周期性及Artin-Schreier多项式根的结构。
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。