#19583: random triangulation as simplicial complex
-------------------------------------+-------------------------------------
Reporter: chapoton | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.1
Component: algebraic | Resolution:
topology | Merged in:
Keywords: random simplicial | Reviewers:
complex | Work issues:
Authors: Frédéric Chapoton | Commit:
Report Upstream: N/A | 5e465924db248460f0a20da334cd4b1f8499adc7
Branch: u/chapoton/19583 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by chapoton):
Hello Nathann.
Thanks for your comments, and for your time.
Concerning the suggestion of Travis, I can of course revert this
factorisation. But you may qualify this as "just doing everything that a
potential reviewer asks for".
I was trying to think about adding the embedding information on the graph
method, as you suggested before. I am not sure that this data is easily
recoverable from the simplicial complex. So it seems to me that keeping
both still has a value, if I manage to add the embedding.
1) the graph method would give an embedded (planar) graph.
2) the simplicial complex method (besides giving an interesting object by
itself) allows to compute easily the planar dual of this graph, which
would give another class of nice random graphs.
--
Ticket URL: <http://trac.sagemath.org/ticket/19583#comment:28>
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.
