A bijection between certain non-crossing partitions and sequences (Q1887650)

From MaRDI portal
Revision as of 14:33, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A bijection between certain non-crossing partitions and sequences
scientific article

    Statements

    A bijection between certain non-crossing partitions and sequences (English)
    0 references
    0 references
    22 November 2004
    0 references
    Another ``Catalan'' sequence bijection. The author gives a bijection between noncrossing partitions of \([2n+1]\) into \(n+1\) blocks in which no block contains two consecutive integers and the set of sequences \((s_i)^n\), such that \(1\leq s_i\leq i\), and, if \(s_i=j\), then \(S_{i-r}\leq j-r\) for \(1\leq r\leq j=1\). The author states that, up till now, no bijections between these two sets have been discovered.
    0 references
    Enumerative combinatorics
    0 references
    Catalan numbers
    0 references
    Non-crossing partitions
    0 references

    Identifiers