Page 1

Displaying 1 – 13 of 13

Showing per page

The box parameter for words and permutations

Helmut Prodinger (2014)

Open Mathematics

The box parameter for words counts how often two letters w j and w k define a “box” such that all the letters w j+1; ..., w k−1 fall into that box. It is related to the visibility parameter and other parameters on words. Three models are considered: Words over a finite alphabet, permutations, and words with letters following a geometric distribution. A typical result is: The average box parameter for words over an M letter alphabet is asymptotically given by 2n − 2n H M/M, for fixed M and n → ∞.

The visibility parameter for words and permutations

Ligia Cristea, Helmut Prodinger (2013)

Open Mathematics

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 on words,...

Currently displaying 1 – 13 of 13

Page 1