19 citations · 67 across the 23 of their papers we have counts for
25 papers
Blurred combinatorics in resolution of singularities: (a little) beyond the characteristic polytope
Helena Cobo, M. J. Soto, José M. Tornero
We introduce a variation of the well-known Newton-Hironaka polytope for algebroid hypersurfaces. This combinatorial object is a perturbed version of the original one, parametrized…
A Generalisation of the Phase Kick-Back
Joaquín Ossorio-Castillo, Ulises Pastor-Díaz, José M. Tornero
In this paper, we present a generalisation of the Phase Kick-Back technique, which is central to some of the classical algorithms in quantum computing, such as the Deutsch--Jozsa a…
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…