Displaying similar documents to “The box parameter for words and permutations”

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...

Isoperimetric problem for uniform enlargement

S. Bobkov (1997)

Studia Mathematica

Similarity:

We consider an isoperimetric problem for product measures with respect to the uniform enlargement of sets. As an example, we find (asymptotically) extremal sets for the infinite product of the exponential measure.

The boundary Harnack principle for the fractional Laplacian

Krzysztof Bogdan (1997)

Studia Mathematica

Similarity:

We study nonnegative functions which are harmonic on a Lipschitz domain with respect to symmetric stable processes. We prove that if two such functions vanish continuously outside the domain near a part of its boundary, then their ratio is bounded near this part of the boundary.