Skip to main content
SpringerLink
Log in

Words, Permutations, and Representations of Numbers

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

  • 440 Accesses

Abstract

In this survey paper we consider words, where the letters are interpreted to be numbers or digits. In the first part, natural numbers are weighted with probabilities (from the geometric distribution). Several properties and parameters of sets of such words are analyzed probabilistically; the case of permutations is a limiting case. In the second part, the representation of Gaussian integers to the base -2 + i is considered, as well as redundant representations to the base q, where the digits can be arbitrary integers.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Avizienis. Signed-digit number representations for fast parallel arithmetic. IRE Trans., EC-10: 389–400, 1961.

    MathSciNet  Google Scholar 

  2. L. Carlitz. Permutations with prescribed pattern. Math. Nachr., 58:31–53, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  3. L. Carlitz. A combinatorial property of q-Eulerian numbers. American Mathematical Monthly, 82:51–54, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Delange. Sur la fonction sommatoire de la fonction somme des chiffres. Enseignement Mathématique, 21:31–47, 1975.

    MATH  MathSciNet  Google Scholar 

  5. C. Frougny. On-line finite automata for addition in some numeration systems. Theor. Inform. Appl., 33:79–101, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Grabner, P. Kirschenhofer, and H. Prodinger. The sum-of-digits function for complex bases. J. London Math. Soc., 57:20–40, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  7. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics (Second Edition). AddisonWesley, 1994.

    Google Scholar 

  8. U. Güntzer and M. Paul. Jump interpolation search trees and symmetric binary numbers. Information Processing Letters, 26:193–204, 1987/88.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. Heuberger and H. Prodinger. On minimal expansions in redundant number systems: Algorithms and quantitative analysis. Computing, 66: 377–393, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Kirschenhofer and H. Prodinger. Subblock occurrences in positional number systems and Gray code representation. Journal of Information and Optimization Sciences, 5:29–42, 1984.

    MATH  MathSciNet  Google Scholar 

  11. P. Kirschenhofer and H. Prodinger. The path length of random skip lists. Acta Informatica, 31:775–792, 1994.

    Article  MathSciNet  Google Scholar 

  12. A. Knopfmacher and H. Prodinger. Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum. Discrete Mathematics, 226:255–267, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  13. D. E. Knuth. The Art of Computer Programming, volume 1: Fundamental Algorithms. Addison-Wesley, 1968. Third edition, 1997.

    Google Scholar 

  14. D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973. Second edition, 1998.

    Google Scholar 

  15. G. Louchard and H. Prodinger. Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. submitted, 2001.

    Google Scholar 

  16. F. Morain and J. Olivos. Speeding up the computations on an elliptic curve using additionsubtraction chains. RAIRO Inform. Théor. Appl., 24(6):531–543, 1990.

    MATH  MathSciNet  Google Scholar 

  17. H. Prodinger. Combinatorial problems of geometrically distributed random variables and applications in computer science. InV. Strehl and R. König, editors, Publications de l’IRMA (Straβbourg) (=Séminaire Lotharingien de Combinatoire), volume 30, pages 87–95, 1993.

    Google Scholar 

  18. H. Prodinger. Combinatorics of geometrically distributed random variables: Left-to-right maxima. Discrete Mathematics, 153:253–270, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  19. H. Prodinger. Combinatorics of geometrically distributed random variables: Inversions and a parameter of Knuth. Annals of Combinatorics, 5: 241–250, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  20. H. Prodinger. Combinatorics of geometrically distributed random variables: Lengths of ascending runs. LATIN2000, Lecture Notes in Computer Science 1776, pages 473–482, 2000.

    Google Scholar 

  21. H. Prodinger. Combinatorics of geometrically distributed random variables: New q-tangent and q-secant numbers. International Journal of Mathematical Sciences, 24:825–838, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  22. H. Prodinger. On binary representations of integers with digits.1, 0, 1. Integers, pages A8, 14 pp. (electronic), 2000.

    Google Scholar 

  23. H. Prodinger. Combinatorics of geometrically distributed random variables: Value and position of large left-to-right maxima, Discrete Mathematics, to appear, 2002.

    Google Scholar 

  24. H. Prodinger and T. A. Tsifhumulo. On q-Olivier functions, submitted, 2001.

    Google Scholar 

  25. G. Reitwiesner. Binary arithmetic. Vol. 1 of Advances in Computers,Academic Press, pages 231–308, 1960.

    MathSciNet  Google Scholar 

  26. J. Thuswaldner. Summatory functions of digital sums occurring in Cryptography. Periodica Math. Hungarica, 38:111–130, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  27. H. Wilf. On the outstanding elements of permutations, 1995, http://www.cis.upenn.edu/~wilf.

Download references

Author information

Authors and Affiliations

  1. The John Knopfmacher Centre for Applicable Analysis and Number Theory School of Mathematics, University of theWitwatersrand, P. O.Wits, 2050, Johannesburg, South Africa

    Helmut Prodinger

Authors
  1. Helmut Prodinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prodinger, H. (2002). Words, Permutations, and Representations of Numbers. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

  • Online ISBN: 978-3-540-46011-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation