Skip to main content
SpringerLink
Log in

The visibility parameter for words and permutations

  • Research Article
  • Published:
Central European Journal of Mathematics

Abstract

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, Phys. A, 2011, 390 (12), 2421–2428], and for words over a finite alphabet the formula obtained in the present paper for the expectation is more precise than that obtained in the cited paper. More importantly, we also compute the variance for each case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Flajolet Ph., Martin G.N., Probabilistic counting algorithms for data base applications, J. Comput. System Sci., 1985, 31(2), 182–209

    Article  MathSciNet  MATH  Google Scholar 

  2. Graham R.L., Knuth D.E., Patashnik O., Concrete Mathematics, 2nd ed., Addison-Wesley, Reading, 1994

    MATH  Google Scholar 

  3. Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics on words, Phys. A, 2011, 390(12), 2421–2428

    Article  MathSciNet  Google Scholar 

  4. Prodinger H., Combinatorics of geometrically distributed random variables: left-to-right maxima, In: 5th Conference on Formal Power Series and Algebraic Combinatorics, Florence, June 21–25, 1993, Discrete Math., Elsevier, Amsterdam, 1996, 153(1–3), 253–270

    Google Scholar 

  5. Prodinger H., A q-analogue of the path length of binary search trees, Algorithmica, 2001, 31(3), 433–441

    Article  MathSciNet  MATH  Google Scholar 

  6. Prodinger H., Combinatorics of geometrically distributed random variables: inversions and a parameter of Knuth, Ann. Comb., 2001, 5(2), 241–250

    Article  MathSciNet  MATH  Google Scholar 

  7. Pugh W., Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, 1990, 33(6), 668–676

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, 8010, Graz, Austria

    Ligia L. Cristea

  2. Mathematics Department, Stellenbosch University, 7602, Stellenbosch, South Africa

    Helmut Prodinger

Authors
  1. Ligia L. Cristea
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helmut Prodinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ligia L. Cristea.

About this article

Cite this article

Cristea, L.L., Prodinger, H. The visibility parameter for words and permutations. centr.eur.j.math. 11, 283–295 (2013). https://doi.org/10.2478/s11533-012-0135-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.2478/s11533-012-0135-2

MSC

Keywords

Search

Navigation