A note on the longest matching consecutive subsequence (Q2297524)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the longest matching consecutive subsequence |
scientific article; zbMATH DE number 7169900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the longest matching consecutive subsequence |
scientific article; zbMATH DE number 7169900 |
Statements
A note on the longest matching consecutive subsequence (English)
0 references
20 February 2020
0 references
Let \(N\) be a fixed positive integer, \(N>1\). Then every \(x\in (0,1]\) can be represented by the \(N\)-ary expansion \[ x=\sum^{\infty} _{k=1}{\frac{\omega_k(x)}{N^k}}=0.\omega_1(x)\omega_2(x)\ldots \omega_k(x)\ldots , \] where \(\omega_k(x)\in\{0,1,\dots , N-1\}\). Suppose \(x\) and \(y\) are numbers from \((0,1]\) such that \(x=0.\omega_1(x)\omega_2(x)\ldots \omega_n(x)\ldots\) and \(y=0.\omega_1(y)\omega_2(y)\ldots \omega_n(y)\ldots\). One can denote the length of the longest matching consecutive subsequence \(M_n(x,y)\) of \(x\) and \(y\) in the first \(n\) digits as \[ M_n(x,y)=\max\{l: \omega_{i+1}(x)=\omega_{i+1}(y), \dots , \omega_{i+l}(x)=\omega_{i+l}(y)~\text{for some}~ 0\le i\le n-l\}. \] Let \(\varphi : \mathbb N \to (0,+\infty)\) be a monotonically increasing function satisfying \(\lim_{n\to +\infty}{\varphi(n)}=+\infty\). The present article is devoted to the Hausdorff dimension of sets of the form \[ E_{\varphi}=\left\{(x,y)\in (0,1]\times (0,1]:\limsup_{n\to \infty}{\frac{M_n(x,y)}{\varphi(n)}=1}\right\} \] whenever \(\alpha=0\) or \(\alpha=1\), where \[ \alpha=\liminf_{n\to\infty}{\frac{\varphi(n)}{n}}. \] The main statement on the fact that the Hausdorff dimension of \(E_{\varphi}\) equals \(2-\alpha\) whenever \(\alpha=0\) or \(\alpha=1\) is proved. The case when \(\varphi(n)=n^{\gamma}\), where \(0<\gamma\le 1\), is considered. For a general monotonically increasing function \(\varphi(n)\), one hypothesis on the Hausdorff dimension of \(E_{\varphi}\) is given. The authors note the following: ``The longest matching consecutive subsequence plays an important role in information theory and molecular biology. We consider the Hausdorff dimension of the set of points whose rate of growth of the longest matching consecutive subsequence is almost equal to a class of monotonically increasing functions.'' This paper is a continuation of the paper [Int. J. Number Theory 15, No. 8, 1745--1758 (2019; Zbl 1437.11116)].
0 references
longest matching consecutive subsequence
0 references
Hausdorff dimension
0 references
\(N\)-ary expansion
0 references
0 references
0.8608047366142273
0 references
0.857877790927887
0 references
0.7404459118843079
0 references
0.7150669097900391
0 references