相关论文: String attractors of episturmian sequences
The problem of detecting and measuring the repetitiveness of one-dimensional strings has been extensively studied in data compression and text indexing. Our understanding of these issues has been significantly improved by the introduction…
String theory is the most promising candidate theory for a unified description of all fundamental forces exist in the nature. It provides a mathematical framework that combine quantum theory with Einstein's general theory of relativity. But…
Open-string theories may be related to suitable models of oriented closed strings. The resulting construction of ``open descendants'' is illustrated in a few simple cases that exhibit some of its key features.
We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…
We present determinant formulae for the form factors of spin operators of general integrable XXX Heisenberg spin chains for arbitrary (finite dimensional) spin representations. The results apply to any "mixed" spin chains, such as…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
We propose novel algorithms for sequence prediction based on ideas from stringology. These algorithms are time and space efficient and satisfy mistake bounds related to particular stringological complexity measures of the sequence. In this…
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…
This paper investigates the dimension theory of some families of continuous piecewise linear iterated function systems. For one family, we show that the Hausdorff dimension of the attractor is equal to the exponential growth rate obtained…
We state necessary and sufficient conditions for the existence of $T$-discrete exponential attractors for semigroups in complete metric spaces. These conditions are formulated in terms of a covering condition for iterates of the absorbing…
We consider the following novel variation on a classical avoidance problem from combinatorics on words: instead of avoiding repetitions in all factors of a word, we avoid repetitions in all factors where each individual factor is considered…
We prove that if a uniformly recurrent infinite word contains as a factor any finite permutation of words from an infinite family, then either this word is periodic, or its complexity (that is, the number of factors) grows faster than…
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
The Matrix String Theory, i.e. the two dimensional U(N) SYM with N=(8,8) supersymmetry, has classical BPS solutions that interpolate between an initial and a final string configuration via a bordered Riemann surface. The Matrix String…
An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square…
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 prove that, for any pure morphic word $w$, if the frequencies of all letters in $w$ exist, then the frequencies of all factors in $w$ exist as well. This result answers a question of Saari in his doctoral thesis.
These four lectures, addressed to an audience of graduate students in experimental high energy physics, survey some of the basic concepts in string theory. The purpose is to convey a general sense of what string theory is and what it has…
An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct…