David Coudert

The fastest is ``AccelAsc``, but the difference is small. ```py sage: from sage.combinat.partitions import ZS1_iterator, ZS2_iterator, AccelDesc_iterator, AccelAsc_iterator sage: %timeit sum(1 for _ in ZS1_iterator(10)) 10.8 µs ± 29.4 ns...

> At least it seems like we should not use `ZS2` over `AccelAsc` for increasing lex iteration by default. I am not opposed to keeping both implementations with some test...

Thanks for the comments.

This seems unrelated. On my side, I don't observe these errors. I only see 1 warning ``` sage -t --long --warn-long 25.3 --random-seed=286735480429121101562228604801325644303 src/sage/interfaces/gp.py ********************************************************************** File "src/sage/interfaces/gp.py", line 799, in...

Thank you for the review.

Thanks fo pointing these typos. We could certainly improve the computation time (in future PR). ``` n M_n time 2 2 0.0 3 4 0.0 4 10 0.0 5 24...

@dimpase : Yes, I must add Marianna Spyrakou in the copyright @dimpase, @tscrim: I agree that it's a good idea to improve the code of `next` and to add method...

@dimpase, @tscrim. Concerning the enumeration of partitions, the iterator of `Partitions` is based on algorithm `ZS1` of https://static.aminer.org/pdf/PDF/000/289/332/counting_and_generating_integer_partitions_in_parallel.pdf. It goes in anti-lexicographic. The paper also proposed an algorithm, `ZS2` for...

@dimpase, @tscrim I have almost all the material ready to push a PR with 4 different algorithms for generating partitions. Some algorithms generate partitions in increasing/decreasing lexicographic order and partitions...

> Could you make your build with #38020 and then go back to being based off clean `develop` to do the development? In particular, without running `sage -b` and/or `make`?...