John H Palmieri wrote:
> def collapsed_complex (self):
> """
> Remove all free faces from self. Could probably say more here.
>
> EXAMPLES::
>
> sage: S = SimplicialComplex(...) # need to fill in the
> details here
> sage: S.homology(1) == sage: S.collapsed_complex
On Aug 24, 9:57 am, Rafael Villarroel wrote:
> Thanks for your answer!
>
> I have added
>
> def is_free_face (self,s):
> """
> A free face is one that is contained properly in exactly one
> maximal face.
>
> Removing a free face from a complex does not chang
On Sun, Aug 23, 2009 at 11:59 PM, John H Palmieri wrote:
>
> On Aug 10, 8:41 pm, Rafael Villarroel wrote:
> Some comments: first, in general, these functions would be better as
> "methods", so that they would be called as
>
> S.is_free_face(s)
> S.free_face_removed()
> S.collapsed_complex()
>
>
On Aug 10, 8:41 pm, Rafael Villarroel wrote:
> Hello all,
>
> Under friendly advice by Fidel Barrera, I have been trying to use Sage
> for my research since about two monts ago. I work with graphs and posets
> and simplicial complexes coming from them, and I had used GAP + GRAPE +
> SimplicialHom
Since no one has answered this, you might want to email John Palmieri
(palmaieri at math dot washington dot edu) directly, since he is the
author of the simplicial complex module in sage.
-Marshall Hampton
On Aug 10, 10:41 pm, Rafael Villarroel wrote:
> Hello all,
>
> Under friendly advice by F
