1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
/**
\mainpage Macaulay2 C++ engine documentation
The Macaulay2 engine implements rings, elements in these rings,
matrices over these rings, mutable matrices, ring maps, and
computations including
- Groebner bases
- Hilbert functions
- free resolutions
The engine is written in C++ over a long period of time, some of it
before the c++ standard library was available or robust. The engine
is being updated to c++17, and eventually to c++20.
@see rings
@see matrices
@see comp
*/
/**
* \defgroup rings Rings
*
*/
/**
* \defgroup ringinfo Ring Info
* \ingroup rings
*/
/**
* \defgroup coeffrings Coefficient Rings
* \ingroup rings
*/
/**
\defgroup polynomialrings Polynomial Rings
\ingroup rings
*/
/**
\defgroup monordering Monomial Orders
A *monomial ordering* is a total order on the set of monomials of
a polynomial ring (or of a commutative monoid), such that if $x^\alpha > x^\beta$
then for any monomial $x^\gamma$, $x^\alpha x^\gamma > x^\beta x^\gamma$
*/
/**
* \defgroup matrices Matrices
*
*/
/**
* \defgroup comp Computations
*
*/
/**
* \defgroup gb Groebner Bases
* \ingroup comp
*
*/
/**
* \defgroup res Free Resolutions
* \ingroup comp
*
*/
/**
* \defgroup hilb Hilbert Functions
* \ingroup comp
*
*/
|
