What Happens When the Division Algorithm “Almost” Works

DOI10.1080/00029890.2018.1470414zbMATH Open1395.13004OpenAlexW2886763533MaRDI QIDQ4577966FDOQ4577966

Authors: Scott T. 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

Recommendations

• An algorithm for exact division
• A DIVISION ALGORITHM
• New algorithms for the division's quotient
• Division algorithm and Kronecker's approximation theorem
• scientific article; zbMATH DE number 4006333

zbMATH Keywords

numerical semigroupsfinitely generated idealssemigroup ringsalmost division algorithm

Mathematics Subject Classification ID

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

Cites Work

• Numerical semigroups.
• Title not available (Why is that?)
• Bases of subalgebras of \(\mathbb{K}[\![ x ]\!]\) and \(\mathbb{K}[x]\)
• Title not available (Why is that?)
• Number fields
• Title not available (Why is that?)
• Rings of finite rank and finitely generated ideals
• Torsion-Free Abelian Semigroup Rings, V
• Title not available (Why is that?)
• n-Generator Property of a Polynomial Ring
• Semirings with an almost division algorithm.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Substructures with an almost division algorithm in Euclidean commutator lattices
• Finite factorization properties in commutative monoid rings with zero divisors
• Associates, irreducibility, and factorization length in monoid rings with zero divisors

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

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