Opened 3 years ago
Closed 3 years ago
#28396 closed enhancement (fixed)
faster Möbius matrix for Hasse diagrams
Reported by: | chapoton | Owned by: | |
---|---|---|---|
Priority: | major | Milestone: | sage-8.9 |
Component: | combinatorics | Keywords: | |
Cc: | tscrim, jmantysalo | Merged in: | |
Authors: | Frédéric Chapoton | Reviewers: | Travis Scrimshaw |
Report Upstream: | N/A | Work issues: | |
Branch: | ce66956 (Commits, GitHub, GitLab) | Commit: | ce66956a4d323ef6607c0ed3a1cf28b64ace36cb |
Dependencies: | Stopgaps: |
Description
I propose a choice of algorithm for computing the Mobius matrix of a poset : the current matrix inversion, or the classical recursive formula. The second one seems to be always faster..
Change History (3)
comment:1 Changed 3 years ago by
- Branch set to u/chapoton/28396
- Commit set to ce66956a4d323ef6607c0ed3a1cf28b64ace36cb
- Status changed from new to needs_review
comment:2 Changed 3 years ago by
- Reviewers set to Travis Scrimshaw
- Status changed from needs_review to positive_review
There might be some benefit once the lequal_matrix
has already been computed, but I agree with everything in this ticket, so it gets a positive review.
comment:3 Changed 3 years ago by
- Branch changed from u/chapoton/28396 to ce66956a4d323ef6607c0ed3a1cf28b64ace36cb
- Resolution set to fixed
- Status changed from positive_review to closed
Note: See
TracTickets for help on using
tickets.
Timings with the branch applied:
New commits:
trac 28396 faster Moebius matrices for posets