A construction of integer-valued polynomials with prescribed sets of lengths of factorizations
DOI10.1007/S00605-013-0508-ZzbMATH Open1282.13004arXiv1112.5753OpenAlexW3105866816WikidataQ59299058 ScholiaQ59299058MaRDI QIDQ368525FDOQ368525
Authors: Sophie Frisch
Publication date: 23 September 2013
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.5753
Recommendations
- Irreducible polynomials and full elasticity in rings of integer-valued polynomials
- Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
- scientific article; zbMATH DE number 1104249
- Factorization of integer-valued polynomials with square-free denominator
- Restricted elasticity and rings of integer-valued polynomials determined by finite subsets
Polynomials in number theory (11C08) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials over commutative rings (13B25) Divisibility and factorizations in commutative rings (13A05) Arithmetic theory of semigroups (20M13)
Cites Work
Cited In (30)
- Sets of lengths in maximal orders in central simple algebras.
- Lengths of factorizations of integer-valued polynomials on Krull domains with prime elements
- Integer-valued polynomials on valuation rings of global fields with prescribed lengths of factorizations
- Sets of lengths
- The system of sets of lengths in Krull monoids under set addition
- Irreducible polynomials and full elasticity in rings of integer-valued polynomials
- On the enumeration of polynomials with prescribed factorization pattern
- Characterizing absolutely irreducible integer-valued polynomials over discrete valuation domains
- Open problems in commutative ring theory
- Factorization theory in commutative monoids
- Non-absolutely irreducible elements in the ring of integer-valued polynomials
- The system of sets of lengths and the elasticity of submonoids of a finite-rank free commutative monoid
- Power monoids: a bridge between factorization theory and arithmetic combinatorics
- Divisibility in rings of integer-valued polynomials
- Systems of sets of lengths: transfer Krull monoids versus weakly Krull monoids
- A realization theorem for sets of lengths in numerical monoids
- Sets of lengths of factorizations of integer-valued polynomials on Dedekind domains with finite residue fields
- Factorization of integer-valued polynomials with square-free denominator
- On monoids and domains whose monadic submonoids are Krull
- A realization result for systems of sets of lengths
- Semigroup rings as weakly Krull domains
- Restricted elasticity and rings of integer-valued polynomials determined by finite subsets
- Absolute irreducibility of the binomial polynomials
- A survey on fixed divisors
- Factorization with respect to a divisor-closed multiplicative submonoid of a ring
- Non-unique factorization of polynomials over residue class rings of the integers
- Systems of sets of lengths of Puiseux monoids
- Puiseux monoids and transfer homomorphisms
- On length densities
- Finding Elements With Given Factorization Lengths and Multiplicities
This page was built for publication: A construction of integer-valued polynomials with prescribed sets of lengths of factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368525)