Proof of a conjecture of Krawchuk and Rampersad

01/27/2023
βˆ™
by   Jeffrey Shallit, et al.
βˆ™
0
βˆ™

We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal behavior of c(n), where c(n) counts the number of length-n factors of the Thue-Morse word 𝐭, up to cyclic rotation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 03/31/2022

A Proof of the Kahn-Kalai Conjecture

We prove the "expectation-threshold" conjecture of Kahn and Kalai....
research
βˆ™ 01/27/2023

A proof of the Nisan-Ronen conjecture

Noam Nisan and Amir Ronen conjectured that the best approximation ratio ...
research
βˆ™ 03/24/2023

Roudneff's Conjecture in Dimension 4

J.-P. Roudneff conjectured in 1991 that every arrangement of n β‰₯ 2d+1β‰₯ 5...
research
βˆ™ 09/29/2022

On the Forsythe conjecture

Forsythe formulated a conjecture about the asymptotic behavior of the re...
research
βˆ™ 10/03/2017

Normality of the Ehrenfeucht-Mycielski Sequence

We study the binary Ehrenfeucht Mycielski sequence seeking a balance bet...
research
βˆ™ 10/24/2020

Word2vec Conjecture and A Limitative Result

Being inspired by the success of word2vec <cit.> in capturing analogies,...
research
βˆ™ 08/29/2021

A new proof of the Gasca-Maeztu conjecture for n = 5

An n-correct node set 𝒳 is called GC_n set if the fundamental polynomial...

Please sign up or login with your details

Forgot password? Click here to reset