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

We first consider the additive Brownian motion process $(X(s_1,s_2),\ (s_1,s_2) \in \mathbb{R}^2)$ defined by $X(s_1,s_2) = Z_1(s_1) - Z_2 (s_2)$, where $Z_1$ and $Z_2 $ are two independent (two-sided) Brownian motions. We show that with…

Longest common extension queries (often called longest common prefix queries) constitute a fundamental building block in multiple string algorithms, for example computing runs and approximate pattern matching. We show that a sequence of $q$…

We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence $(S_b(n))_{n\ge 0}$ counting the number of positive entries on each row of a…

Let $S_n$ be the set of all permutations of $\{1,2,\ldots,n\}$ and let $\sigma=(\sigma_1,\sigma_2,\ldots,\sigma_n)\in S_n$. The {\it initial longest increasing sequence} (ILIS) in $\sigma$ has length $m$ if, for $1\le m\le n-1$,…

Let A be a square matrix with real entries. The spread of A is defined as the maximum of the distances among the eigenvalues of A. Let $S_m[a,b]$ denote the set of all $m\times m$ symmetric matrices with entries in the real interval $[a,b]$…

We investigate the asymptotic standard deviation of the Longest Common Subsequence (LCS) of two independent i.i.d. sequences of length n. The first sequence is drawn from a three letter alphabet {0,1,a}, whilst the second sequence is…

In the longest common substring (LCS) problem, we are given two strings $S$ and $T$, each of length at most $n$, and we are asked to find a longest string occurring as a fragment of both $S$ and $T$. This is a classical and well-studied…

Long strings emerge in many Quantum Field Theories, for example as vortices in Abelian Higgs theories, or flux tubes in Yang-Mills theories. The actions of such objects can be expanded in the number of derivatives, around a long straight…

We show that the graph of the classical Weierstrass function $\sum_{n=0}^\infty \lambda^n \cos (2\pi b^n x)$ has Hausdorff dimension $2+\log\lambda/\log b$, for every integer $b\ge 2$ and every $\lambda\in (1/b,1)$. Replacing $\cos(2\pi x)$…

The longest common substring problem consists in finding a longest string that appears as a (contiguous) substring of two input strings. We consider the dynamic variant of this problem, in which we are to maintain two dynamic strings $S$…

We show that if $B \subset \mathbb{R}^n$ and $E \subset A(n,k)$ is a nonempty collection of $k$-dimensional affine subspaces of $\mathbb{R}^n$ such that every $P \in E$ intersects $B$ in a set of Hausdorff dimension at least $\alpha$ with…

It is shown that there exists a sequence of 3-regular graphs $\{G_n\}_{n=1}^\infty$ and a Hadamard space $X$ such that $\{G_n\}_{n=1}^\infty$ forms an expander sequence with respect to $X$, yet random regular graphs are not expanders with…

In this paper we study the $b$-ary expansions of the square roots of the function defined by the recurrence $f_b(n)=b f_b(n-1)+n$ with initial value $f(0)=0$ taken at odd positive integers $n$, of which the special case $b=10$ is often…

Let $(X_i)_{i \geq 1}$ and $(Y_i)_{i\geq1}$ be two independent sequences of independent identically distributed random variables taking their values in a common finite alphabet and having the same law. Let $LC_n$ be the length of the…

We study the typical growth rate of the number of words of length n which can be extended to beta-expansions of x. In the general case we give a lower bound for the growth rate, while in the case that the Bernoulli convolution associated to…

Let $S=\{p_1,\dots,p_s\}$ be a finite non-empty set of distinct prime numbers, let $f\in \mathbb{Z}[X]$ be a polynomial of degree $n\ge 1$, and let $S'\subseteq S$ be the subset of all $p\in S$ such that $f$ has a root in $\mathbb{Z}_p$.…

We reformulate tree-level amplitudes in open superstring theory (type-I) in terms of stringy Tr$(\phi^3)$ amplitudes with various kinematical shifts in the "curve-integral" formulation: while the bosonic-string amplitude with $n$ pairs of…

A theorem of Gao, Jackson and Seward, originally conjectured to be false by Glasner and Uspenskij, asserts that every countable group admits a $2$-coloring. A direct consequence of this result is that every countable group has a strongly…

The Shortest Common Superstring problem (SCS) consists, for a set of strings S = {s_1,...,s_n}, in finding a minimum length string that contains all s_i, 1<= i <= n, as substrings. While a 2+11/30 approximation ratio algorithm has recently…

We show that there are short intervals $[x,x+y]$ containing $\gg y^{1/10}$ numbers expressible as the sum of two squares, which is many more than the average when $y=o( (\log{x})^{5/9})$. We obtain similar results for sums of two squares in…