Algorithms for calculating the set of integers contained in a monoid finitely generated by positive rational numbers

MaRDI QIDQ5041482zbMATH OpenFDO

Authors José Carlos Rosales, M. B. Branco

Publication date 14 October 2022

Full work available at URL http://www.acmij.az/view.php?lang=az&menu=journal&id=558

zbMATH Keywords

Apéry setfull semigrouplinear Diophantine equationnumerical semigroupproportionally modular Diophantine inequality

Mathematics Subject Classification ID

The Frobenius problem (11D07) Computer solution of Diophantine equations (11Y50) Commutative semigroups (20M14)

Recommendations

• On finitely generated submonoids of \(\mathbb{N}^ k\)
• PRESENTATIONS OF FINITELY GENERATED SUBMONOIDS OF FINITELY GENERATED COMMUTATIVE MONOIDS
• Algorithms for generalized numerical semigroups
• Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
• Computation of delta sets of numerical monoids.

Cited in

(4)

• An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
• On finitely generated submonoids of \(\mathbb{N}^ k\)
• On dynamic algorithms for factorization invariants in numerical monoids
• A new algorithm for computing idempotents of ℛ-trivial monoids

This page was built for publication: Algorithms for calculating the set of integers contained in a monoid finitely generated by positive rational numbers

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