#15475: Reenable broken doctests in #15473 and #15476 when #10963 is merged
-------------------------------------+-------------------------------------
Reporter: darij | Owner:
Type: defect | Status: needs_review
Priority: minor | Milestone: sage-6.3
Component: categories | Resolution:
Keywords: 10963, | Merged in:
categories, c3 | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | a3c4cf39c3625a311d72bf0c88e9bfbd028d74f3
public/combinat/15475 | Stopgaps:
Dependencies: #10963, #15473, |
#15476 |
-------------------------------------+-------------------------------------
Changes (by darij):
* status: new => needs_review
* cc: sage-combinat (added)
* branch: => public/combinat/15475
* commit: => a3c4cf39c3625a311d72bf0c88e9bfbd028d74f3
* type: task => defect
Old description:
> Speaking of these ones:
> {{{
> The following doctest is disabled pending :trac:`10963`::
>
> sage: s = SymmetricFunctions(Zmod(14)).s() # not tested
> sage: s.is_integral_domain() # not tested
> False
> }}}
> and
> {{{
> sage: def descent_test(n):
> ....: DA = DescentAlgebra(QQ, n)
> ....: NSym = NonCommutativeSymmetricFunctions(QQ)
> ....: S = NSym.S()
> ....: DAD = DA.D()
> ....: w_n = DAD(set(range(1, n)))
> ....: for I in Compositions(n):
> ....: if not (S[I].star_involution()
> ....: == w_n *
> S[I].to_descent_algebra(n) * w_n):
> ....: return False
> ....: return True
> sage: all( descent_test(i) for i in range(4) ) # not
> tested
> True
> sage: all( descent_test(i) for i in range(6) ) # not
> tested
> True
>
> .. TODO::
>
> Once :trac:`10963` is in, remove the first "not
> tested" above,
> and replace the second one by "long time".
> }}}
> Also, rebase and merge the attached doc fixes to the categories primer.
New description:
This branch activates two combinat doctests which were disabled due to
unexplainable bugs that were fixed in #10963:
{{{
The following doctest is disabled pending :trac:`10963`::
sage: s = SymmetricFunctions(Zmod(14)).s() # not tested
sage: s.is_integral_domain() # not tested
False
}}}
and
{{{
sage: def descent_test(n):
....: DA = DescentAlgebra(QQ, n)
....: NSym = NonCommutativeSymmetricFunctions(QQ)
....: S = NSym.S()
....: DAD = DA.D()
....: w_n = DAD(set(range(1, n)))
....: for I in Compositions(n):
....: if not (S[I].star_involution()
....: == w_n *
S[I].to_descent_algebra(n) * w_n):
....: return False
....: return True
sage: all( descent_test(i) for i in range(4) ) # not
tested
True
sage: all( descent_test(i) for i in range(6) ) # not
tested
True
.. TODO::
Once :trac:`10963` is in, remove the first "not
tested" above,
and replace the second one by "long time".
}}}
Also, a few typos in the c3_controlled doc are fixed.
Disregard the attachment.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/15475#comment:6>
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/d/optout.
