Related papers: String attractors of some simple-Parry automatic s…
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…
We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…
In this paper, we first prove an abstract theorem on the existence of polynomial attractors and the concrete estimate of their attractive velocity for infinite-dimensional dynamical systems, then apply this theorem to a class of wave…
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in…
Beginning with a review of the arguments leading to the so-called c=1 barrier in the continuum formulation of noncritical string theory, the pathology is then exhibited in a discretized version of the theory, formulated through dynamical…
Let $w$ be an infinite word on an alphabet $A$. We denote by $(n_i)_{i \geq 1}$ the increasing sequence (assumed to be infinite) of all lengths of palindrome prefixes of $w$. In this text, we give an explicit construction of all words $w$…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
We study the system of axion strings that forms in the early Universe if the Peccei-Quinn symmetry is restored after inflation. Using numerical simulations, we establish the existence of an asymptotic solution to which the system is…
We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular dictionary compressors. To achieve this result we combine several recent findings,…
Word2vec (Mikolov et al., 2013) has proven to be successful in natural language processing by capturing the semantic relationships between different words. Built on top of single-word embeddings, paragraph vectors (Le and Mikolov, 2014)…
The suffix array, perhaps the most important data structure in modern string processing, is often augmented with the longest common prefix (LCP) array which stores the lengths of the LCPs for lexicographically adjacent suffixes of a string.…
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…
We discuss different formulations and approaches to string theory and $ 2d$ quantum gravity. The generic idea to get a unique description of {\it many} different string vacua altogether is demonstrated on the examples in $ 2d$ conformal,…
In this note we expose some surprising connections between string theory and statistical inference. We consider a large collective of agents sweeping out a family of nearby statistical models for an M-dimensional manifold of statistical…
The paper contains enumerative combinatorics for positive braids, square free braids, and simple braids, emphasizing connections with classical Fibonacci sequence. The simple subgraph of the Cayley graph of the braid group is analyzed in…
The domains of data mining and knowledge discovery make use of large amounts of textual data, which need to be handled efficiently. Specific problems, like finding the maximum weight ordered common subset of a set of ordered sets or…
For a process U(t,s) acting on a one-parameter family of normed spaces, we present a notion of time-dependent attractor based only on the minimality with respect to the pullback attraction property. Such an attractor is shown to be…
We propose a technique for exploring the abelian complexity of recurrent infinite words, focusing particularly on infinite words associated with Parry numbers. Using that technique, we give the affirmative answer to the open question posed…
Let $\Phi$ be a subset of the simple roots of a (possibly non-reduced) abstract root system $\Sigma$, and let $\lambda \in \Sigma$. We define the $\Phi$-string of $\lambda$ as the set of elements in $\Sigma \cup \{0\}$ of the form $\lambda…
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,v_2)$ is formed if the concatenation of the word $v_1$ and the suffix of $v_2$ of length $k-\ell$ is a subword of the infinite word. In this…