Zobrazeno 1 - 10
of 7 775
pro vyhledávání: '"palíndromes"'
Autor:
Itzhaki, Michael
This paper introduces a novel method for compressing palindromic structures in strings, establishing upper and lower bounds for their efficient representation. We uncover a unique relationship between the Lempel-Ziv parsing of palindromes and the alp
Externí odkaz:
http://arxiv.org/abs/2410.09984
The asymptotic critical exponent measures for a sequence the maximum repetition rate of factors of growing length. The infimum of asymptotic critical exponents of sequences of a certain class is called the asymptotic repetition threshold of that clas
Externí odkaz:
http://arxiv.org/abs/2409.06849
Publikováno v:
EPTCS 403, 2024, pp. 134-138
Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the product of two p
Externí odkaz:
http://arxiv.org/abs/2406.16410
Around the year 2007, one of the authors, Tsai, accidentally discovered a property of the number $198$ he saw on the license plate of a car. Namely, if we take $198$ and its reversal $891$, which have prime factorizations $198 = 2\cdot 3^2\cdot 11$ a
Externí odkaz:
http://arxiv.org/abs/2405.05267
Autor:
Khadiev, Kamil, Serov, Danil
Publikováno v:
LNCS, Vol. 14776, 2024
In this paper, we present a quantum property testing algorithm for recognizing a context-free language that is a concatenation of two palindromes $L_{REV}$. The query complexity of our algorithm is $O(\frac{1}{\varepsilon}n^{1/3}\log n)$, where $n$ i
Externí odkaz:
http://arxiv.org/abs/2406.11270
Autor:
Amir, Amihood, Itzhaki, Michael
The palindromic fingerprint of a string $S[1\ldots n]$ is the set $PF(S) = \{(i,j)~|~ S[i\ldots j] \textit{ is a maximal }\\ \textit{palindrome substring of } S\}$. In this work, we consider the problem of string reconstruction from a palindromic fin
Externí odkaz:
http://arxiv.org/abs/2406.04507
We present a characterization of the algebraic integers with continued fraction expansions of the form $[a_0, \overline{a_1, \ldots, a_n, s}]$, where $(a_1, \ldots, a_n)$ is a palindrome and $s \in \mathbb{N}_{\geq 1}$. In particular, we focus on the
Externí odkaz:
http://arxiv.org/abs/2405.06430
Autor:
Zakharov, Dmitrii
Publikováno v:
Math. Proc. Camb. Phil. Soc. 177 (2024) 363-366
For $g \ge 2$, we show that the number of positive integers at most $X$ which can be written as sum of two base $g$ palindromes is at most $\frac{X}{\log^c X}$. This answers a question of Baxter, Cilleruelo and Luca.
Comment: 3 pages
Comment: 3 pages
Externí odkaz:
http://arxiv.org/abs/2402.10808
We study infinite binary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponents. This extends results by Fici and Zamboni [TCS 2013]. Interestingly, the words with 18 and 20 palindrome
Externí odkaz:
http://arxiv.org/abs/2311.13003
For a given base $g\ge2$, a positive integer is called a palindrome if its base $g$ expansion reads the same backwards as forwards. In this paper, we give an asymptotic formula for the number of relatively prime pairs of palindromes of a fixed odd le
Externí odkaz:
http://arxiv.org/abs/2311.15002