DOI: 10.2969/aspm/07710001
|View full text |Cite
|
Sign up to set email alerts
|

Gröbner bases for everyone with CoCoA-5 and CoCoALib

Abstract: We present a survey on the developments related to Gröbner bases, and show explicit examples in CoCoA.The CoCoA project dates back to 1987: its aim was to create a "mathematician"-friendly computational laboratory for studying Commutative Algebra, most especially Gröbner bases. Always maintaining this "friendly" tradition, the project has grown and evolved, and the software has been completely rewritten.CoCoA offers Gröbner bases for all levels of interest: from the basic, explicit call in the interactive syst… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…Then rgin(I) = (x 3 , x 2 y 2 , xy 4 , y 6 ). See [3] for details about the computation of gin in CoCoA.…”
Section: Background Results On Sectional Matricesmentioning
confidence: 99%
“…Then rgin(I) = (x 3 , x 2 y 2 , xy 4 , y 6 ). See [3] for details about the computation of gin in CoCoA.…”
Section: Background Results On Sectional Matricesmentioning
confidence: 99%
“…Then d min = 6 and d max = 9, and β 0,6 = 3, β 0,7 = 2 and β 0,8 = β 0,9 = 1. Using the construction of Theorem 9.8, we obtain (e 1 , e 2 , e 3 ) = (1,2,4). Consider now the arrangement A in K 3 defined by Q = x(x−y)(x−2y)(x−z)(x−2z)(x−3z)(x−4z), then B = rgin(J(A)).…”
Section: Arrangementsmentioning
confidence: 99%
“…We describe the new package arrangements that computes several combinatorial invariants (like the lattice of intersections and its flats, the Poincaré, the characteristic and the Tutte polynomials) and algebraic ones (like the Orlik-Terao and the Solomon-Terao ideals) of hyperplane arrangement for the software CoCoA ( [1], [2] and [3]). Moreover, several functions for the class of free hyperplane arrangements are implemented.…”
Section: Introductionmentioning
confidence: 99%
“…** / use S ::= QQ[x,y,z]; / ** / A:=[x,y,z,x-y,x-y-z,x-y+2 * z]; / ** / A_1:=MultiArrRestrictionZiegler(A,z);A_1;[[y[1], 1], [y[2], 1], [y[1]-y[2], 3]] / ** / MultiArrDerMod(A_1); matrix( / * RingWithID(18, "QQ[y[1],y[2]]") * / [[y[1] * y[2], y[1]ˆ3], [y[1] * y[2], 3 * y[1]ˆ2 * y[2]-3 * y[1] * y[2]ˆ2+y[2]ˆ3]]) / ** / MultiArrExponents(A_1); [2, 3]/ ** / ArrExponents(A);[1,2,3] …”
mentioning
confidence: 99%