English
Related papers

Related papers: Sturm palindrome substitution criterion

200 papers

The present note refers to a result proposed in [Elhadj and Sprott, 2012], and shows that the Theorem therein is not correct. We explain that a proof of that Theorem cannot be given, as the statement is not correct, and we underline a…

Dynamical Systems · Mathematics 2014-04-08 L. Gardini , D. Radi

The prefix palindromic length $p_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. This function is surprisingly difficult to…

Combinatorics · Mathematics 2022-03-15 Dora V. Bulgakova , Anna E. Frid , Jérémy Scanvic

The classification of metrics and algorithms search for related terms via WordNet, Roget's Thesaurus, and Wikipedia was extended to include adapted HITS algorithm. Evaluation experiments on Information Content and adapted HITS algorithm are…

Information Retrieval · Computer Science 2008-01-16 A. A. Krizhanovsky

Common algorithms for sentence and word-alignment allow the automatic identification of word translations from parallel texts. This study suggests that the identification of word translations should also be possible with non-parallel and…

cmp-lg · Computer Science 2008-02-03 Reinhard Rapp

We propose a sequential nonparametric test for detecting a change in distribution, based on windowed Kolmogorov--Smirnov statistics. The approach is simple, robust, highly computationally efficient, easy to calibrate, and requires no…

Methodology · Statistics 2016-12-26 Oscar Hernan Madrid Padilla , Alex Athey , Alex Reinhart , James G. Scott

We hereby present a solution to a semantic textual similarity (STS) problem in which it is necessary to match two sentences containing, as the only distinguishing factor, highly specific information (such as names, addresses, identification…

Computation and Language · Computer Science 2023-11-29 Gioele Cadamuro , Marco Gruppo

We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.

Formal Languages and Automata Theory · Computer Science 2020-12-15 Hideo Bannai , Travis Gagie , Shunsuke Inenaga , Juha Karkkainen , Dominik Kempa , Marcin Piatkowski , Simon J. Puglisi , Shiho Sugimoto

We prove an inequality for the number of periods in a word x in terms of the length of x and its initial critical exponent. Next, we characterize all periods of the length-n prefix of a characteristic Sturmian word in terms of the lazy…

Discrete Mathematics · Computer Science 2020-05-28 Daniel Gabric , Narad Rampersad , Jeffrey Shallit

Recently developed supersymmetric perturbation theory has been successfully employed to make a complete mathematical analysis the reason behind exact solvability of some non-central potentials. This investigation clarifies once more the…

Quantum Physics · Physics 2009-11-10 Bulent Gonul , Mehmet Kocak

In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a "wide sense"…

Combinatorics · Mathematics 2010-03-16 Amy Glen , Jacques Justin , Giuseppe Pirillo

For Kolmogorov test we find natural conditions of uniform consistency of sets of alternatives approaching to hypothesis. Sets of alternatives can be defined both in terms of distribution functions and in terms of densities.

Statistics Theory · Mathematics 2022-11-28 Mikhail Ermakov

This paper aims to study the q-analogue of the Sturm Liouville problem and to give an asymptotic behaviour at infinity for its solution '. Additionally, we establish an asymptotic expansion of the q-Bessel function $j_\alpha$ for $\alpha…

Mathematical Physics · Physics 2007-05-23 Ahmed Fitouhi , Akram Nemri , Meniar Haddad

We study infinite words u over an alphabet A satisfying the property P : P(n)+ P(n+1) = 1+ #A for any n in N, where P(n) denotes the number of palindromic factors of length n occurring in the language of u. We study also infinite words…

Combinatorics · Mathematics 2013-02-12 Lubomira Balkova , Edita Pelantova , Stepan Starosta

We give two congruence properties of Hermitian modular forms of degree 2 over $\mathbb{Q}(\sqrt{-1})$ and $\mathbb{Q}(\sqrt{-3})$. The one is a congruence criterion for Hermitian modular forms which is generalization of Sturm's theorem.…

Number Theory · Mathematics 2010-05-18 Toshiyuki Kikuta

Let us consider an infinite word and $k\geq 1$ an integer. By steps of $k$, we substitute a letter ofthis infinite word by the power of an external letter. The new word obtaining by this process is called $k$ to $k$ substitution of a power…

Combinatorics · Mathematics 2024-05-31 Moussa Barro , K. Ernest Bognini , Boucaré Kientéga

We show the existence of periodic solutions for continuous symmetric perturbations of certain planar power law problems.

Classical Analysis and ODEs · Mathematics 2007-05-23 C. Azevedo , P. Ontaneda

We show that Sturm's classical separation theorem on the interlacing of the zeros of linearly independent solutions of real second order two-term ordinary differential equations necessarily fails in the presence of a unique turning point in…

Classical Analysis and ODEs · Mathematics 2021-09-16 L. Gholizadeh , A. B. Mingarelli

The relativistic scattering of a spin-1/2 particle from an infinitely long solenoid is considered in the framework of covariant perturbation theory. The first order term agrees with the corresponding term in the series expansion of the…

High Energy Physics - Theory · Physics 2009-10-31 M. Boz , N. K. Pak

In these notes, we comment on the standard indistinguishability criterion often used in the gravitational wave community to set accuracy requirements on waveforms. Revisiting the hypotheses under which it is derived, we propose a correction…

General Relativity and Quantum Cosmology · Physics 2024-01-19 Alexandre Toubiana , Jonathan R. Gair

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud