THE SHORT RESOLUTION OF A SEMIGROUP ALGEBRA

@article{Ojeda2015THESR,
  title={THE SHORT RESOLUTION OF A SEMIGROUP ALGEBRA},
  author={Ignacio Ojeda and Alberto Vigneron-Tenorio},
  journal={Bulletin of the Australian Mathematical Society},
  year={2015},
  volume={96},
  pages={400 - 411}
}
This work generalises the short resolution given by Pisón Casares [‘The short resolution of a lattice ideal’, Proc. Amer. Math. Soc. 131(4) (2003), 1081–1091] to any affine semigroup. We give a characterisation of Apéry sets which provides a simple way to compute Apéry sets of affine semigroups and Frobenius numbers of numerical semigroups. We also exhibit a new characterisation of the Cohen–Macaulay property for simplicial affine semigroups. 

On the algebraic invariants of certain affine semigroup algebras

A BSTRACT . Let a and d be two linearly independent vectors in N 2 , over the field of rational numbers. For a positive integer k ≥ 2 , consider the sequence a, a + d, . . . , a + kd such that the

CRITICAL BINOMIAL IDEALS OF NORTHCOTT TYPE

Abstract In this paper, we study a family of binomial ideals defining monomial curves in the n-dimensional affine space determined by n hypersurfaces of the form $x_i^{c_i} - x_1^{u_{i1}} \cdots

On the algebraic invariants of certain affine semigroup rings

Let a and d be two linearly independent vectors in $${\mathbb {N}}^2$$ N 2 , over the field of rational numbers. For a positive integer $$k \ge 2$$ k ≥ 2 , consider the sequence $$a, a+d, \ldots ,

Simplicial Affine Semigroups with Monomial Minimal Reduction Ideals

We characterize when the monomial maximal ideal of a simplicial affine semigroup ring has a monomial minimal reduction. When this is the case, we study the Cohen–Macaulay and Gorenstein properties of

References

SHOWING 1-10 OF 20 REFERENCES

On the Apéry sets of monomial curves

In this paper, we use the Apéry table of the numerical semigroup associated to an affine monomial curve in order to characterize arithmetic properties and invariants of its tangent cone. In

Finitely generated commutative monoids

There is a lack of effective methods for studying properties of finitely generated commutative monoids. This was one of the main reasons for developing a self-contained book on finitely generated

The short resolution of a lattice ideal

The short resolution of a lattice ideal is a free resolution over a polynomial ring whose number of variables is the number of extremal rays in the associated cone. A combinatorial description of

Gröbner Basis

  • David Naccache
  • Computer Science, Mathematics
    Encyclopedia of Cryptography and Security
  • 2011
This process generalizes three familiar techniques: Gaussian elimination for solving linear systems of equations, the Euclidean algorithm for computing the greatest common divisor of two univariate polynomials, and the Simplex Algorithm for linear programming.

On Cohen-Macaulay rings

In this paper, we use a characterization of R-modules N such that fdRN = pdRN to characterize Cohen-Macaulay rings in terms of various dimensions. This is done by setting N to be the dth local

Combinatorial Commutative Algebra

Monomial Ideals.- Squarefree monomial ideals.- Borel-fixed monomial ideals.- Three-dimensional staircases.- Cellular resolutions.- Alexander duality.- Generic monomial ideals.- Toric Algebra.-

SINGULAR: a computer algebra system for polynomial computations

SINGULAR is a specialized computer algebra system for polynomial computations with emphasize on the needs of commutative algebra, algebraic geometry, and singularity theory, which features one of the fastest and most general implementations of various algorithms for computing standard resp.

numericalsgps, a GAP package for numerical semigroups

The package numericalsgps performs computations with and for numerical and affine semigroups. This manuscript is a survey of what the package does, and at the same time intends to gather the trending