What Happens When the Division Algorithm “Almost” Works

DOI10.1080/00029890.2018.1470414zbMath1395.13004OpenAlexW2886763533MaRDI QIDQ4577966

Scott Thomas Chapman

Publication date: 6 August 2018

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00029890.2018.1470414

zbMATH Keywords

semigroup ringsnumerical semigroupsfinitely generated idealsalmost division algorithm

Mathematics Subject Classification ID

Polynomials over commutative rings (13B25) Ideals and multiplicative ideal theory in commutative rings (13A15) Semigroup rings, multiplicative semigroups of rings (20M25) Euclidean rings and generalizations (13F07) Arithmetic theory of semigroups (20M13)

Related Items (3)

Unnamed Item ⋮ Associates, irreducibility, and factorization length in monoid rings with zero divisors ⋮ Finite factorization properties in commutative monoid rings with zero divisors

Cites Work

• Bases of subalgebras of \(\mathbb{K}[\![ x \!]\) and \(\mathbb{K}[x]\)]
• Rings of finite rank and finitely generated ideals
• Numerical semigroups.
• Torsion-Free Abelian Semigroup Rings, V
• n-Generator Property of a Polynomial Ring
• Number fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: What Happens When the Division Algorithm “Almost” Works