中文
相关论文

相关论文: On arithmetic index in the generalized Thue-Morse …

200 篇论文

We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…

组合数学 · 数学 2014-04-04 Tero Harju , Mari Huova , L. Q. Zamboni

We provide an asymptotic expansion for the mean-value of the logarithm of the middle prime factor of an integer, defined according to multiplicity or not, thus generalising a recent study of McNew, Pollack, and Singha Roy. This yields an…

数论 · 数学 2025-12-02 Jonathan Rotgé

If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…

群论 · 数学 2020-09-23 Michael Larsen

The length $a(n)$ of the longest common subsequence of the $n$'th Thue-Morse word and its bitwise complement is studied. An open problem suggested by Jean Berstel in 2006 is to find a formula for $a(n)$. In this paper we prove new lower…

离散数学 · 计算机科学 2019-12-03 Joakim Blikstad

The prefix palindromic length $PPL_u(n)$ of an infinite word $u$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $u$. In a 2013 paper with Puzynina and Zamboni we stated the conjecture that…

离散数学 · 计算机科学 2020-01-09 Anna E. Frid

Given a finite alphabet $\Sigma$ and a right-infinite word $w$ over the alphabet $\Sigma$, we construct a topological space ${\rm Rec}(w)$ consisting of all right-infinite recurrent words whose factors are all factors of $w$, where we work…

形式语言与自动机理论 · 计算机科学 2022-05-12 Jason Bell

A finite word u is said to be bordered if u has a proper prefix which is also a suffix of u, and unbordered otherwise. Ehrenfeucht and Silberger proved that an infinite word is purely periodic if and only if it contains only finitely many…

形式语言与自动机理论 · 计算机科学 2015-01-30 Emilie Charlier , Tero Harju , Svetlana Puzynina , Luca Zamboni

For $\alpha\geq 1$, an $\alpha$-gapped repeat in a word $w$ is a factor $uvu$ of $w$ such that $|uv|\leq \alpha |u|$; the two factors $u$ in such a repeat are called arms, while the factor $v$ is called gap. Such a repeat is called maximal…

数据结构与算法 · 计算机科学 2015-10-01 Paweł Gawrychowski , Tomohiro I , Shunsuke Inenaga , Dominik Köppl , Florin Manea

A non-empty word $w$ is a \emph{border} of a word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ is \emph{privileged} if $\vert u\vert\leq 1$ or if $u$ has a privileged border $w$ that appears…

组合数学 · 数学 2022-09-13 Josef Rukavicka

Let $e_v(n)$ denote the number of occurrences of a fixed pattern $v$ in the binary expansion of $n \in \mathbb{N}$. In this paper we study monochromatic arithmetic progressions in the class of binary words $(e_v(n) \bmod{2})_{n \geq 0}$,…

组合数学 · 数学 2023-07-19 Bartosz Sobolewski

The Thue-Morse set $\mathcal{T}$ is the set of those non-negative integers whose binary expansions have an even number of $1$. The name of this set comes from the fact that its characteristic sequence is given by the famous Thue-Morse word…

形式语言与自动机理论 · 计算机科学 2019-10-22 Émilie Charlier , Célia Cisternino , Adeline Massuir

To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same…

组合数学 · 数学 2010-03-16 Amy Glen

We show that the 2-abelian complexity of the infinite Thue-Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for…

组合数学 · 数学 2015-06-03 Florian Greinecker

The factor complexity of the infinite word $\ubeta$ canonically associated to a non-simple Parry number $\beta$ is studied. Our approach is based on the notion of special factors introduced by Berstel and Cassaigne. At first, we give a…

组合数学 · 数学 2017-05-31 Karel Klouda , Edita Pelantová

We define the arithmetic self-similarity (AS) of a one-sided infinite sequence sigma to be the set of arithmetic progressions through sigma which are a vertical shift of sigma. We study the AS of several famlies of sequences, viz.…

A set of words, also called a language, is letter-balanced if the number of occurrences of each letter only depends on the length of the word, up to a constant. Similarly, a language is factor-balanced if the difference of the number of…

形式语言与自动机理论 · 计算机科学 2022-11-28 Léo Poirier , Wolfgang Steiner

A position $p$ in a word $w$ is critical if the minimal local period at $p$ is equal to the global period of $w$. According to the Critical Factorisation Theorem all words of length at least two have a critical point. We study the number…

组合数学 · 数学 2021-07-21 Tero Harju

The Thue-Morse set T is the set of those non-negative integers whose binary expansions have an even number of 1. The name of this set comes from the fact that its characteristic sequence is given by the famous Thue-Morse word…

形式语言与自动机理论 · 计算机科学 2019-09-18 Émilie Charlier , Célia Cisternino , Adeline Massuir

In the first paper under this title (1977), the first author utilized a duality identity between the largest and smallest prime factors involving the Moebius function, to establish the following result as a consequence of the Prime Number…

数论 · 数学 2024-10-25 Krishnaswami Alladi , Jason Johnson

The growth factor in Gaussian elimination measures how large the entries of an LU factorization can be relative to the entries of the original matrix. It is a key parameter in error estimates, and one of the most fundamental topics in…

数值分析 · 数学 2025-02-04 Ankit Bisain , Alan Edelman , John Urschel