Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Abelian Squares in Finite Strings

L.J. Cummings 1
1 Faculty of Mathematics University of Waterloo Waterloo, Ontario Canada N2L 3G1
  • Published: 30/06/1997

Abstract

A string is strongly square-free if it contains no Abelian squares; that is, adjacent substrings which are permutations of each other. We discuss recent results concerning the construction of strongly square-free finite strings.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
L.J. Cummings . Abelian Squares in Finite Strings[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 024. 201-208. DOI: .