@@ -1425,7 +1425,7 @@ def guess(self, f, n_verify=100, max_exponent=10, sequence=None):
1425
1425
1426
1426
sage: Seq2 = kRegularSequenceSpace(2, ZZ)
1427
1427
sage: import logging
1428
- sage: logging.basicConfig(level= logging.INFO)
1428
+ sage: logging.getLogger().setLevel( logging.INFO)
1429
1429
sage: S1 = Seq2.guess(s); S1
1430
1430
INFO:...:including f_{1*m+0}
1431
1431
INFO:...:including f_{2*m+1}
@@ -1500,6 +1500,7 @@ def guess(self, f, n_verify=100, max_exponent=10, sequence=None):
1500
1500
1: [0 1]
1501
1501
[0 1]},
1502
1502
(0, 1))
1503
+ sage: logging.getLogger().setLevel(logging.WARN)
1503
1504
1504
1505
The following linear representation of `S` is chosen bad (is
1505
1506
degenerated, see :meth:`is_degenerated`), as `\mu(0)` applied on
@@ -1648,7 +1649,9 @@ def guess(self, f, n_verify=100, max_exponent=10, sequence=None):
1648
1649
1649
1650
::
1650
1651
1651
- sage: A = Seq2((Matrix([[1, 1], [1, 1]]), Matrix([[1, 1], [1, 1]])), left=(1, 1), right=(1, 1))
1652
+ sage: A = Seq2((Matrix([[1, 1], [1, 1]]), Matrix([[1, 1], [1, 1]])),
1653
+ ....: left=(1, 1), right=(1, 1),
1654
+ ....: allow_degenerated_sequence=True)
1652
1655
sage: Seq2.guess(lambda n: n, sequence=A, n_verify=5)
1653
1656
Traceback (most recent call last):
1654
1657
...
0 commit comments