What Happens When the Division Algorithm “Almost” Works
From MaRDI portal
Publication:4577966
Recommendations
Cites work
- scientific article; zbMATH DE number 3902926 (Why is no real title available?)
- scientific article; zbMATH DE number 3737801 (Why is no real title available?)
- scientific article; zbMATH DE number 515505 (Why is no real title available?)
- scientific article; zbMATH DE number 4196114 (Why is no real title available?)
- scientific article; zbMATH DE number 6540108 (Why is no real title available?)
- scientific article; zbMATH DE number 4194024 (Why is no real title available?)
- Bases of subalgebras of \(\mathbb{K}[\![ x ]\!]\) and \(\mathbb{K}[x]\)
- Number fields
- Numerical semigroups.
- Rings of finite rank and finitely generated ideals
- Semirings with an almost division algorithm.
- Torsion-Free Abelian Semigroup Rings, V
- n-Generator Property of a Polynomial Ring
Cited in
(3)
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)