Related papers: Sturm palindrome substitution criterion
Paper withdrawn; will be replaced by revised version containing application to lattice models as well. We study hierarchical properties of Sturmian words. These properties are similar to those of substitution dynamical systems. This…
In the spirit of previous papers, but using more general field configurations, the non-linear O(3) model in (2+1)-D, modified by the addition of both a potential-like term and a Skyrme-like term, is considered. The instanton solutions are…
Let p be a maximal palindrome in a Sturmian word s=ul_1pl_2v so that p is a palindrome and l_1pl_2 is not for letters l_1 and l_2. Let {\alpha}(p,p') be a morphism mapping letters a and b respectively to a^pb and a^p'b, |p-p'|=1. In this…
We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…
We give a new characterization of biinfinite Sturmian sequences in terms of indistinguishable asymptotic pairs. Two asymptotic sequences on a full $\mathbb{Z}$-shift are indistinguishable if the sets of occurrences of every pattern in each…
We present some addition theorems for spin-weighted spherical harmonics, generalizing previous results for scalar (spin-zero) spherical harmonics. These addition theorems involve sums over the azimuthal quantum number of products of two…
We discuss an alternate scheme, or a 'line of constant physics', which can be used when computing isospin breaking corrections to hadronic quantities. We show that within a certain class of schemes one can separate the electromagnetic…
In [A. Frid, S. Puzynina, L.Q. Zamboni, \textit{On palindromic factorization of words}, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately…
Consider infinite random words over a finite alphabet where the letters occur as an i.i.d. sequence according to some arbitrary distribution on the alphabet. The expectation and the variance of the waiting time for the first completed…
Using the recently discovered strong negative dependence properties of the symmetric exclusion process, we derive general conditions for when the normalized current of particles between regions converges to the Gaussian distribution. The…
We show that Sturm's classical comparison theorem (SCT) on the interlacing of zeros of solutions of pairs of real second order two-term ordinary differential equations necessarily fails if the usual Sturmian-type conditions on the…
Let (X_n) be a sequence of random variables (with values in a separable metric space) and (N_n) a sequence of random indices. Conditions for X_{N_n} to converge stably (in particular, in distribution) are provided. Some examples, where such…
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic factors.
We study the notion of quasiperiodicity, in the sense of "coverability", for biinfinite words. All previous work about quasiperiodicity focused on right infinite words, but the passage to the biinfinite case could help to prove stronger…
Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning questions pertaining to these objects. Specifically, a…
The supersymmetric standard model with supergravity-inspired soft breaking terms predicts a rich pectrum of sparticles to be discovered at the SSC, LHC and NLC. Because there are more supersymmetric particles than unknown parameters, one…
We offer a conjecture on sharp estimation of a definite improper integral depend on a parameter $\lambda \in (0,+\infty)$ by means of given estimate of other definite integral depend on parameters $t\in [0,+\infty)$ and $\lambda$. Such…
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…
I present a criterion for all-order finiteness in N=1 SYM theories. Three applications are given; they yield all-order finite N=1 SYM models with global symmetries of the superpotential.
We introduce an algebra given by quadratic relations in an algebra of polynomials in an infinite number of variables. Using this algebra, we prove some explicit formulas for the Sturm sequence of a polynomial.