@@ -110,7 +110,7 @@ def pad_right(T, length, zero=0):
110
110
111
111
EXAMPLES::
112
112
113
- sage: from sage.combinat.k_regular_sequence import pad_right
113
+ sage: from sage.combinat.regular_sequence import pad_right
114
114
sage: pad_right((1, 2, 3), 10)
115
115
(1, 2, 3, 0, 0, 0, 0, 0, 0, 0)
116
116
sage: pad_right((1, 2, 3), 2)
@@ -147,7 +147,7 @@ def value(D, k):
147
147
148
148
EXAMPLES::
149
149
150
- sage: from sage.combinat.k_regular_sequence import value
150
+ sage: from sage.combinat.regular_sequence import value
151
151
sage: value(42.digits(7), 7)
152
152
42
153
153
"""
@@ -229,7 +229,7 @@ def __init__(self, parent, mu, left=None, right=None):
229
229
230
230
.. SEEALSO::
231
231
232
- :doc:`k-regular sequence <k_regular_sequence >`,
232
+ :doc:`k-regular sequence <regular_sequence >`,
233
233
:class:`RegularSequenceRing`.
234
234
235
235
TESTS::
@@ -1281,7 +1281,7 @@ def _pickle_RegularSequenceRing(k, coefficients, category):
1281
1281
TESTS::
1282
1282
1283
1283
sage: Seq2 = RegularSequenceRing(2, ZZ)
1284
- sage: from sage.combinat.k_regular_sequence import _pickle_RegularSequenceRing
1284
+ sage: from sage.combinat.regular_sequence import _pickle_RegularSequenceRing
1285
1285
sage: _pickle_RegularSequenceRing(
1286
1286
....: Seq2.k, Seq2.coefficient_ring(), Seq2.category())
1287
1287
Space of 2-regular sequences over Integer Ring
@@ -1311,7 +1311,7 @@ class RegularSequenceRing(RecognizableSeriesSpace):
1311
1311
1312
1312
.. SEEALSO::
1313
1313
1314
- :doc:`k-regular sequence <k_regular_sequence >`,
1314
+ :doc:`k-regular sequence <regular_sequence >`,
1315
1315
:class:`RegularSequence`.
1316
1316
"""
1317
1317
Element = RegularSequence
@@ -1371,7 +1371,7 @@ def __init__(self, k, *args, **kwds):
1371
1371
1372
1372
.. SEEALSO::
1373
1373
1374
- :doc:`k-regular sequence <k_regular_sequence >`,
1374
+ :doc:`k-regular sequence <regular_sequence >`,
1375
1375
:class:`RegularSequence`.
1376
1376
"""
1377
1377
self .k = k
@@ -2342,9 +2342,9 @@ def __init__(self, k, coefficient_ring):
2342
2342
2343
2343
TESTS::
2344
2344
2345
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
2345
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
2346
2346
sage: RecurrenceParser(2, ZZ)
2347
- <sage.combinat.k_regular_sequence .RecurrenceParser object at 0x...>
2347
+ <sage.combinat.regular_sequence .RecurrenceParser object at 0x...>
2348
2348
"""
2349
2349
self .k = k
2350
2350
self .coefficient_ring = coefficient_ring
@@ -2368,7 +2368,7 @@ def parse_recurrence(self, equations, function, var):
2368
2368
2369
2369
EXAMPLES::
2370
2370
2371
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
2371
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
2372
2372
sage: RP = RecurrenceParser(2, ZZ)
2373
2373
sage: var('n')
2374
2374
n
@@ -2949,7 +2949,7 @@ def parse_direct_arguments(self, M, m, coeffs, initial_values):
2949
2949
2950
2950
EXAMPLES::
2951
2951
2952
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
2952
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
2953
2953
sage: RP = RecurrenceParser(2, ZZ)
2954
2954
sage: RP.parse_direct_arguments(2, 1,
2955
2955
....: {(0, -2): 3, (0, 0): 1, (0, 1): 2,
@@ -3143,7 +3143,7 @@ def parameters(self, M, m, coeffs, initial_values, offset=0, inhomogeneities={})
3143
3143
3144
3144
EXAMPLES::
3145
3145
3146
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
3146
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
3147
3147
sage: RP = RecurrenceParser(2, ZZ)
3148
3148
sage: RP.parameters(2, 1,
3149
3149
....: {(0, -2): 3, (0, 0): 1, (0, 1): 2, (1, -2): 6, (1, 0): 4,
@@ -3345,7 +3345,7 @@ def values(self, *, M, m, l, u, ll, coeffs,
3345
3345
3346
3346
Stern--Brocot Sequence::
3347
3347
3348
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
3348
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
3349
3349
sage: RP = RecurrenceParser(2, ZZ)
3350
3350
sage: RP.values(M=1, m=0, l=0, u=1, ll=0,
3351
3351
....: coeffs={(0, 0): 1, (1, 0): 1, (1, 1): 1},
@@ -3531,7 +3531,7 @@ def ind(self, M, m, ll, uu):
3531
3531
3532
3532
EXAMPLES::
3533
3533
3534
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
3534
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
3535
3535
sage: RP = RecurrenceParser(2, ZZ)
3536
3536
sage: RP.ind(3, 1, -3, 3)
3537
3537
{(0, 0): 0, (1, -1): 3, (1, -2): 2, (1, -3): 1,
@@ -3594,7 +3594,7 @@ def shifted_inhomogeneities(self, recurrence_rules):
3594
3594
EXAMPLES::
3595
3595
3596
3596
sage: from collections import namedtuple
3597
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
3597
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
3598
3598
sage: RP = RecurrenceParser(2, ZZ)
3599
3599
sage: Seq2 = RegularSequenceRing(2, ZZ)
3600
3600
sage: S = Seq2((Matrix([[1, 0], [0, 1]]), Matrix([[1, 0], [1, 1]])),
@@ -3698,7 +3698,7 @@ def v_eval_n(self, recurrence_rules, n):
3698
3698
3699
3699
Stern--Brocot Sequence::
3700
3700
3701
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
3701
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
3702
3702
sage: RP = RecurrenceParser(2, ZZ)
3703
3703
sage: SB_rules = RP.parameters(
3704
3704
....: 1, 0, {(0, 0): 1, (1, 0): 1, (1, 1): 1},
@@ -3762,7 +3762,7 @@ def matrix(self, recurrence_rules, rem, correct_offset=True):
3762
3762
right-hand sides of the recurrence relations correspond to the entries of
3763
3763
the matrices. ::
3764
3764
3765
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
3765
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
3766
3766
sage: RP = RecurrenceParser(2, ZZ)
3767
3767
sage: var('n')
3768
3768
n
@@ -4005,7 +4005,7 @@ def left(self, recurrence_rules):
4005
4005
EXAMPLES::
4006
4006
4007
4007
sage: from collections import namedtuple
4008
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
4008
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
4009
4009
sage: RP = RecurrenceParser(2, ZZ)
4010
4010
sage: RRD = namedtuple('recurrence_rules_dim',
4011
4011
....: ['dim', 'inhomogeneities'])
@@ -4059,7 +4059,7 @@ def right(self, recurrence_rules):
4059
4059
4060
4060
Stern--Brocot Sequence::
4061
4061
4062
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
4062
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
4063
4063
sage: RP = RecurrenceParser(2, ZZ)
4064
4064
sage: var('n')
4065
4065
n
@@ -4123,7 +4123,7 @@ def __call__(self, *args, **kwds):
4123
4123
4124
4124
TESTS::
4125
4125
4126
- sage: from sage.combinat.k_regular_sequence import RecurrenceParser
4126
+ sage: from sage.combinat.regular_sequence import RecurrenceParser
4127
4127
sage: RP = RecurrenceParser(2, ZZ)
4128
4128
sage: var('n')
4129
4129
n
0 commit comments