#14126: Count Number of Linear Extensions of a Poset
-------------------------------------+-------------------------------------
Reporter: csar | Owner: sage-combinat
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: days45 | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: u/jmantysalo | Commit:
/count-lin-ext | f908696aa7c63cefbc382af326cfe085e0dfa522
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
?? Isn't the concept of `#P` about counting something? And
http://link.springer.com/article/10.1007/BF00383444 seems to say that too.
It is trivial to say that listing them takes more than polynomial time.
Of course there are easy answers for some posets. For the ordinal sum of
`P` and `Q` the count is just product.
But I will wait for the code and see.
--
Ticket URL: <https://trac.sagemath.org/ticket/14126#comment:32>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
