二项式多项式的绝对不可约性
Absolute irreducibility of the binomial polynomials
摘要:
本文研究了整数值多项式环$\operatorname{Int}(\mathbb{Z})$中的二项式多项式$\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$及其幂的因式分解行为.虽然众所周知,二项式多项式是$\operatorname{Int}(\mathbb{Z})$中的不可约元素,但其幂的因式分解行为尚未完全理解。我们填补了这一空白,并表明,二项式多项式是绝对不可约的$\operatorname{Int}(\mathbb{Z})$,也就是说,$\binom{x}{n}^m$的因素,唯一的不可约元素在$\operatorname{Int}(\mathbb{Z})$的所有$m\in \mathbb{N}$。通过重新制定的问题,线性代数和数论,我们表明,这个问题可以减少到确定的秩,我们称之为,评价矩阵的$n$。计算这个秩的一个主要因素是下面的数论结果,我们也提供了一个证明:如果$n>10$和$n$,$n-1$,\ldots,$n-(k-1)$是复合整数,那么存在一个素数$p > 2k$,可以整除这些整数之一。
英文摘要:
In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is well-known that the binomial polynomials are irreducible elements in $\operatorname{Int}(\mathbb{Z})$, the factorization behaviour of their powers has not yet been fully understood. We fill this gap and show that the binomial polynomials are absolutely irreducible in $\operatorname{Int}(\mathbb{Z})$, that is, $\binom{x}{n}^m$ factors uniquely into irreducible elements in $\operatorname{Int}(\mathbb{Z})$ for all $m\in \mathbb{N}$. By reformulating the problem in terms of linear algebra and number theory, we show that the question can be reduced to determining the rank of, what we call, the valuation matrix of $n$. A main ingredient in computing this rank is the following number-theoretical result for which we also provide a proof: If $n>10$ and $n$, $n-1$, \ldots, $n-(k-1)$ are composite integers, then there exists a prime number $p > 2k$ that divides one of these integers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。