Absolute irreducibility of the binomial polynomials

DOI10.1016/J.JALGEBRA.2021.03.007MaRDI QIDQ2664481zbMATH OpenOpenAlexFDO

Authors Roswitha Rissner, Daniel Windisch

Publication date 20 April 2021

Published in Journal of Algebra (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2009.02322

zbMATH Keywords

absolutely irreducible elementsbinomial polynomialsinteger-valued polynomials

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Matrices, determinants in number theory (11C20) Divisibility and factorizations in commutative rings (13A05) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Abstract: In this paper we investigate the factorization behaviour of the binomial polynomials $$ and their powers in the ring of integer-valued polynomials $operatornameInt(mathbbZ)$. While it is well-known that the binomial polynomials are irreducible elements in $operatornameInt(mathbbZ)$, 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 $operatornameInt(mathbbZ)$, that is, $$ factors uniquely into irreducible elements in $operatornameInt(mathbbZ)$ for all $minmathbbN$. 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.

Review text

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.

Recommendations

• Some results for the irreducibility of truncated binomial expansions
• Some irreducibility and indecomposability results for truncated binomial polynomials of small degree
• On the Irreducibility of Polynomials with Leading Coefficient Divisible by a Large Prime Power
• Absolute irreducibility of polynomials via Newton polytopes
• An irreducibility criterion for polynomials over integers

Cites work

• A construction of integer-valued polynomials with prescribed sets of lengths of factorizations
• A graph-theoretic criterion for absolute irreducibility of integer-valued polynomials with square-free denominator
• GRIMM'S CONJECTURE ON CONSECUTIVE INTEGERS
• Integer-valued polynomials
• Non-absolutely irreducible elements in the ring of integer-valued polynomials
• Non-unique factorizations. Algebraic, combinatorial and analytic theory
• On monoids and domains whose monadic submonoids are Krull
• On the divisor-class group of monadic submonoids of rings of integer-valued polynomials
• Primary cyclotomic units and a proof of Catalans conjecture
• Relative polynomial closure and monadically Krull monoids of integer-valued polynomials
• Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• The greatest prime divisor of a product of consecutive integers
• What you should know about integer-valued polynomials

Cited in

(14)

• Some results for the irreducibility of truncated binomial expansions
• Strong atoms in monadically Krull monoids
• Split absolutely irreducible integer-valued polynomials over discrete valuation domains
• Some irreducibility and indecomposability results for truncated binomial polynomials of small degree
• Indecomposability of linear combinations of Bernoulli polynomial
• A graph-theoretic criterion for absolute irreducibility of integer-valued polynomials with square-free denominator
• Irreducibility of Binomials
• Integer-valued polynomials on valuation rings of global fields with prescribed lengths of factorizations
• Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
• Irreducibility properties of Carlitz' binomial coefficients for algebraic function fields
• Primes and absolutely or non-absolutely irreducible elements in atomic domains
• Irreducible integer-valued polynomials with prescribed minimal power that factors non-uniquely
• Every finitely generated abelian group is the class group of a generalized cluster algebra
• On algebraic properties of power monoids of numerical monoids

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Absolute irreducibility of the binomial polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664481)