Skip to content

Commit 94881f8

Browse files
committed
suggested fixes done
1 parent 85fed41 commit 94881f8

File tree

4 files changed

+8
-7
lines changed

4 files changed

+8
-7
lines changed

src/sage/combinat/fully_packed_loop.py

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1407,11 +1407,11 @@ def cardinality(self):
14071407
14081408
EXAMPLES::
14091409
1410-
sage: [AlternatingSignMatrices(n).cardinality() for n in range(11)]
1411-
[1, 1, 2, 7, 42, 429, 7436, 218348, 10850216, 911835460, 129534272700]
1410+
sage: [AlternatingSignMatrices(n).cardinality() for n in range(10)]
1411+
[1, 1, 2, 7, 42, 429, 7436, 218348, 10850216, 911835460]
14121412
"""
1413-
return Integer(prod([factorial(3*k+1)/factorial(self._n+k)
1414-
for k in range(self._n)]))
1413+
return Integer(prod(factorial(3 * k + 1) / factorial(self._n + k)
1414+
for k in range(self._n)))
14151415

14161416
def _an_element_(self):
14171417
"""

src/sage/combinat/posets/incidence_algebras.py

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -425,7 +425,8 @@ def __invert__(self):
425425
raise ValueError("element is not invertible")
426426
inv = ~M
427427
L = self.parent()._linear_extension
428-
return self.parent().sum_of_terms(((L[i], L[j]), inv[i, j])
428+
return self.parent().sum_of_terms(
429+
((L[i], L[j]), inv[i, j])
429430
for i, j in inv.nonzero_positions(copy=False))
430431

431432

src/sage/combinat/ribbon_shaped_tableau.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -112,7 +112,7 @@ def __init__(self, parent, t):
112112
sage: TestSuite(R).run()
113113
"""
114114
if not isinstance(t, SkewTableau):
115-
# scrubing None
115+
# scrubbing None
116116
t = [[i for i in row if i is not None] for row in t]
117117

118118
st = []

src/sage/combinat/subsets_hereditary.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -127,7 +127,7 @@ def subsets_with_hereditary_property(f, X, max_obstruction_size=None, ncpus=1):
127127

128128
def explore_neighbors(s):
129129
r"""
130-
Explores the successors of a set s.
130+
Explore the successors of a set s.
131131
132132
The successors of a set s are all the sets s+[i] where max(s)<i. This
133133
function returns them all as a partition `(yes_sets,no_sets)`.

0 commit comments

Comments
 (0)