On Brlek-Reutenauer conjecture

Details On Brlek-Reutenauer conjecture On Brlek-Reutenauer conjecture

2011-01-26

arxiv.org/abs/1101.5083v1

Mathematics

Combinatorics

Scientific paper

Brlek and Reutenauer conjectured that any infinite word u with language closed under reversal satisfies the equality 2D(u)=\sum_{n=0}^{\infty} T(n) in which D(u) denotes the defect of u and T(n) denotes C(n+1)-C(n)+2-P(n+1)-P(n), where C and P are the factor and palindromic complexity of u, respectively. Brlek and Reutenauer verified their conjecture for periodic infinite words. We prove the conjecture for uniformly recurrent words. Moreover, we summarize results and some open problems related to defect, which may be useful for the proof of Brlek-Reutenauer Conjecture in full generality.

Affiliated with

Also associated with

No associations

Rating

On Brlek-Reutenauer conjecture 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 On Brlek-Reutenauer conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Brlek-Reutenauer conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-419294