#14136: P-partition enumerators in QSym
------------------------------------------------------+---------------------
Reporter: darij | Owner:
sage-combinat
Type: enhancement | Status:
needs_review
Priority: minor | Milestone:
sage-5.11
Component: combinatorics | Resolution:
Keywords: QSym, P-partitions, posets, days45 | Work issues:
Report Upstream: N/A | Reviewers:
Frederic Chapoton, Travis Scrimshaw
Authors: Darij Grinberg | Merged in:
Dependencies: #14748 | Stopgaps:
------------------------------------------------------+---------------------
Description changed by darij:
Old description:
> Or did someone already implement them?
>
> Here's my code. Its weakest point is probably the input; instead of an
> actual pair of a poset and a map from its elements to {1,2,3,...}, it
> takes a pair of a poset and a linear order on it represented as a tuple
> of its elements. (See docstring for details. By the way, I'm hoping the
> LaTeX does work... no idea how to check that.)
New description:
Or did someone already implement them?
Here's my code. Its weakest point is probably the input; instead of an
actual pair of a poset and a map from its elements to {1,2,3,...}, it
takes a pair of a poset and a linear order on it represented as a tuple of
its elements. (See docstring for details. By the way, I'm hoping the LaTeX
does work... no idea how to check that.)
* Apply: [attachment:trac_14136-p_partition_enumerator-review-ts.patch]
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14136#comment:24>
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.
