#20494: Poset is_chain_of_poset(): error checking and saturated-keyword
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-7.3
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers: Travis Scrimshaw
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/saturated_chain | efe83f037d5ebbaec63549945c8b416df5d30326
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Replying to [comment:7 kdilks]:
> It's my understanding that if repeated elements are allowed, then it's a
multichain, and if repeated elements aren't allowed then it's just a
chain. I don't know if Sage fully distinguishes between the two, so it
might be worth having a separate ticket just dedicated to making that
distinction clear in function names/documentation.
True. But currently
{{{
P = Posets.PentagonPoset()
P.is_chain_of_poset([2, 2, 3])
}}}
returns `True`. With suggested code it would still return `True`, but
`P.is_chain_of_poset([2,2,3], saturated=True)` would return `False`.
How about third parameter `allow_multichain` with default value `True` to
maintain current behaviour?
--
Ticket URL: <http://trac.sagemath.org/ticket/20494#comment:8>
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.