Related papers: Common substring with shifts in b-ary expansions

We consider the following polynomial generalization of Stern's diatomic series: let $s_1(x,y)=1$, and for $n\geq 1$ set $s_{2n}(x,y)=s_n(x,y)$ and $s_{2n+1}(x,y)=x\,s_n(x,y)+y\,s_{n+1}(x,y)$. The coefficient $[x^iy^j]s_n(x,y)$ is the number…

Let \( \ell_n(x) \) denote the maximal run-length among the first \( n \) digits of the L\"{u}roth expansion of \( x\in(0,1] \). While \( \ell_n(x) \) grows logarithmically, we investigate the finer multifractal properties of the…

We investigate the Hausdorff dimension of level sets defined by digit growth rates in $\theta$-expansions, a generalization of regular continued fractions. For any $\alpha \geq 0$, we prove that the set \[ E_\theta(\alpha) = \left\{ x \in…

For any $\beta > 1$, denoted by $r_n(x,\beta)$ the maximal length of consecutive zeros amongst the first $n$ digits of the $\beta$-expansion of $x\in[0,1]$. The limit superior (respectively limit inferior) of $\frac{r_n(x,\beta)}{n}$ is…

In this paper, the Beatty multiple shift is introduced, which is a generalization of the multiplicative shift of finite type (multiple SFT) [Kenyon, Peres and Solomyak, Ergodic Theory and Dynamical Systems, 2012] and the affine multiple…

Let $\{s_n\}$ and $\{t_n\}$ be two sequences of positive real numbers. Under some mild conditions on $\{s_n\}$ and $\{t_n\}$, we give the precise formula of the Hausdorff dimension of the set \[ \mathbb{E}(\{s_n\},\{t_n\}):=\Big\{x\in(0,1):…

Let $S \subseteq \mathbb{N}$ have the property that for each $k \in S$ the set $(S - k) \cap \mathbb{N} \setminus S$ has asymptotic density $0$. We prove that there exists a basic sequence $Q$ where the set of numbers $Q$-normal of all…

Let $\beta>1$, $I$ be the unite interval $[0,1)$ and $\phi$ be an integer function defined on $\mathbb{N}\setminus\{0\}$ satisfying $1\leq\phi(n)\leq n$. Denote by $A_\phi(x,\beta)$ the Erd\"{o}s-R\'{e}nyi average of $x\in I$ associated…

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

Given two {0,1}-sequences X and Y of lengths m and n, respectively, we write L(X,Y) to denote the length of the longest common subsequence (LCS) of X and Y, and write L(m,n) to denote the expected value of L(X,Y) when X and Y are random…

For a real $x\in(0,1)\setminus\mathbb{Q}$, let $x=[a_1(x),a_2(x),\cdots]$ be its continued fraction expansion. Let $s_n(x)=\sum_{j=1}^n a_j(x)$. The Hausdorff dimensions of the level sets $E_{\varphi(n),\alpha}:=\{x\in(0,1):…

We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that the expected value of L, when normalized by n,…

For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…

For two real bases $q_0, q_1 > 1$, a binary sequence $i_1 i_2 \cdots \in \{0,1\}^\infty$ is the $(q_0,q_1)$-expansion of the number \[ \pi_{q_0,q_1}(i_1 i_2 \cdots) = \sum_{k=1}^\infty \frac{i_k}{q_{i_1} \cdots q_{i_k}}. \] Let…

In this paper, we study the metrical theory of the growth rate of digits in L\"{u}roth expansions. More precisely, for $ x\in \left( 0,1 \right] $, let $ \left[ d_1\left( x \right) ,d_2\left( x \right) ,\cdots \right] $ denote the…

For $x\in [0,1],$ the run-length function $r_n(x)$ is defined as the length of the longest run of $1$'s amongst the first $n$ dyadic digits in the dyadic expansion of $x.$ Erd\H{o}s and R\'enyi proved that…

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…

Let x, y be strings of equal length. The Hamming distance h(x,y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x,y), the Hamming distance…

We revisit the problem of longest common property preserving substring queries introduced by~Ayad et al. (SPIRE 2018, arXiv 2018). We consider a generalized and unified on-line setting, where we are given a set $X$ of $k$ strings of total…

Let $\mathbb{Z}_p$ be the ring of $p$-adic integers and $a_n(x)$ be the $n$-th digit of Schneider's $p$-adic continued fraction of $x\in p\mathbb{Z}_p$. We study the growth rate of the digits $\{a_n(x)\}_{n\geq1}$ from the viewpoint of…