Related papers: Sturm palindrome substitution criterion
Information valuable words are the strings with the significant deviation of real frequency from the expected one. The expected frequency is determined through the maximum entropy principle of the reconstructed (extended) frequency…
A brief review of the status of duality symmetries in string theory is presented. The evidence is accumulating rapidly that an enormous group of duality symmetries, including perturbative T dualities and non-perturbative S-dualities,…
Some properties of Chern-Simons terms are presented and their physical utility is surveyed.
In the study of infinite words, various notions of balancedness provide quantitative measures for how regularly letters or factors occur, and they find applications in several areas of mathematics and theoretical computer science. In this…
This paper is concerned with palindromes occurring in characteristic Sturmian words $c_\alpha$ of slope $\alpha$, where $\alpha \in (0,1)$ is an irrational. As $c_\alpha$ is a uniformly recurrent infinite word, any (palindromic) factor of…
A finite word $f$ is Hamming-isometric if for any two word $u$ and $v$ of same length avoiding $f$, $u$ can be transformed into $v$ by changing one by one all the letters on which $u$ differs from $v$, in such a way that all of the new…
We give asymptotic formulas for the number of balanced words whose slope $\alpha$ and intercept $\rho$ lie in a prescribed rectangle. They are related to uniform distribution of Farey fractions and Riemann Hypothesis. In the general case,…
We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…
The purpose of [1] was as follows. ?We consider special sets of continuants which occur in applications. For these sets we solve the problem of finding maximal and minimal continuants. There are several methods for finding extremum such as…
In this paper we consider an edit distance with swap and mismatch operations, called tilde-distance, and introduce the corresponding definition of tilde-isometric word. Isometric words are classically defined with respect to Hamming…
In this paper, a new type of comparison theorem is presented for some initial-boundary value problems of second order nonlinear parabolic systems with nonlinear boundary conditions. This comparison theorem has an advantage over the…
Choices in the semantics and the signature of a theory are integral in determining how the theory is used and how challenging it is to reason over it. Our interest in this paper lies in the SMT theory of sequences. Various versions of it…
We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors of a…
A new algorithm for extraction of asymmetries from polarized lepton-nucleon scattering data is proposed. The algorithm is stable to set-up acceptance and/or luminosity monitor acceptance variations. A statistical test for checking the data…
We prove sharp bounds for the equivalence of norms in tent spaces with respect to changes of angles. Some applications are given.
A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended…
In this paper, we establish a spatial central limit theorem for a large class of supercritical branching, not necessarily symmetric, Markov processes with spatially dependent branching mechanisms satisfying a second moment condition. This…
For the Legendre-Stirling numbers of the second kind asymptotic formulae are derived in terms of a local central limit theorem. Thereby, supplements of the recently published asymptotic analysis of the Chebyshev-Stirling numbers are…
We report conditions on a switching signal that guarantee that solutions of a switched linear systems converge asymptotically to zero. These conditions are apply to continuous, discrete-time and hybrid switched linear systems, both those…