Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Combinatoric of syzygies for semigroup algebras.

Emilio BrialesPilar PisónAntonio CampilloCarlos Marijuán — 1998

Collectanea Mathematica

We describe how the graded minimal resolution of certain semigroup algebras is related to the combinatorics of some simplicial complexes. We obtain characterizations of the Cohen-Macaulay and Gorenstein conditions. The Cohen-Macaulay type is computed from combinatorics. As an application, we compute explicitly the graded minimal resolution of monomial both affine and simplicial projective surfaces.

Minimal resolutions of lattice ideals and integer linear programming.

A combinatorial description of the minimal free resolution of a lattice ideal allows us to the connection of Integer Linear Programming and Al1gebra. The non null reduced homology spaces of some simplicial complexes are the key. The extremal rays of the associated cone reduce the number of variables.

Page 1

Download Results (CSV)