Related papers: Sturm palindrome substitution criterion
Paraphrase plagiarism identification represents a very complex task given that plagiarized texts are intentionally modified through several rewording techniques. Accordingly, this paper introduces two new measures for evaluating the…
In this paper, we analyze the periodic factors of Sturmian words for the findings to lead to a linear-time algorithm for the computation of runs in this class of words which, to our best knowledge, is an open problem in literature.
This paper is a corrigendum to the article 'On the ideal theorem for number fields`. The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term.
M. Smorodinsky and S. Laurent have initiated the study of the filtrations of split-word processes, in the framework of discrete negative time. For these filtrations, we show that Laurent's sufficient condition for non standardness is also…
Associated to each complex-valued random variable satisfying appropriate integrability conditions, we introduce a different generalization of the Stirling numbers of the second kind. Various equivalent definitions are provided. Attention,…
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…
The issue of asymmetric uncertainties resulting from fits, nonlinear propagation and systematic effects is reviewed. It is shown that, in all cases, whenever a published result is given with asymmetric uncertainties, the value of the…
In this paper, we establish a generalization of Sturm--Picone comparison theorem for a pair of fractional nonlocal equations: \begin{eqnarray*} \begin{gathered} (-div. (A_1(x)\nabla))^{s} u = C_{1}(x) u \,\,\,\mbox{in}\,\,\Omega, u = 0…
This paper reveals a novel numerical method, the sequential test, which approves chaos through sequences of numbers observations. The method alights alongside the Lyapunov exponent and bifurcation diagram test. Explicitly elucidation of the…
An exact expression for the determinant of the splitting matrix is derived: it allows us to analyze the asympotic behaviour needed to amend the large angles theorem proposed in Ann. Inst. H. Poincar\'e, B-60, 1, 1994. The asymptotic…
We give a rigorous proof for the linear stability of the Skyrmion. In addition, we provide new proofs for the existence of the Skyrmion and the GGMT bound.
We provide a version of Quillen's homological stability criterion for continuous bounded cohomology. This criterion is exploited in the companion paper (arXiv:2201.03879) in order to derive new bounded cohomological stability results for…
Multifractal analysis of stochastic processes deals with the fine scale properties of the sample paths and seeks for some global scaling property that would enable extracting the so-called spectrum of singularities. In this paper we…
We obtain sufficient conditions for correct solvability of Sturm-Liouville Equation with Delayed Argument on the whole axis.
The main result of the paper gives criteria for extendibility of sesquilinear form-valued mappings defined on symmetric subsets of *-semigroups to positive definite ones. By specifying this we obtain new solutions of: * the truncated…
We investigate the scattered palindromic subwords in a finite word. We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an upper bound for the total number of palindromic subwords in a…
We present a new probabilistic model checker Storm. Using state-of-the-art libraries, we aim for both high performance and versatility. This extended abstract gives a brief overview of the features of Storm.
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
Sturmian words are infinite binary words with many equivalent definitions: They have a minimal factor complexity among all aperiodic sequences; they are balanced sequences (the labels 0 and 1 are as evenly distributed as possible) and they…
We sharpen the moment comparison inequalities with sharp constants for sums of random vectors uniform on Euclidean spheres, providing a deficit term (optimal in high dimensions).