The powers of smooth words over arbitrary 2-letter alphabets

Details The powers of smooth words over arbitrary 2-letter alphabets The powers of smooth words over arbitrary 2-letter alphabets

2009-04-03

arxiv.org/abs/0904.0562v2

Mathematics

Combinatorics

28 pages

Scientific paper

Carpi (1993) and Lepisto (1994) proved independently that smooth words are cube-free for the alphabet {1, 2}, but nothing is known on whether for the other 2-letter alphabets, smooth words are k-power-free for some suitable positive integer k. In this paper, we first establish the derivative formula of the concatenation of two smooth words and power derivative formula of smooth words over arbitrary 2-letter alphabets. Then by making use of power derivative formula, for arbitrary 2-letter alphabet {a, b} with a, b being positive integers and a

Affiliated with

Also associated with

No associations

Rating

The powers of smooth words over arbitrary 2-letter alphabets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The powers of smooth words over arbitrary 2-letter alphabets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The powers of smooth words over arbitrary 2-letter alphabets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-150742