Related papers: On the $k$-abelian complexity of the Cantor sequen…

We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.

The arithmetic complexity counts the number of algebraically independent entries in the periodic continued fraction $\theta=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_{\theta}$ is a noncommutative torus corresponding to…

A Cantor series expansion for a real number $x$ with respect to a basic sequence $Q=(q_1,q_2,\dots)$, where $q_i \geq 2$, is a representation of the form $x=a_0 + \sum_{i=1}^\infty \frac{a_i}{q_1q_2\cdots q_i}$ where $0 \leq a_i<q_i$. These…

In this paper, we study the abelian complexity of the Rudin-Shapiro sequence and a related sequence. We show that these two sequences share the same complexity function $\rho(n)$ which satisfies certain recurrence relations. As a…

Let $S \subseteq \mathbb{N}$ have the property that for each $k \in S$ the set $(S - k) \cap \mathbb{N} \setminus S$ has asymptotic density $0$. We prove that there exists a basic sequence $Q$ where the set of numbers $Q$-normal of all…

We present a general method for computing the abelian complexity $\rho^{\rm ab}_{\bf s} (n)$ of an automatic sequence $\bf s$ in the case where (a) $\rho^{\rm ab}_{\bf s} (n)$ is bounded by a constant and (b) the Parikh vectors of the…

Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest…

The article is devoted to the investigation of representation of rational numbers by Cantor series. Necessary and sufficient conditions for a rational number to be representable by a positive Cantor series are formulated for the case of an…

In this paper, we prove a criterion for complexity in $g$-ary expansions of a rational fraction $a/b<1$ with gcd$(a,b)=1$. We prove that for any purely periodic proper fraction $a/b$ and all $j\geq 1$, each sequence of $j$ digits occurs in…

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

In this paper we introduce and study a family of complexity functions of infinite words indexed by $k \in \ints ^+ \cup {+\infty}.$ Let $k \in \ints ^+ \cup {+\infty}$ and $A$ be a finite non-empty set. Two finite words $u$ and $v$ in $A^*$…

Put $a(n)=\sum\limits_{k=0}^{n}\binom{n}{k}\binom{n+k}{k}$, and $b(n)=v_{3}(a(n))$, for all integers $n\geqslant 0$, where $v_{3}$ is the $3$-adic valuation. In this work, we shall confirm a formula about $b(n)$, conjectured by J. Shallit…

Let E/K be an elliptic curve with complex multiplication and let $K^{ab}$ be the Abelian closure of $K$. We prove in this article that there exists a constant $c(E/K)$ such that : for all point $P\in E(\bar{K})-E_{tors}$, we have…

In this paper, by providing the uniform gradient estimates for a sequence of the approximating equations, we prove the existence, uniqueness and regularity of the conical parabolic complex Monge-Amp\`ere equation with weak initial data. As…

Fix a sequence of integers $Q=\{q_n\}_{n=1}^\infty$ such that $q_n$ is greater than or equal to 2 for all $n$. In this paper, we improve upon results by J. Galambos and F. Schweiger showing that almost every (in the sense of Lebesgue…

Define $\|n\|$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. Define $n$ to be stable if for all $k\ge 0$, we have $\|3^k n\|=\|n\|+3k$. In [7],…

In this paper, we study the abelian complexity $\rho_n^{ab}(\mathbf{t}^{(k)})$ of generalized Thue-Morse sequences $\mathbf{t}^{(k)}$. We obtain the exact value of $\rho_n^{ab}(\mathbf{t}^{(k)})$ for every integer $n\geq k$. Consequently,…

According to a result of Richomme, Saari and Zamboni, the abelian complexity of the Tribonacci word satisfies $\rho^{\mathrm{ab}}(n)\in\{3,4,5,6,7\}$ for each $n\in\mathbb{N}$. In this paper we derive an automaton that evaluates the…

For any positive integer $p\geq 3$, let $A$ be a proper subset of $\{0,1,\ldots, p-1\}$ with $\sharp A=s\geq 2$. Suppose $h: \{0,1,\ldots,s-1\}\to A$ is a one-to-one map which is strictly increasing with $A=\{h(0),h(1),\ldots,h(s-1)\}$. We…

Generalized abelian equivalence compares words by their factors up to a certain bounded length. The associated complexity function counts the equivalence classes for factors of a given size of an infinite sequence. How practical is this…