Runs of Ones in Binary Strings

We give three different computations of the total number of runs of length $i$ in binary $n$-strings, and we discuss the connection of this problem with the compositions of $n$.

Saved in:

Bibliographic Details
Main Authors:	Balado, Félix, Silvestre, Guénolé C. M
Format:	Journal Article
Language:	English
Published:	22-02-2023
Subjects:	Mathematics - Combinatorics
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We give three different computations of the total number of runs of length $i$ in binary $n$-strings, and we discuss the connection of this problem with the compositions of $n$.
DOI:	10.48550/arxiv.2302.11532