Abstract

For a finite ordered set (X,<), let N(S) stand for the number of linear extensions with property S. Thus, N=N(O) is the number of all linear extensions for S=O, that is no constraints at all. Let \( p(S) = \frac{{N(S)}}{N} \), a counting probability measure according to which all linear extensions are assumed to be equally likely. N(xy) is the number of linear extensions in which x precedes y. Then p(xy)+p(yx)=1 and p(xy)=1 if and only if x<y.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.