19 citations · 67 across the 23 of their papers we have counts for
5 papers · 1 filter
An adiabatic quantum algorithm for the Frobenius problem
Joaquín Ossorio-Castillo, José M. Tornero
The (Diophantine) Frobenius problem is a well-known NP-hard problem (also called the stamp problem or the chicken nugget problem) whose origins lie in the realm of combinatorial nu…
Integral points in rational polygons: a numerical semigroup approach
Guadalupe Márquez-Campos, Jorge L. Ramírez-Alfonsín, José M. Tornero
In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a rig…
On the computation of the Apéry set of numerical monoids and affine semigroups
Guadalupe Márquez-Campos, Ignacio Ojeda, José M. Tornero
A simple way of computing the Apéry set of a numerical semigroup (or monoid) with respect to a generator, using Groebner bases, is presented, together with a generalization for aff…
Characterization of Gaps and Elements of a Numerical Semigroup Using Groebner Bases
Guadalupe Márquez-Campos, José M. Tornero
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been ar…
Combinatorics and their evolution in resolution of embedded algebroid surfaces
Helena Cobo, M. J. Soto, José M. Tornero
The seminal concept of characteristic polygon of an embedded algebroid surface, first developed by Hironaka, seems well suited for combinatorially (perhaps even effectively) tracki…