科研之友
微信
新浪微博
Facebook
分享链接
摘要
It is a known result that the set of distinct semiorders on n elements up to permutation is in bijective correspondence with the set of all Dyck paths of length 2n I generalize this result by defining a bijection between a set of lexicographic semiorders termed simple lexicographic semiorders and the set of all pairs of non-crossing Dyck paths of length 2n Simple lexicographic semiorders have been used by behavioral scientists to model intransitivity of preference (e g Tversky 196
- 出版日期2010-12
