Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge

Niels Lauritzen

Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge

Niels Lauritzen

Research output: Working paper/Preprint › Working paper › Research

Abstract

We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.

Original language	English
Number of pages	9
Publication status	Published - 2005

Access to Document

https://arxiv.org/abs/math/0508287Licence: Unspecified

Library access?

Check availability with the Royal Danish Library

Cite this

@techreport{50d946e0988511dabee902004c4f4f50,

title = "Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge",

abstract = "We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.",

author = "Niels Lauritzen",

year = "2005",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge

AU - Lauritzen, Niels

PY - 2005

Y1 - 2005

N2 - We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.

AB - We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.

M3 - Working paper

BT - Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge

ER -

Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge

Abstract

Access to Document

Library access?

Fingerprint

Cite this