Proportionally modular Diophantine inequalities and the Stern-Brocot tree
From MaRDI portal
Publication:3055142
DOI10.1090/S0025-5718-08-02173-XzbMATH Open1208.11049DBLPjournals/moc/BullejosR09OpenAlexW2027021672WikidataQ58842665 ScholiaQ58842665MaRDI QIDQ3055142FDOQ3055142
Authors: Manuel Bullejos, José Carlos Rosales 
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-08-02173-x
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of the Frobenius problem
- Proportionally modular Diophantine inequalities.
- The smallest positive integer that is solution of a proportionally modular Diophantine inequality
- The set of solutions of a proportionally modular Diophantine inequality
Cited In (9)
- The \(n\)-dimensional Stern-Brocot tree
- WHEN IS A NUMERICAL SEMIGROUP A QUOTIENT?
- On proportionally modular numerical semigroups of embedding dimension three
- OPENED MODULAR NUMERICAL SEMIGROUPS WITH A GIVEN MULTIPLICITY
- Proportionally modular numerical semigroups generated by arithmetic progressions
- The maximum proportionally modular numerical semigroup with given multiplicity and ratio.
- The minimal system of generators of an affine, plane and normal semigroup
- Affine convex body semigroups.
- Title not available (Why is that?)
This page was built for publication: Proportionally modular Diophantine inequalities and the Stern-Brocot tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055142)
