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
AbstractWe show that any finite monoid or semigroup presentation satisfying the small overlap condit...
Abstract. Considering finite extensions K[A] ⊆ K[B] of positive affine semigroup rings over a field...
AbstractWe characterize the hull resolution of a monomial curve in three-dimensional affine space, a...
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...
In the early 1970’s, Hochster proved that normal semigroup rings generated by monomials are Cohen-Ma...
A Diophantine monoid S is a monoid which consists of the set of solutions in nonnegative integers to...
AbstractWe give a purely algebraic algorithm to calculate the ideal of a semigroup with torsion. As ...
The Semigroups package is a GAP package containing methods for semigroups, monoids, and inverse semi...
AbstractThe maximal monoids of the form FSF are studied, where F is a nonnegative idempotent matrix ...
The aim of this thesis is to introduce the reader to the theory of affine monoids and, thereby, to p...
Given any family of normal subgroups of a group, we construct in a natural way a certain monoid, the...
We study submonoidsM of Nk consisting of the solutions of a homogenous linear diophantine equation w...
An affine semigroup is a finitely generated subsemigroup of a finitely generated free abelian group ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractWe show that any finite monoid or semigroup presentation satisfying the small overlap condit...
Abstract. Considering finite extensions K[A] ⊆ K[B] of positive affine semigroup rings over a field...
AbstractWe characterize the hull resolution of a monomial curve in three-dimensional affine space, a...
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...
In the early 1970’s, Hochster proved that normal semigroup rings generated by monomials are Cohen-Ma...
A Diophantine monoid S is a monoid which consists of the set of solutions in nonnegative integers to...
AbstractWe give a purely algebraic algorithm to calculate the ideal of a semigroup with torsion. As ...
The Semigroups package is a GAP package containing methods for semigroups, monoids, and inverse semi...
AbstractThe maximal monoids of the form FSF are studied, where F is a nonnegative idempotent matrix ...
The aim of this thesis is to introduce the reader to the theory of affine monoids and, thereby, to p...
Given any family of normal subgroups of a group, we construct in a natural way a certain monoid, the...
We study submonoidsM of Nk consisting of the solutions of a homogenous linear diophantine equation w...
An affine semigroup is a finitely generated subsemigroup of a finitely generated free abelian group ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractWe show that any finite monoid or semigroup presentation satisfying the small overlap condit...
Abstract. Considering finite extensions K[A] ⊆ K[B] of positive affine semigroup rings over a field...
AbstractWe characterize the hull resolution of a monomial curve in three-dimensional affine space, a...
DOI