#15495: Flip graph of pure simplicial complex
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-6.1
Component: combinatorics | Resolution:
Keywords: simplicial | Merged in:
complex | Reviewers:
Authors: Christian Stump | Work issues:
Report Upstream: N/A | Commit:
Branch: | 10ab84bb32b14ce82e2ba4a2a66a72edd972c1ab
u/stumpc5/ticket/15495 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by stumpc5):
Thanks for checking this ticket!
I am either not sure if you are talking about the right behaviour, or if
we are actually looking at the same code?
Your 1) and 2) do not create the graph of flips, since by 2) the vertices
are codim 1 faces, while the graph of flips has facets as vertices. Also,
our comment on the ``.faces()`` also doesn't make sense. (Or I am
misunderstanding sth. completely.)
``is_face`` only checks containment as sets. ``faces`` is never called in
what I wrote. What I do is: I compute all facets (maximal faces) and all
codim 1 faces. Every codim 1 face represents a maximal clique in the flip
graph (namely of those facets containing this codim 1 face). So I run
through all those codim 1 faces, and check which facets are contained in
this clique.
Could you clarify the situation, so we discuss it again? Thx, Christian
--
Ticket URL: <http://trac.sagemath.org/ticket/15495#comment:5>
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/groups/opt_out.
