Geodesic
On the Frobenius number of a modular Diophantine inequality
Mathematica Bohemica, Tome 133 (2008) no. 4, pp. 367-375

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality $ax \mod b\leq x$, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality $ax \mod b\leq x$, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
DOI : 10.21136/MB.2008.140626
Classification : 11D75, 20M14
Keywords: numerical semigroup; Diophantine inequality; Frobenius number; multiplicity 
Rosales, J. C.; Vasco, P. On the Frobenius number of a modular Diophantine inequality. Mathematica Bohemica, Tome 133 (2008) no. 4, pp. 367-375. doi: 10.21136/MB.2008.140626
@article{10_21136_MB_2008_140626,
     author = {Rosales, J. C. and Vasco, P.},
     title = {On the {Frobenius} number of a modular {Diophantine} inequality},
     journal = {Mathematica Bohemica},
     pages = {367--375},
     year = {2008},
     volume = {133},
     number = {4},
     doi = {10.21136/MB.2008.140626},
     mrnumber = {2472485},
     zbl = {1174.11046},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2008.140626/}
}
TY  - JOUR
AU  - Rosales, J. C.
AU  - Vasco, P.
TI  - On the Frobenius number of a modular Diophantine inequality
JO  - Mathematica Bohemica
PY  - 2008
SP  - 367
EP  - 375
VL  - 133
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2008.140626/
DO  - 10.21136/MB.2008.140626
LA  - en
ID  - 10_21136_MB_2008_140626
ER  - 
%0 Journal Article
%A Rosales, J. C.
%A Vasco, P.
%T On the Frobenius number of a modular Diophantine inequality
%J Mathematica Bohemica
%D 2008
%P 367-375
%V 133
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2008.140626/
%R 10.21136/MB.2008.140626
%G en
%F 10_21136_MB_2008_140626

[1] Barucci, V., Dobbs, D. E., Fontana, M.: Maximality Properties in Numerical Semigroups and Applications to One-Dimensional Analytically Irreducible Local Domains. Memoirs of the Amer. Math. Soc. 598 (1997). | MR | Zbl

[2] Delgado, M., Rosales, J. C.: On the Frobenius number of a proportionally modular Diophantine inequality. Portugaliae Mathematica 63 (2006), 415-425. | MR | Zbl

[3] Alfonsín, J. L. Ramírez: The Diophantine Frobenius Problem. Oxford Univ. Press (2005). | MR

[4] Rosales, J. C.: Modular Diophantine inequalities and some of their invariants. Indian J. Pure App. Math. 36 (2005), 417-429. | MR | Zbl

[5] Rosales, J. C., García-Sánchez, P. A.: Finitely Generated Commutative Monoids. Nova Science Publishers, New York (1999). | MR

[6] Rosales, J. C., García-Sánchez, P. A., a-García, J. I. Garcí, Urbano-Blanco, J. M.: Proportionally modular Diophantine inequalities. J. Number Theory 103 (2003), 281-294. | DOI | MR

[7] Rosales, J. C., García-Sánchez, P. A., Urbano-Blanco, J. M.: Modular Diophantine inequalities and numerical semigroups. Pacific J. Math. 218 (2005), 379-398. | DOI | MR | Zbl

[8] Rosales, J. C., Urbano-Blanco, J. M.: Opened modular numerical semigroups. J. Algebra 306 (2006), 368-377. | DOI | MR | Zbl

[9] Rosales, J. C., Vasco, P.: The smallest positive integer that is solution of a proportionally modular Diophantine inequality. Math. Inequal. Appl. 11 (2008), 203-212. | MR | Zbl

Cité par Sources :