相关论文: Palindromic length sequence of the ruler sequence …
The notion of palindromic length of a finite word, as well as an infinite word, was first introduced by Frid, Puzynina and Zamboni\cite{FRID2013737}. They conjectured that if the palindromic length of an infinite word is bounded, then this…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…
We study the periods of Markov sequences, which are derived from the continued fraction expression of elements in the Markov spectrum. This spectrum is the set of minimal values of indefinite binary quadratic forms that are specially…
This paper presents results on maximal runs, order of squares, palindromes, and unbordered factors of members of the family of binary pattern sequences with the all-one pattern. Restricting ourselves to binary pattern sequences with the…
Let ${\cal P}$ be the set of palindromes occurring in the Fibonacci sequence. In this note, we establish three structures of $\mathcal{P}$ and and discuss their properties: cylinder structure, chain structure and recursive structure. Using…
In this paper we study some basic properties of rough $I$-convergent double sequences in the line of D$\ddot{u}$ndar [8]. We also study the set of all rough $I$-limits of a double sequence and relation between boundedness and rough…
This paper investigates the multiplicity and the number of limit cycles for planar piecewise linear system divided into two regions by a straight line and each linear subsystem has a node. Through constructing Poincare half maps and a…
The period-doubling sequence is one of the most well-known aperiodic $0$-$1$ sequences. In this paper, a complete description of its symbolic recurrence plot is given, and formulas for asymptotic values of basic recurrence quantifiers are…
The palindromic length of the finite word $v$ is equal to the minimal number of palindromes whose concatenation is equal to $v$. It was conjectured in 2013 that for every infinite aperiodic word $x$, the palindromic length of its factors is…
A palindromic periodicity is a factor of an infinite word $(ps)^\omega$ where $p$ and $s$ are palindromes and the factor has length at least $|ps|$, for example, $accabaccab$. In this paper we describe several ways in which a palindromic…
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
We demonstrate that discrete m-functions with eventually periodic continued fraction coefficients have an algebraic relationship to their second solution if and only if the periodic part of the sequence of continued fraction coefficients is…
Two results on palindromicity of bi-infinite words in a finite alphabet are presented. The first is a simple, but efficient criterion to exclude palindromicity of minimal sequences and applies, in particular, to the Rudin-Shapiro sequence.…
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…
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 n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…
Let P be the set of the sequence of polynomials of degree n. The aim of this paper is to study the Stirling numbers of the second kind associated with P and of the first kind associated with P, in a unified and systematic way with the help…
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…