Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 5, 2000 | Published
Journal Article Open

Tournament Sequences and Meeussen Sequences

Abstract

A tournament sequence is an increasing sequence of positive integers (t1; t2; : : :) such that t1 = 1 and ti+1 <= 2ti. A Meeussen sequence is an increasing sequence of positive integers (m1;m2; : : :) such that m1 = 1, every nonnegative integer is the sum of a subset of the {mi}, and each integer mi − 1 is the sum of a unique such subset. We show that these two properties are isomorphic. That is, we present a bijection between tournament and Meeussen sequences which respects the natural tree structure on each set. We also present an efficient technique for counting the number of tournament sequences of length n, and discuss the asymptotic growth of this number. The counting technique we introduce is suitable for application to other well-behaved counting problems of the same sort where a closed form or generating function cannot be found.

Additional Information

© 2000 The Author(s). Submitted: March 22, 2000; Accepted: September 5, 2000. Partially supported by an NSF Mathematical Sciences Postdoctoral Research Fellowship. The authors would like to acknowledge W. Meeussen for suggesting the question, and N. J. A. Sloane for his Encyclopedia of Integer Sequences [9], which led us to notice the coincidence. Thanks also to J. Polito for useful conversations, J. Shallit for helpful comments on an earlier draft of this work, and D. Knuth for excellent suggestions about the asymptotics questions.

Attached Files

Published - COOejc00.pdf

Files

COOejc00.pdf
Files (183.5 kB)
Name Size Download all
md5:7870c8759455c7151626fa1eb0faec0f
183.5 kB Preview Download

Additional details

Created:
August 21, 2023
Modified:
October 13, 2023