On a property of the division algorithm and its application to the theory of non-unique factorizations

DOI10.4171/EM/128MaRDI QIDQ1045951zbMATH OpenOpenAlexWikidataFDO

Authors David F. Anderson, William W. Smith, Scott T. Chapman

Publication date 18 December 2009

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL http://www.ems-ph.org/journals/show_abstract.php?issn=0013-6018&vol=64&iss=4&rank=3

zbMATH Keywords

Euclidean algorithm

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites work

• scientific article; zbMATH DE number 1024506 (Why is no real title available?)
• scientific article; zbMATH DE number 1031234 (Why is no real title available?)
• scientific article; zbMATH DE number 1031236 (Why is no real title available?)
• scientific article; zbMATH DE number 2167060 (Why is no real title available?)
• scientific article; zbMATH DE number 1438385 (Why is no real title available?)
• Computing the elasticity of a Krull monoid
• Non-unique factorizations. Algebraic, combinatorial and analytic theory
• On Diophantine monoids and their class groups.
• On the Elasticities of Krull Domains with Finite Cyclic Divisor Class Group
• Rational Elasticity of Factorizations in Krull Domains

Cited in

(4)

• A unified way for obtaining dividing formulas \(n| Q(n)\)
• Sets closed under the division algorithm
• scientific article; zbMATH DE number 139976 (Why is no real title available?)
• On the field-based division property: applications to MiMC, Feistel MiMC and GMiMC

This page was built for publication: On a property of the division algorithm and its application to the theory of non-unique factorizations

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