相关论文: String attractors of episturmian sequences

An order-preserving square in a string is a fragment of the form $uv$ where $u\neq v$ and $u$ is order-isomorphic to $v$. We show that a string $w$ of length $n$ over an alphabet of size $\sigma$ contains $\mathcal{O}(\sigma n)$…

We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the…

Let f be a diffeomorphism of a compact finite dimensional boundaryless manifold M exhibiting infinitely many coexisting attractors. Assume that each attractor supports a stochastically stable probability measure and that the union of the…

We review the basics of the dynamics of closed strings moving along the discretized line \Z. The string excitations are described by a field \phi_x(\tau) where x is the position of the string in the embedding space and \tau is a…

Studying Fermat sequence we can simply find infinitely many other rapidly growing sequences of similar properties. On the other hand this approach allows us simple construction of such sequences.

Is string theory uniquely determined by self-consistency? Causality and unitarity seemingly permit a multitude of putative deformations, at least at the level of two-to-two scattering. Motivated by this question, we initiate a systematic…

We define form factors and scattering amplitudes in Conformal Field Theory as the coefficient of the singularity of the Fourier transform of time-ordered correlation functions, as $p^2 \to 0$. In particular, we study a form factor…

In this paper we study a variant of string pattern matching which deals with tuples of strings known as \textit{multi-track strings}. Multi-track strings are a generalisation of strings (or \textit{single-track strings}) that have primarily…

A binary word is a map W : N --> {0,1}, and the set of factors of W with length n is F_n(W):={(W(i),W(i+1),...,W(i+n-1)) : i >= 0}. A word is Sturmian if |F_n(W)|=n+1 for every n>0. We show that the sum of the heights (also known as hamming…

The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…

We show that the sequence of integers which have nearly the typical number of distinct prime factors forms a Poisson process. More precisely, for $\de$ arbitrarily small and positive, the nearest neighbor spacings between integers $n$ with…

For fractals on Riemannian manifolds, the theory of iterated function systems often does not apply well directly, as fractal sets are often defined by relations that are multivalued or non-contractive. To overcome this difficulty, we…

We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{\alpha_1, \alpha_2, \cdots, \alpha_m\}$, while the…

Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A…

In these lectures we give a brief introduction to perturbative and non-perturbative string theory. The outline is the following: 1. Introduction to perturbative string theory 1.1 From point particle to extended objects 1.2 Free closed and…

A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…

We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…

The structure of the physical and strange attractors is inherently associated with the boundedness of fluctuations. The idea behind the boundedness is that a stable long-term evolution of any natural and engineered system is possible if and…

We use the methods of empirical mathematics to show that iterative logarithmic operations will result in an attractor point on the complex plane. Moreover, we demonstrate that different bases converge onto different attractors. Finally, we…

Superstring amplitudes of an arbitrary genus are calculated through super-Schottky parameters by a summation over the fermion strings. For a calculation of divergent multi-loop fermion string amplitudes a supermodular invariant…