The Use and Usefulness of Numeration Systems
The proper choice of a counting system may solve mathematical problems or lead to improved algorithms This is illustrated by a problem in combinatorial group theory, compression of sparse binary strings, encoding of contiguous binary strings of unknown lengths, ranking of permutations and combinations, strategies of games and other examples. Two abstract counting systems are given from which the concrete ones used for the applications can be derived.
KeywordsEntropy Sorting Prefix Flushing Havoc
Unable to display preview. Download preview PDF.
- 1.A. Apostolico and A.S. Fraenkel, Robust complete universal Fibonacci representations, and transmission of unbounded strings, Technical Report, December 1983.Google Scholar
- 2.M. Berger, A. Felzenbaum and A.S. Fraenkel, An improvement to the Newman-Znám result for disjoint covering systems, Technical Report, Department of Mathematics, The Weizmann Institute of Science, September 1984.Google Scholar
- 9.A.S. Fraenkel, Systems of numeration, Amer. Math. Monthly, to appear (Jan. 1985).Google Scholar
- 10.A.S. Fraenkel and T. Klein, Novel compression of sparse bit-strings — preliminary report, These Proceedings.Google Scholar
- 14.D.E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Second Printing, Addison-Wesley, Reading, MA, 1973.Google Scholar
- 16.D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Second Printing, Addison-Wesley, Reading, MA, 1975.Google Scholar
- 17.D.E. Lehmer, The machine tools of combinatorics, in Applied Combinatorial Mathematics (E.F. Beckenbach, Ed.), Wiley, New York, NY, pp. 5–31, 1964.Google Scholar
- 24.M.J. Whinihan, Fibonacci slim, The Fibonacci Quarterly 1No. 4 (11963) 9–12.Google Scholar
- 25.W. Wythoff, A modification of the game of Nim, Nieuw Arch. Wish. 7 (1907) 199–202.Google Scholar
- 26.A.M. Yaglom and I.M. Yaglom, Challenging Mathematical Problems with Elementary Solutions, translated by J. McCawley, Jr., revised and edited by B. Gordon, Vol. II, Holden-Day, San Francisco, 1967.Google Scholar