On the maximum number of cubic subwords in a word

  • Authors:

  • M. Kubica;J. Radoszewski;W. Rytter;T. Waleń

  • Affiliations:

  • Institute of Informatics, ul. Banacha 2, University of Warsaw, Warsaw, Poland;Institute of Informatics, ul. Banacha 2, University of Warsaw, Warsaw, Poland;Institute of Informatics, ul. Banacha 2, University of Warsaw, Warsaw, Poland and Faculty of Mathematics and Informatics, Copernicus University, Toruń, Poland;Institute of Informatics, ul. Banacha 2, University of Warsaw, Warsaw, Poland

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate the problem of the maximum number of different cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum number of squares in a word is not well understood. Several new results related to this problem are presented in the paper. We consider two simple problems related to the maximum number of subwords which are squares or which are highly repetitive; then we provide a nontrivial estimation for the number of cubes. We show that the maximum number of squares xx such that x is not a primitive word (nonprimitive squares) in a word of length n is exactly @?n2@?-1, and the maximum number of subwords of the form x^k, for k=3, is exactly n-2. In particular, the maximum number of cubes in a word is not greater than n-2 either. Using properties of occurrences of cubes, we improve this bound significantly. We show that the maximum number of cubes in a word of length n is between 12n-2n and 45n.