The Kolakoski sequence S is the unique element of {1,2}^ω starting with 1 and coinciding with its own run length encoding. We use the parity of the lengths of particular subclasses of initial words of S as a unifying tool to address the links between the main open questions - recurrence, mirror/reversal invariance and asymptotic density of digits. In particular we prove that recurrence implies reversal invariance, and give sufficient 1 conditions which would imply that the density of 1s is 2
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
ABSTRACT. By Zeckendorf’s theorem, an equivalent definition of the Fibonacci sequence (appro-priatel...
We study the disjunctive binary sequence introduced by Ehrenfeucht and Mycielski in [1]. The match ...
The Kolakoski sequence S is the unique element of {1,2}^ω starting with 1 and coinciding with its o...
The classical Kolakoski sequence is the unique sequence of two symbols {1,2}, starting with 1, which...
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and ...
The classical Kolakoski sequence is the unique sequence of two symbols {1, 2}, starting with 1, whic...
One of the oustanding open problems at the heart of gapped sequence alignment is the longest common ...
Inverse problems study the structure of a set A when the A + A is “small”. In the article, the struc...
The set of indices that correspond to the positive entries of a sequence ofnumbers is called its pos...
AbstractWe derive an upper bound for the minimal length of a linear recurrence satisfied by a sequen...
The problem of the order of the fluctuation of the Longest Common Subsequence (LCS) of two independe...
The amount of the data in the world enlarges all the time and therefore efficient methods are needed...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
AbstractWe give a characterization of the palindromes in a class of infinite words over Σ={1,2} rela...
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
ABSTRACT. By Zeckendorf’s theorem, an equivalent definition of the Fibonacci sequence (appro-priatel...
We study the disjunctive binary sequence introduced by Ehrenfeucht and Mycielski in [1]. The match ...
The Kolakoski sequence S is the unique element of {1,2}^ω starting with 1 and coinciding with its o...
The classical Kolakoski sequence is the unique sequence of two symbols {1,2}, starting with 1, which...
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and ...
The classical Kolakoski sequence is the unique sequence of two symbols {1, 2}, starting with 1, whic...
One of the oustanding open problems at the heart of gapped sequence alignment is the longest common ...
Inverse problems study the structure of a set A when the A + A is “small”. In the article, the struc...
The set of indices that correspond to the positive entries of a sequence ofnumbers is called its pos...
AbstractWe derive an upper bound for the minimal length of a linear recurrence satisfied by a sequen...
The problem of the order of the fluctuation of the Longest Common Subsequence (LCS) of two independe...
The amount of the data in the world enlarges all the time and therefore efficient methods are needed...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
AbstractWe give a characterization of the palindromes in a class of infinite words over Σ={1,2} rela...
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
ABSTRACT. By Zeckendorf’s theorem, an equivalent definition of the Fibonacci sequence (appro-priatel...
We study the disjunctive binary sequence introduced by Ehrenfeucht and Mycielski in [1]. The match ...