Critical exponent of binary words with few distinct palindromes

HIGHLIGHTS

  • What: To obtain the step between items (c) and_(d), the authors show that there exists no infinite cubefree word containing at most 14 palindromes. The authors show that x is 25 -free by checking the central factor of x of length 200.
  • Who: L`ubomı́ra Dvořákováa and collaborators from the (UNIVERSITY) have published the paper: Critical Exponent of Binary Words with Few Distinct Palindromes, in the Journal: (JOURNAL)

SUMMARY

    (B) (n) vB=011001µ(ϕ(1)ϕ3 · · · ϕ2n+1 ϕ2n ϕ2n-2 · · · ϕ2 0)=µ(0ϕ(1)ϕ3 · · · ϕ2n . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?