The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Generalizations of Carlitz compositions.”

The visibility parameter for words and permutations

Ligia Cristea, Helmut Prodinger (2013)

Open Mathematics

Similarity:

We investigate the visibility parameter, i.e., the number of visible pairs, first for words over a finite alphabet, then for permutations of the finite set {1, 2, …, n}, and finally for words over an infinite alphabet whose letters occur with geometric probabilities. The results obtained for permutations correct the formula for the expectation obtained in a recent paper by Gutin et al. [Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics...

Matrix compositions.

Munarini, Emanuele, Poneti, Maddalena, Rinaldi, Simone (2009)

Journal of Integer Sequences [electronic only]

Similarity: