A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths (Q618174): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5387519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing lexicographic semiorders as models of decision making: priority dominance, integration, interaction, and transitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyck path enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bijection between 2-triangulations and pairs of non-crossing Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-binary trees: bijections and related issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiorders and a Theory of Utility Discrimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Description of some relations on the set of real-line intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic aggregation of semiorders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiorders. Properties, representations, applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of transitive, step-type relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration of Decision Patterns Involving $n$ Means / rank
 
Normal rank

Latest revision as of 16:19, 3 July 2024

scientific article
Language Label Description Also known as
English
A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths
scientific article

    Statements

    A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths (English)
    0 references
    14 January 2011
    0 references
    0 references
    Dyck paths
    0 references
    non-crossing Dyck paths
    0 references
    semiorders
    0 references
    lexicographic semiorders
    0 references
    Catalan numbers
    0 references
    0 references