@@ -2489,17 +2489,15 @@ def glaisher_franklin(self, s):
2489
2489
r"""
2490
2490
Apply the Glaisher-Franklin bijection to ``self``.
2491
2491
2492
- INPUT:
2493
-
2494
- - ``s`` -- positive integer
2495
-
2496
- OUTPUT:
2497
-
2498
2492
The Franklin-Glaisher bijection, with parameter `s`, returns
2499
2493
a partition whose set of parts that are repeated at least `s`
2500
2494
times equals the set of parts divisible by `s` in ``self``,
2501
2495
after dividing each part by `s`.
2502
2496
2497
+ INPUT:
2498
+
2499
+ - ``s`` -- positive integer
2500
+
2503
2501
EXAMPLES::
2504
2502
2505
2503
sage: Partition([4, 3, 2, 2, 1]).glaisher_franklin(2)
@@ -2554,18 +2552,16 @@ def glaisher_franklin_inverse(self, s):
2554
2552
r"""
2555
2553
Apply the inverse of the Glaisher-Franklin bijection to ``self``.
2556
2554
2557
- INPUT:
2558
-
2559
- - ``s`` -- positive integer
2560
-
2561
- OUTPUT:
2562
-
2563
2555
The inverse of the Franklin-Glaisher bijection, with
2564
2556
parameter `s`, returns a partition whose set of parts that
2565
2557
are divisible by `s`, after dividing each by `s`, equals the
2566
2558
equals the set of parts repeated at least `s` times in
2567
2559
``self``.
2568
2560
2561
+ INPUT:
2562
+
2563
+ - ``s`` -- positive integer
2564
+
2569
2565
EXAMPLES::
2570
2566
2571
2567
sage: Partition([4, 3, 2, 2, 1]).glaisher_franklin(2)
0 commit comments