Absolute irreducibility of the binomial polynomials (Q2664481)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7335721
Language Label Description Also known as
default for all languages
No label defined
    English
    Absolute irreducibility of the binomial polynomials
    scientific article; zbMATH DE number 7335721

      Statements

      Absolute irreducibility of the binomial polynomials (English)
      0 references
      0 references
      0 references
      20 April 2021
      0 references
      The main objects of study in the paper under review are the binomial polynomials \(\binom{x}{n}=\frac{x(x-1)\ldots(x-n+1)}{n!},\ n\geq 1\) as elements of \(\text{Int}(\mathbb{Z})=\{f\in\mathbb{Q}[x]\ \vert\ f(\mathbb{Z})\subseteq\mathbb{Z}\}.\) It is well-known that the binomial polynomials \(\binom{x}{n}\) are irreducible in \(\text{Int}(\mathbb{Z}).\) Then main result of the paper is that the binomial polynomials are absolutely irreducible in \(\text{Int}(\mathbb{Z})\), that is all the powers \(\binom{x}{n}^m,\ m\geq 1,\) factor uniquely into irreducible elements. The proof is quite elaborated, reformulating the problem in terms of linear algebra and number theory.
      0 references
      integer-valued polynomials
      0 references
      binomial polynomials
      0 references
      absolutely irreducible elements
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references