A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths

DOI10.1016/j.jmp.2010.09.001zbMath1203.91054OpenAlexW2077834437MaRDI QIDQ618174

Clintin P. Davis-Stober

Publication date: 14 January 2011

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2010.09.001

zbMATH Keywords

Dyck pathsCatalan numberssemiorderslexicographic semiordersnon-crossing Dyck paths

Mathematics Subject Classification ID

Decision theory (91B06) Generalizations of ordered sets (06A75)

Related Items

Individual differences in the algebraic structure of preferences ⋮ A lexicographic semiorder polytope and probabilistic representations of choice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Testing lexicographic semiorders as models of decision making: priority dominance, integration, interaction, and transitivity
• Dyck path enumeration
• Semiorders. Properties, representations, applications
• A bijection between 2-triangulations and pairs of non-crossing Dyck paths
• 2-binary trees: bijections and related issues
• Description of some relations on the set of real-line intervals
• A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
• Semiorders and a Theory of Utility Discrimination
• On the Enumeration of Decision Patterns Involving $n$ Means
• Lexicographic aggregation of semiorders
• Enumeration of transitive, step-type relations