Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture

10/21/2020
by   Jeffrey Shallit, et al.
0

Recently Dekking conjectured the form of the subword complexity function for the Fibonacci-Thue-Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.

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
08/17/2021

A Note on the Permuted Puzzles Toy Conjecture

In this note, we show that a "Toy Conjecture" made by (Boyle, Ishai, Pas...
research
04/30/2023

On Rueppel's Linear Complexity Conjecture

Rueppel's conjecture on the linear complexity of the first n terms of th...
research
12/26/2021

Proof of a conjecture on a special class of matrices over commutative rings of characteristic 2

In this note, we prove the conjecture posed by Keller and Rosemarin at E...
research
10/03/2017

Normality of the Ehrenfeucht-Mycielski Sequence

We study the binary Ehrenfeucht Mycielski sequence seeking a balance bet...
research
03/01/2019

From DNF compression to sunflower theorems via regularity

The sunflower conjecture is one of the most well-known open problems in ...
research
01/27/2021

Computational irreducibility and compatibilism: towards a formalization

If our actions are determined by the laws of nature, can we meaningfully...

Please sign up or login with your details

Forgot password? Click here to reset