A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths
type: Item
instance of: scholarly article
title: A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths
zbMATH Open document ID: 1203.91054
author: Clintin P. Davis-Stober
published in: Journal of Mathematical Psychology
publication date: 2011-01-14T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 06A75
zbMATH DE Number: 5836753
zbMATH Keywords: Dyck paths
zbMATH Keywords: non-crossing Dyck paths
zbMATH Keywords: semiorders
zbMATH Keywords: lexicographic semiorders
zbMATH Keywords: Catalan numbers
MaRDI profile type: Publication
full work available at URL: j.jmp.2010.09.001
OpenAlex ID: W2077834437
cites work: Q5387519
cites work: Testing lexicographic semiorders as models of decision making: priority dominance, integration, interaction, and transitivity
cites work: A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
cites work: Q3890739
cites work: Dyck path enumeration
cites work: A bijection between 2-triangulations and pairs of non-crossing Dyck paths
cites work: Q3751580
cites work: 2-binary trees: bijections and related issues
cites work: Semiorders and a Theory of Utility Discrimination
cites work: Description of some relations on the set of real-line intervals
cites work: Lexicographic aggregation of semiorders
cites work: Semiorders. Properties, representations, applications
cites work: Enumeration of transitive, step-type relations
cites work: Q4236280
cites work: On the Enumeration of Decision Patterns Involving $n$ Means
DOI: 10.1016/J.JMP.2010.09.001
description: scientific article; zbMATH DE number 5836753