Skip to content

Commit 142e0d8

Browse files
committed
Update docs
1 parent e144b7f commit 142e0d8

File tree

1 file changed

+6
-2
lines changed

1 file changed

+6
-2
lines changed

docs/src/groebner-bases.md

Lines changed: 6 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ DocTestSetup = quote
55
end
66
```
77

8-
```@setup algebraicsolving
8+
```@setup
99
using AlgebraicSolving
1010
```
1111

@@ -34,6 +34,7 @@ well as a signature based algorithm to compute Gröbner bases.
3434
max_nr_pairs::Int=0,
3535
la_option::Int=2,
3636
eliminate::Int=0,
37+
intersect::Bool=true,
3738
complete_reduction::Bool=true,
3839
info_level::Int=0
3940
)
@@ -43,12 +44,15 @@ The engine supports the elimination of one block of variables considering the
4344
product monomial ordering of two blocks, both ordered w.r.t. the degree
4445
reverse lexicographical order. One can either directly add the number of
4546
variables of the first block via the `eliminate` parameter in the
46-
`groebner_basis` call. We have also implemented an alias for this call:
47+
`groebner_basis` call. By using `intersect=false` it is possible to only
48+
use block ordering without intersecting. We have also implemented an alias
49+
for this call:
4750

4851
```@docs
4952
eliminate(
5053
I::Ideal{T} where T <: MPolyRingElem,
5154
eliminate::Int;
55+
intersect::Bool=true,
5256
initial_hts::Int=17,
5357
nr_thrds::Int=1,
5458
max_nr_pairs::Int=0,

0 commit comments

Comments
 (0)