Debugged normal_basis() for simplicial presentation

sagemath · Feb 1, 2025 · 78f067b · 78f067b
1 parent 0eb7ec9
commit 78f067b
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/src/sage/matroids/chow_ring_ideal.py b/src/sage/matroids/chow_ring_ideal.py
@@ -847,8 +847,8 @@ def normal_basis(self, algorithm = '', *args, **kwargs):
                 for i in range(1, k):
                     max_powers.append(ranks[subset[i]] - ranks[subset[i-1]])
                 ranges = [range(1, p) for p in max_powers]
-                ranges[0] = range(1, max_powers[0] + 1)
-                for combination in product(*(r for r in ranges)):
+                ranges[0] = range(1, max_powers[0])
+                for combination in product(*(ran for ran in ranges)):
                     # generating combinations for all powers up to max_powers
                     expression = R.one()
                     for val, c in zip(subset, combination):