#15444: Two algorithms for k-charge do not give same answer
-------------------------------------+-------------------------------------
Reporter: aschilling | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.13
Component: combinatorics | Resolution:
Keywords: tableaux, charge | Merged in:
Authors: Anne Schilling | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/k-charge-15444 | 8df647454982f5799a4267712551a78989f08992
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by aschilling):
I ran the following code for k=3 and 4 and now the two implementations
seem to agree:
{{{
sage: for n in range(10):
for la in Partitions(n,max_part=k):
for mu in Partitions(n,max_part=k):
T = WeakTableaux(k,la,mu,representation='bounded')
if not all(t.k_charge() == t.k_charge(algorithm="J") for t in
T):
print la,mu
....:
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/15444#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
