Two New Integer Sequences Related to Crossroads and Catalan Numbers

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Rouyer, Julien, Ninet, Alain
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916120731058176
author Rouyer, Julien
Ninet, Alain
author_facet Rouyer, Julien
Ninet, Alain
contents The lonely singles sequence represents the number of noncrossing partitions of the finite set {1,. .. , n} in which no pair of singletons {i} and {j} can be merged into the pair {i, j} so that the partition stays noncrossing. The marriageable singles sequence represents the number of all the other noncrossing partitions and is the difference between the Catalan numbers sequence and the lonely singles sequence. The 14 first terms of these sequences are given, as well as some of their properties. These sequences appear when one wants to count the number of ways to cross simultaneously certain road intersections.
format Preprint
id arxiv_https___arxiv_org_abs_2311_07181
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Two New Integer Sequences Related to Crossroads and Catalan Numbers
Rouyer, Julien
Ninet, Alain
Combinatorics
The lonely singles sequence represents the number of noncrossing partitions of the finite set {1,. .. , n} in which no pair of singletons {i} and {j} can be merged into the pair {i, j} so that the partition stays noncrossing. The marriageable singles sequence represents the number of all the other noncrossing partitions and is the difference between the Catalan numbers sequence and the lonely singles sequence. The 14 first terms of these sequences are given, as well as some of their properties. These sequences appear when one wants to count the number of ways to cross simultaneously certain road intersections.
title Two New Integer Sequences Related to Crossroads and Catalan Numbers
topic Combinatorics
url https://arxiv.org/abs/2311.07181