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

DOI10.1016/J.JMP.2010.09.001zbMATH Open1203.91054OpenAlexW2077834437MaRDI QIDQ618174FDOQ618174

Authors 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

Catalan numbersDyck pathslexicographic semiorderssemiordersnon-crossing Dyck paths

Mathematics Subject Classification ID

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

Recommendations

• On the number of fixed-length semiorders
• Counting pairs of noncrossing binary paths: a bijective approach
• A simple and unusual bijection for Dyck paths and its consequences
• Some properties of a new partial order on Dyck paths
• Dyck path enumeration

Cites work

• scientific article; zbMATH DE number 3987281 (Why is no real title available?)
• scientific article; zbMATH DE number 3697169 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• 2-binary trees: bijections and related issues
• A bijection between 2-triangulations and pairs of non-crossing Dyck paths
• A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
• Description of some relations on the set of real-line intervals
• Dyck path enumeration
• Enumeration of transitive, step-type relations
• Lexicographic aggregation of semiorders
• On the Enumeration of Decision Patterns Involving $n$ Means
• Semiorders and Riordan numbers
• Semiorders and a Theory of Utility Discrimination
• Semiorders. Properties, representations, applications
• Testing lexicographic semiorders as models of decision making: priority dominance, integration, interaction, and transitivity

Cited in

(3)

• A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
• Individual differences in the algebraic structure of preferences
• A lexicographic semiorder polytope and probabilistic representations of choice

This page was built for publication: A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618174)