相关论文: String attractors of episturmian sequences

Borel and Reutenauer (2006) showed, \emph{inter alia}, that a word $w$ of length $n>1$ is conjugate to a Christoffel word if and only if for $k=0,1, \dots , n-1$, $w$ has $k+1$ distinct circular factors of length $k$. Sturmian words are the…

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

The paper is devoted to constructing a random exponential attractor for some classes of stochastic PDE's. We first prove the existence of an exponential attractor for abstract random dynamical systems and study its dependence on a parameter…

We study the stable attractors of a class of continuous dynamical systems that may be idealized as networks of Boolean elements, with the goal of determining which Boolean attractors, if any, are good approximations of the attractors of…

We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most properties of ordinary maximal bifix codes to bifix codes…

We describe a class of fractal attractors induced by \beta-shifts. We use a coding by these shifts to show that the systems are mixing with topological entropy log \beta and have an ergodic measure of full entropy. Moreover we determine the…

In this short note we show that a k-automatic sequence and a Sturmian sequence cannot have arbitrarily large factors in common.

Let $K$ be a non-archimedean local field and let $G = \mathrm{GL}_n(K)$. We have shown in previous work that the smooth dual $\mathbf{Irr}(G)$ admits a complex structure: in this article we show how the epsilon factors interface with this…

We define string geometry: spaces of superstrings including the interactions, their topologies, charts, and metrics. Trajectories in asymptotic processes on a space of strings reproduce the right moduli space of the super Riemann surfaces…

We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…

We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…

An exponent-string is an extension of traditional strings that can incorporate real-numbered exponents, indicating the quantity of characters. This novel representation overcomes the limitations of traditional discrete string by enabling…

We consider the description of reggeon amplitudes (Wilson lines form factors) in N=4 SYM within the framework of four dimensional ambitwistor string theory. The latter is used to derive scattering equations representation for reggeon…

We present an efficient algorithm for finding all approximate occurrences of a given pattern $p$ of length $m$ in a text $t$ of length $n$ allowing for translocations of equal length adjacent factors and inversions of factors. The algorithm…

When considering binary strings, it's natural to wonder how many distinct subsequences might exist in a given string. Given that there is an existing algorithm which provides a straightforward way to compute the number of distinct…

We begin by outlining the ancient puzzle of off shell currents and infinite size particles in a string theory of hadrons. We then consider the problem from the modern AdS/CFT perspective. We argue that although hadrons should be thought of…

In this paper we introduce a new family of string processing problems. We are given two or more strings and we are asked to compute a factor common to all strings that preserves a specific property and has maximal length. Here we consider…

Counting substrings/subsequences that preserve some property (e.g., palindromes, squares) is an important mathematical interest in stringology. Recently, Glen et al. studied the number of Lyndon factors in a string. A string $w = uv$ is…

A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the {\it oc-sequence} of a word, which is the binary sequence…

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…