Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields (Q2414542)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
scientific article

    Statements

    Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields (English)
    0 references
    0 references
    0 references
    0 references
    17 May 2019
    0 references
    Let $D$ be a Dedekind domain with infinitely many maximal ideals. Assume that all residue fields are finite and let $1\leq m_1\leq m_2\leq\ldots\leq m_n$ be natural numbers. It is shown that there exists a polynomial in $\mathrm{Int}(D)$ (i.e. integer-valued polynomials of $D$) with exactly $n$ different factorizations into irreducible polynomials in $\mathrm{Int}(D)$, the length of the factorizations being $m_1+1, m_2+1,\ldots,m_n+1$. As a corollary, for such a Dedekind domain $D$, every finite subset of $\mathbb{N}\setminus \{1\}$ is the set of lengths of irreducible decompositions of a polynomial in $\mathrm{Int}(D)$. It is also shown that for every $n\geq 1$ there exist irreducible elements $H_1, G_1,\ldots,G_{n+1}$ in $\mathrm{Int}(D)$ such that $X\cdot H(X)=G_1(X)\cdot\ldots\cdot G_{n+1}(X).$
    0 references
    factorization
    0 references
    integer-valued polynomials
    0 references
    Dedekind domain
    0 references

    Identifiers

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