AI Chat AI Image Generator AI Video Text to Speech

Note on a Fibonacci Parity Sequence

03/20/2022

∙

by Jeffrey Shallit, et al.

∙

∙

Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and Stoll. We strengthen one of their theorems and disprove one of their conjectures.

page 1

page 2

page 3

page 4

research

∙ 11/22/2017

A note on recent criticisms to Birnbaum's theorem

In this note, we provide critical commentary on two articles that cast d...

0 Víctor Peña, et al. ∙

research

∙ 04/27/2021

Stability of trigonometric approximation in L^p and applications to prediction theory

Let Γ be an LCA group and (μ_n) be a sequence of bounded regular Borel m...

0 Lutz Klotz, et al. ∙

research

∙ 03/27/2020

A Short Note on Analyzing Sequence Complexity in Trajectory Prediction Benchmarks

The analysis and quantification of sequence complexity is an open proble...

0 Ronny Hug, et al. ∙

research

∙ 05/06/2019

The complexity of MinRank

In this note, we leverage some of our results from arXiv:1706.06319 to p...

0 Alessio Caminata, et al. ∙

research

∙ 06/21/2019

Deep Polyphonic ADSR Piano Note Transcription

We investigate a late-fusion approach to piano transcription, combined w...

0 Rainer Kelz, et al. ∙

research

∙ 03/27/2020

A squarefree term not occurring in the Leech sequence

Let < a r r a y > The Leech sequence L is the squarefree sequence ...

0 Benjamin Wells, et al. ∙

research

∙ 04/10/2023

The Kraft–Barmpalias–Lewis-Pye lemma revisited

This note provides a simplified exposition of the proof of hierarchical ...

0 Alexander Shen, et al. ∙