Related papers: Frogs, hats and common subsequences
We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…
We consider Activated Random Walk (ARW), a particle system with mass conservation, on the cycle $\mathbb{Z}/n\mathbb{Z}$. One starts with a mass density $\mu>0$ of initially active particles, each of which performs a simple symmetric random…
Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent…
A theory of systems with long-range correlations based on the consideration of binary N-step Markov chains is developed. In the model, the conditional probability that the i-th symbol in the chain equals zero (or unity) is a linear function…
This paper proposes methods of predicting dynamic time series (including non-stationary ones) based on a linguistic approach, namely, the study of occurrences and repetition of so-called N-grams. This approach is used in computational…
We address the existence and dynamics of one-dimensional harmonically confined quantum droplets, appearing in two-component mixtures by deploying a nonperturbative approach. We find that, in symmetric homonuclear settings, beyond…
We introduce the discrete Fr\'echet gap and its variants as an alternative measure of similarity between polygonal curves. We believe that for some applications the new measure (and its variants) may better reflect our intuitive notion of…
A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] \cdots w[i_k]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq \vert w \vert$. A word $w$ is \emph{$k$-subsequence universal} over an alphabet $\Sigma$ if…
A {\em subsequence} of a word $w$ is a word $u$ that can be obtained by deleting some letters from $w$ while maintaining the relative order of the remaining letters, e.g., $\mathtt{lala}$ is a subsequence of $\mathtt{alfalfa}$. A word, over…
A generic aggregate forming system in two dimensions (2D) is studied using canonical ensemble constant temperature molecular dynamics simulation. The aggregates form due to the competition between short range attraction and long range…
The $S$-gap shifts have a dynamically and combinatorially rich structure. Dynamical properties of the $S$-gap shift can be related to the properties of the set $S$. This interplay is particularly interesting when $S$ is not syndetic such as…
Understanding the non-equilibrium dynamics of gauge theories remains a fundamental challenge in high-energy physics. Indeed, most large scale experiments on gauge theories intrinsically rely on very far-from equilibrium dynamics, from…
A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of $u$.…
The recent dramatic increase in online data availability has allowed researchers to explore human culture with unprecedented detail, such as the growth and diversification of language. In particular, it provides statistical tools to explore…
Although real-world text datasets, such as DNA sequences, are far from being uniformly random, average-case string searching algorithms perform significantly better than worst-case ones in most applications of interest. In this paper, we…
Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p. More precisely, given a…
Entanglement fluctuations associated with Schr\"{o}dinger evolution of wavefunctions offer a unique perspective on various fundamental issues ranging from quantum thermalization to state preparation in quantum devices. Very recently, a…
We investigate the longest common substring problem for encoded sequences and its asymptotic behaviour. The main result is a strong law of large numbers for a re-scaled version of this quantity, which presents an explicit relation with the…
An absent factor of a string $w$ is a string $u$ which does not occur as a contiguous substring (a.k.a. factor) inside $w$. We extend this well-studied notion and define absent subsequences: a string $u$ is an absent subsequence of a string…
In this paper, we investigate the use of proxemics and dynamics for automatically identifying conversing groups, or so-called F-formations. More formally we aim to automatically identify whether wearable sensor data coming from 2 people is…