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

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

zbMATH Keywords

Catalan numbersDyck pathslexicographic semiorderssemiordersnon-crossing Dyck paths

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Semiorders and a Theory of Utility Discrimination
• Title not available (Why is that?)
• Dyck path enumeration
• Semiorders. Properties, representations, applications
• 2-binary trees: bijections and related issues
• Description of some relations on the set of real-line intervals
• Enumeration of transitive, step-type relations
• Testing lexicographic semiorders as models of decision making: priority dominance, integration, interaction, and transitivity
• 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
• On the Enumeration of Decision Patterns Involving $n$ Means
• Title not available (Why is that?)
• Lexicographic aggregation of semiorders
• Semiorders and Riordan numbers

Cited In (3)

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

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)