José C. Rosales

Orcid: 0000-0003-3353-4335

Affiliations:
  • University of Granada, Spain


According to our database1, José C. Rosales authored at least 24 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ratio-Covarieties of Numerical Semigroups.
Axioms, March, 2024

2023
A Frobenius problem suggested by prime <i>k</i>-tuplets.
Discret. Math., July, 2023

Numerical semigroups without consecutive small elements.
Int. J. Algebra Comput., February, 2023

2021
Counting the Ideals with a Given Genus of a Numerical Semigroup with Multiplicity Two.
Symmetry, 2021

Numerical semigroups closed under addition of their divisors.
Appl. Algebra Eng. Commun. Comput., 2021

2019
Semigroups with fixed multiplicity and embedding dimension.
Ars Math. Contemp., 2019

2018
A combinatorial problem and numerical semigroups.
Ars Math. Contemp., 2018

2016
Numerical semigroups in a problem about economic incentives for consumers.
CoRR, 2016

Bracelet monoids and numerical semigroups.
Appl. Algebra Eng. Commun. Comput., 2016

2014
The numerical semigroup of the integers which are bounded by a submonoid of N<sup>2</sup>.
Electron. Notes Discret. Math., 2014

On the enumeration of the set of saturated numerical semigroups with fixed Frobenius number.
Appl. Math. Comput., 2014

2012
The Frobenius problem for numerical semigroups with embedding dimension equal to three.
Math. Comput., 2012

On the enumeration of the set of numerical semigroups with fixed Frobenius number.
Comput. Math. Appl., 2012

2011
Irreducibility in the Set of Numerical Semigroups with Fixed Multiplicity.
Int. J. Algebra Comput., 2011

2009
Proportionally modular diophantine inequalities and the Stern-Brocot tree.
Math. Comput., 2009

Opened Modular Numerical Semigroups with a Given Multiplicity.
Int. J. Algebra Comput., 2009

2006
Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations.
Discret. Appl. Math., 2006

2002
Presentations of Finitely Generated Submonoids of Finitely Generated Commutative Monoids.
Int. J. Algebra Comput., 2002

On the number of factorizations of an element in an atomic monoid.
Adv. Appl. Math., 2002

2000
How to check if a finitely generated commutative monoid is a principal ideal commutative monoid.
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999
On Presentations of Commutative Monoids.
Int. J. Algebra Comput., 1999

Commutative ideal extensions of abelian groups.
SIGSAM Bull., 1999

1997
On Linear Equations in Natural Numbers.
Int. J. Algebra Comput., 1997

1996
An Algorithmic Method to Compute a Minimal Relation for any numerical Semigroup.
Int. J. Algebra Comput., 1996


  Loading...