Graphs and Combinatorics

, Volume 9, Issue 2–4, pp 197–200 | Cite as

On the maximum number of distinct factors of a binary string

Graphs and Combinatoric


In this note we prove that a binary string of lengthn can have no more than\(2^{k + 1} - 1 + \left( {\mathop {n - k + 1}\limits_2 } \right)\) distinct factors, wherek is the unique integer such that 2k + k - 1 ≤ n < 2k+1 + k. Furthermore, we show that for eachn, this bound is actually achieved. The proof uses properties of the de Bruijn graph.


Hamiltonian Cycle Binary String Distinct Factor Disjoint Cycle Unique Integer 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    de Bruijn, N.G. A combinatorial problem. Nederl. Akad. Wetensch. Proc.49 758–764 (1946)MathSciNetGoogle Scholar
  2. 2.
    Bondy, J.A., Murty, U.S.R. Graph Theory with Applications. London, New York: Macmillan 1976Google Scholar
  3. 3.
    Fredricksen, H. A survey of full length nonlinear shift register cycle algorithms. SIAM Rev.24, 195–221 (1982)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Flye-Sainte Marie, C. Solution to problem number 58. L’Intermrdiaire des Mathématiciens1, 107–110 (1894)Google Scholar
  5. 5.
    Good, I.J. Normally recurring decimals. J. London Math. Soc.21, 167–169 (1946)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    van Lint, J.H. Combinatorial Theory Seminar, Eindhoven University of Technology (Lect. Notes Math. vol. 382) Berlin Heidelberg New York: Springer-Verlag 1974.MATHGoogle Scholar
  7. 7.
    Yoeli, M. Binary ring sequences. Amer. Math. Monthly69, 852–855 (1962)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of WaterlooOntarioCanada

Personalised recommendations