hasse diagram of a subset of a poset

asked 2015-10-06 15:39:38 +0100

GA316
129 ●6 ●12 ●20

updated 2017-07-31 22:09:43 +0100

5236 ●3 ●44 ●116

E = {1,2,3} P = SetPartitions(E) This gives the set of all partitions of E,. I have a subset Q of P and I want to construct the directed graph whose vertex set is this set Q and we draw an arrow from p to q in this graph if q covers p. How to construct this graph for a given P and Q?

The definition of covering relation can be found here : https://en.wikipedia.org/wiki/Coverin...

Thanks for your valuable timing.

edit retag flag offensive close merge delete

add a comment

1 Answer

Sort by » oldest newest most voted

answered 2015-10-06 18:00:49 +0100

fidbc

2423 ●4 ●26 ●61

If you use your favorite search engine, you may come accross this site.

There you can see that

P = SetPartitions(3)
f = lambda q,p: q in p.refinements()
Po = Poset((P,f))

constructs the associated poset Po. Then you can simply use the subposet method together to get the desired subposet Q. Getting the Hasse diagram for Q is just a matter of using Q.show()

edit flag offensive delete link

Comments

it works nicely.thanks.

GA316 ( 2015-10-08 09:26:48 +0100 )edit

add a comment

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 2015-10-06 15:39:38 +0100

Seen: 1,024 times

Last updated: Oct 06 '15

hasse diagram of a subset of a poset edit