相关论文: Structure and growth of $\mathbb{R}$-bonacci words

An $n$-length binary word is $q$-decreasing, $q\geq 1$, if every of its length maximal factor of the form $0^a1^b$ satisfies $a=0$ or $q\cdot a > b$.We show constructively that these words are in bijection with binary words having no…

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…

The Stern-Brocot tree and Minkowki's question mark function $?(x)$ (or Conway's box function) are related to the continued fraction expansion of numbers from Q with unary encoding of the partial denominators. We first define binary…

The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…

Consider the set of those binary words with no non-empty factors of the form $xxx^R$. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the…

This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote…

A finite word $w$ is called \emph{rich} if it contains $\vert w\vert+1$ distinct palindromic factors including the empty word. Let $q\geq 2$ be the size of the alphabet. Let $R(n)$ be the number of rich words of length $n$. Let $d>1$ be a…

In this article, we present a binary tree with vertices given by rational functions $p(x)/q(x)$; the root and functional derivation of children are inspired by continued fractions. We prove some special properties of the tree. For example,…

In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…

For an integer $n\geq 1$, consider the $n$-th metallic number $\phi_n=\frac{n+\sqrt{n^2+4}}{2}$ (e.g. $\phi_1$ is the golden number) and denote by $[\phi_n]_q$ its $q$-deformation in the sense of S. Morier-Genoud and V. Ovsienko. This is an…

Let $F_n$ denote the $n^{th}$ Fibonacci number relative to the initial conditions $F_0=0$ and $F_1=1$. Bach, Paudyal, and Remmel introduced Fibonacci analogues of the Stirling numbers called Fibo-Stirling numbers of the first and second…

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

A binary string $f$ is a factor of string $u$ if $f$ appears as a sequence of $|f|$ consecutive bits of $u$, where $|f|$ denotes the length of $f$. Generalized Fibonacci cube $Q_{d}(f)$ is the graph obtained from the $d$-cube $Q_{d}$ by…

We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…

We introduce a family of averaged meta-Fibonacci recursions $$ Q_{\alpha,m}(n) = 1+ \left\lfloor \alpha \frac1m \sum_{j=1}^m Q_{\alpha,m}(n-Q_{\alpha,m}(n-j)) \right\rfloor , $$ with initial conditions $$…

For a reduced F-finite ring R of characteristic p >0 and q=p^e one can write R^{1/q} = R^{a_q} \oplus M_q, where M_q has no free direct summands over R. We investigate the structure of F-finite, F-pure rings R by studying how the numbers…

A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word one may delete the repeated block of a square, obtaining…

Let $R(n)$ denote the number of rich words of length $n$ over a given finite alphabet. In 2017 it was proved that $\lim_{n\rightarrow\infty} \sqrt[n]{R(n)}=1$; it means the number of rich words has a subexponential growth. However, up to…

A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…