#19520: implement random triangulations in a bijective way
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_review
Type: | Milestone: sage-6.10
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers:
theory | Work issues:
Keywords: | Commit:
random graph | 2d3020a347482570494dcc7dc42e1ea1f44dec98
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
u/chapoton/19520 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by chapoton):
Hello,
yes, this part is indeed already not clear. I am not sure to be convinced
myself
that the algorithm that I wrote to conjugate the binary word is correct.
But it works..
The idea is (like for usual conjugation into Dyck words) to assign a
height at every step of the path, and to cut where the height is minimal
or almost minimal here...
--
Ticket URL: <http://trac.sagemath.org/ticket/19520#comment:11>
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.
