English
Related papers

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

200 papers

Let $T_{k}$ be the expanding map of $[0,1)$ defined by $T_{k}(x) = k x\ \text{mod 1}$, where $k\geq 2$ is an integer. Given $0\leq a<b\leq 1$, let $\mathcal{W}_{k}(a,b)=\{x\in [0,1)\ \vert \ T_{k}^nx\notin (a,b), \text{ for all } n\geq 0\}$…

Dynamical Systems · Mathematics 2020-01-16 Nikita Agarwal

For $\lambda \in (1/2, 1)$ and $\alpha$, we consider sets of numbers $x$ such that for infinitely many $n$, $x$ is $2^{-\alpha n}$-close to some $\sum_{i=1}^n \omega_i \lambda^i$, where $\omega_i \in \{0,1\}$. These sets are in Falconer's…

Number Theory · Mathematics 2014-01-14 Tomas Persson , Henry W. J. Reeve

We study the box dimensions of sets invariant under the toral endomorphism $(x, y) \mapsto (m x \text{ mod } 1, \, n y \text{ mod } 1)$ for integers $n>m \geq 2$. The basic examples of such sets are Bedford-McMullen carpets and, more…

Dynamical Systems · Mathematics 2024-03-20 Jonathan M. Fraser , Natalia Jurga

Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…

Number Theory · Mathematics 2022-05-02 Rainer Dietmann , Christian Elsholtz

Let $\psi:\mathbb{N}\to \mathbb{R}^+$ be a function satisfying $\phi(n)/n\to \infty$ as $n \to \infty$. We investigate from a multifractal analysis point of view the growth rate of the sums $\sum^n_{k=1}\log a_k(x)$ relative to $\psi(n)$,…

Dynamical Systems · Mathematics 2021-10-05 Lulu Fang , Lei Shang , Min Wu

Let $k$ be a natural number. We consider $k$-times continuously-differentiable real-valued functions $f:E\to\mathbb{R}$, where $E$ is some interval on the line having positive length. For $0<\alpha<1$ let $I_\alpha(f)$ denote the set of…

Classical Analysis and ODEs · Mathematics 2022-07-05 Anthony G. O'Farrell , Gavin Armstrong

We show that for the base two expansion \[ x=\sum_{i=1}^{\infty}2^{-(d_{1}(x)+d_{2}(x)+\dots+d_{i}(x))}\] with $x\in(0,1]$ and $d_{i}(x)\in\mathbb{N}$ the set $A=\{x|\lim_{i\to\infty}d_{i}(x)=\infty\}$ has Hausdorff dimension zero, this is…

Dynamical Systems · Mathematics 2026-02-03 Jörg Neunhäuserer

Given a sequence $s=(s_1,s_2,\ldots)$ of positive integers, the inversion sequences with respect to $s$, or $s$-inversion sequences, were introduced by Savage and Schuster in their study of lecture hall polytopes. A sequence…

Combinatorics · Mathematics 2013-10-22 William Y. C. Chen , Alan J. X. Guo , Peter L. Guo , Harry H. Y. Huang , Thomas Y. H. Liu

The all-pairs suffix-prefix (APSP) problem is a classical problem in string processing which has important applications in bioinformatics. Given a set $\mathcal{S} = \{S_1, \ldots, S_k\}$ of $k$ strings, the APSP problem asks one to compute…

Data Structures and Algorithms · Computer Science 2025-03-04 Masaru Kikuchi , Shunsuke Inenaga

For an operator $T \in B(X,Y)$, we denote by $a_m(T)$, $c_m(T)$, $d_m(T)$, and $t_m(T)$ its approximation, Gelfand, Kolmogorov, and absolute numbers. We show that, for any infinite dimensional Banach spaces $X$ and $Y$, and any sequence…

Functional Analysis · Mathematics 2010-09-23 Timur Oikhberg

We prove that for any real polynomial $f(x) \in\mathbb{R} [x]$ the set $$ \{\alpha \in \mathbb{R}: \liminf_{n\to \infty} n\log n ||\alpha f(n)|| >0\} $$ has positive Hausdorff dimension. Here $||\xi ||$ means the distance from $\xi $ to the…

Number Theory · Mathematics 2007-11-13 Nikolay G. Moshchevitin

Let $\beta>1$ be a real number. In this paper, the Hausdorff dimension of sets consisting of pairs of numbers with prescribed quantitative waiting time indicators in $\beta$-expansions are determined. More precisely, let $I$ be the unit…

Dynamical Systems · Mathematics 2018-06-25 Haibo Chen

Let $\gamma_{a,b}(n)$ be the number of smooth words of length $n$ over the alphabet $\{a,b\}$ with $a<b$. Say that a smooth word $w$ is \emph{left fully extendable} (LFE) if both $aw$ and $bw$ are smooth. In this paper, we prove that for…

Combinatorics · Mathematics 2011-10-03 Yun Bao Huang

We investigate the set of $x \in S^1$ such that for every positive integer $N$, the first $N$ points in the orbit of $x$ under rotation by irrational $\theta$ contain at least as many values in the interval $[0,1/2]$ as in the complement.…

Dynamical Systems · Mathematics 2011-06-06 David Ralston

We establish a scaling limit result for the length $\operatorname{LIS}(\sigma_n)$ of the longest increasing subsequence of a permutation $\sigma_n$ of size $n$ sampled from the Brownian separable permuton $\boldsymbol{\mu}_p$ of parameter…

Probability · Mathematics 2025-06-25 Arka Adhikari , Jacopo Borga , Thomas Budzinski , William Da Silva , Delphin Sénizergues

In this note, we first introduce a new problem called the longest common subsequence and substring problem. Let $X$ and $Y$ be two strings over an alphabet $\Sigma$. The longest common subsequence and substring problem for $X$ and $Y$ is to…

Data Structures and Algorithms · Computer Science 2023-08-03 R. Li , J. Deka , K. Deka

Let $S_{a,b}$ denote the sequence of leading digits of $a^n$ in base $b$. It is well known that if $a$ is not a rational power of $b$, then the sequence $S_{a,b}$ satisfies Benford's Law; that is, digit $d$ occurs in $S_{a,b}$ with…

Number Theory · Mathematics 2023-06-22 Xinwei He , A. J. Hildebrand , Yuchen Li , Yunyi Zhang

The authors have recently obtained a lower bound of the Hausdorff dimension of the sets of vectors $(x_1, \ldots, x_d)\in [0,1)^d$ with large Weyl sums, namely of vectors for which $$ \left| \sum_{n=1}^{N}\exp(2\pi i (x_1 n+\ldots +x_d…

Classical Analysis and ODEs · Mathematics 2019-07-10 Changhao Chen , Igor E. Shparlinski

A famous result by Hammersley and Versik-Kerov states that the length $L_n$ of the longest increasing subsequence among $n$ iid continuous random variables grows like $2\sqrt{n}$. We investigate here the asymptotic behavior of $L_n$ for…

Combinatorics · Mathematics 2025-11-24 Anne-Laure Basdevant , Lucas Gerin , Maxime Marivain

In the problem of the longest common substring with $k$ mismatches we are given two strings $X, Y$ and must find the maximal length $\ell$ such that there is a length-$\ell$ substring of $X$ and a length-$\ell$ substring of $Y$ that differ…

Data Structures and Algorithms · Computer Science 2020-04-29 Garance Gourdel , Tomasz Kociumaka , Jakub Radoszewski , Tatiana Starikovskaya