Computing maximal acyclic matchings

asked 2020-09-05 13:25:44 +0200

daltop gravatar image

updated 2020-09-05 13:28:11 +0200

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.

edit retag flag offensive close merge delete


FrédéricC gravatar imageFrédéricC ( 2020-09-05 13:41:25 +0200 )edit

I am not familiar with the Sage, but I understand from the information on that link, that the function I ask for will be ready in Sage 9.3 in just 3 weeks?

daltop gravatar imagedaltop ( 2020-09-05 14:30:23 +0200 )edit

NO. It will not enter sage until somebody takes care of all the necessary work required for this to happen. And nobody seems to care enough to take up the job.

FrédéricC gravatar imageFrédéricC ( 2020-09-05 19:02:45 +0200 )edit