AbstractWe give procedures for determining whether a given monoid is an affine semigroup and for computing the dual of a semigroup. We also give methods for deciding whether an affine semigroup is normal and/or full. The algorithms presented here are based on the computation of the set of minimal nontrivial nonnegative integer solutions of systems of linear diophantine equations
AbstractIn “Semigroup Algebras,” Okniński posed the following question: characterize semigroup algeb...
Producción CientíficaThis work introduces a new kind of semigroup of Np called proportionally modula...
This paper deals with the decidability of semigroup freeness. More precisely, the freeness...
AbstractWe give procedures for determining whether a given monoid is an affine semigroup and for com...
AbstractThe aim of this article is to introduce normal affine semigroups and its links with other ar...
Let X be a finite set such that |X|=n. Let Tn and Sn denote the transformation monoid and the symm...
An affine semigroup is a finitely generated subsemigroup of a finitely generated free abelian group ...
In the early 1970’s, Hochster proved that normal semigroup rings generated by monomials are Cohen-Ma...
AbstractIn this paper we utilize the zig-zag representations to characterize the free inverse semigr...
Inspired by methods in prime characteristic in commutative algebra, we introduce and study combinato...
This paper examines in a new way some known facts about numerical semigroups especially when the num...
The Semigroups package is a GAP package containing methods for semigroups, monoids, and inverse semi...
Producción CientíficaThis work generalises the short resolution given by Pisón Casares [‘The short r...
summary:We study numerical semigroups $S$ with the property that if $m$ is the multiplicity of $S$...
AbstractThis paper gives necessary and sufficient conditions for a group to be isomorphic to a semig...
AbstractIn “Semigroup Algebras,” Okniński posed the following question: characterize semigroup algeb...
Producción CientíficaThis work introduces a new kind of semigroup of Np called proportionally modula...
This paper deals with the decidability of semigroup freeness. More precisely, the freeness...
AbstractWe give procedures for determining whether a given monoid is an affine semigroup and for com...
AbstractThe aim of this article is to introduce normal affine semigroups and its links with other ar...
Let X be a finite set such that |X|=n. Let Tn and Sn denote the transformation monoid and the symm...
An affine semigroup is a finitely generated subsemigroup of a finitely generated free abelian group ...
In the early 1970’s, Hochster proved that normal semigroup rings generated by monomials are Cohen-Ma...
AbstractIn this paper we utilize the zig-zag representations to characterize the free inverse semigr...
Inspired by methods in prime characteristic in commutative algebra, we introduce and study combinato...
This paper examines in a new way some known facts about numerical semigroups especially when the num...
The Semigroups package is a GAP package containing methods for semigroups, monoids, and inverse semi...
Producción CientíficaThis work generalises the short resolution given by Pisón Casares [‘The short r...
summary:We study numerical semigroups $S$ with the property that if $m$ is the multiplicity of $S$...
AbstractThis paper gives necessary and sufficient conditions for a group to be isomorphic to a semig...
AbstractIn “Semigroup Algebras,” Okniński posed the following question: characterize semigroup algeb...
Producción CientíficaThis work introduces a new kind of semigroup of Np called proportionally modula...
This paper deals with the decidability of semigroup freeness. More precisely, the freeness...
DOI
Add to ORKG