Related papers: More Kolakoski Sequences
This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.
We investigate the set of limit points of averages of rearrangements of a given sequence. We study how the properties of the sequence determine the structure of that set and what type of sets we can expect as the set of such accessible…
This paper studies the density of zero and one in subwords of the Fibonacci word with lengths less than thirty and compares them to the densities of their corresponding palindromes. We used computational methods to produce a sufficiently…
For a simple graph we introduce notions of the double star sequence, the double star frequently sequence and prove that these sequences are inverses of each other. As a consequence, we express the general second Zagreb index in terms of the…
A supersequence over a finite set is a sequence that contains as subsequence all permutations of the set. This paper defines an infinite array of methods to create supersequences of decreasing lengths. This yields the shortest known…
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words with an infinity of pseudopalindromic prefixes, called…
We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…
A large family of words must contain two words that are similar. We investigate several problems where the measure of similarity is the length of a common subsequence. We construct a family of n^{1/3} permutations on n letters, such that…
By replacing the letters to polynomials in F_2[t], an infinite word, over a finite alphabet, can be seen as the sequence of partial quotients of a continued fraction in F_2((1/t)). Here is described a family of such infinite words,…
This paper is concerned with the study of a family of fixed point iterations combining relaxation with different inertial (acceleration) principles. We provide a systematic, unified and insightful analysis of the hypotheses that ensure…
We consider sigma-words, which are words used by Evdokimov in the construction of the sigma-sequence. We then find the number of occurrences of certain patterns and subwords in these words.
This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…
The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…
Very odd sequences were introduced in 1973 by J. Pelikan who conjectured that there were none of length >=5. This conjecture was disproved by MacWilliams and Odlyzko in 1977 who proved there are in fact many very odd sequences. We give…
We investigate the order of the $r$-th, $1\le r < +\infty$, central moment of the length of the longest common subsequence of two independent random words of size $n$ whose letters are identically distributed and independently drawn from a…
Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the community of combinatorics on words. In this context, they have…
In this paper we introduce I^K-convergence which is a common generalization of the I^K-convergence of sequences, double sequences and nets. We show that many results that were shown before for these special cases are true for the…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
Hartle and Srednicki have suggested that standard quantum theory does not favor our typicality. Here an alternative version is proposed in which typicality is likely, Eventual Quantum Mechanics. This version allows one to calculate…
We study bracket words, which are a far-reaching generalisation of Sturmian words, along Hardy field sequences, which are a far-reaching generalisation of Piatetski--Shapiro sequences $\lfloor n^c \rfloor$. We show that thus obtained…