ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Sat, 05 Sep 2020 13:25:44 +0200Computing maximal acyclic matchingshttps://ask.sagemath.org/question/53313/computing-maximal-acyclic-matchings/Hi, Is there a function to compute the maximal acyclic (Morse) matching (defined below) of a given finite poset?
A matching M in a poset X is a subset M of X x X such that:
1) if (x, y) is in M, then x is an immediate predecessor of y (x<y and there is no element z such that x<z<y)
2) each element x of X belongs to at most one element in M.
In order to represent the matching on the associated Hasse Diagram of the poset, we just reverse the arrows which are not in the matching. The matching is acyclic (Morse) if the matching represented on its Hasse Diagram is acyclic.
By maximal matching I mean one with the maximal number of elements.
Any help would be appreciated.daltopSat, 05 Sep 2020 13:25:44 +0200https://ask.sagemath.org/question/53313/Maximal matching of a posethttps://ask.sagemath.org/question/53301/maximal-matching-of-a-poset/ Hi,
I would like to know how to find a maximal matching (defined below) of a given finite poset.
A matching M in a poset X is a subset M of X x X such that:
1) if (x, y) is in M, then x is an immediate predecessor of y (x<y and there is no element z such that x<z<y)
2) each element x of X belongs to at most one element in M.
A matching of a poset is the same as a matching of its Hasse Diagram. I thought about using the matching() function for graphs, however, it seems that the Hasse diagram of a poset is a Digraph for Sage and so the matching function does not work.
By maximal matching I mean one with the maximal number of elements.
Any help would be appreciated.
daltopFri, 04 Sep 2020 13:55:52 +0200https://ask.sagemath.org/question/53301/