Related papers: On the additive complexity of a Thue-Morse like se…
In combinatorics on words, the well-studied factor complexity function $\rho_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer $n$, the number of distinct length-$n$ factors of $\infw{x}$. In…
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…
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…
Two words are $k$-binomially equivalent whenever they share the same subwords, i.e., subsequences, of length at most $k$ with the same multiplicities. This is a refinement of both abelian equivalence and the Simon congruence. The…
Letting $(t_n)$ denote the Thue-Morse sequence with values $0, 1$, we note that the Woods-Robbins product $$ \prod_{n \geq 0} \left(\frac{2n+1}{2n+2}\right)^{(-1)^{t_n}} = 2^{-1/2} $$ involves a rational function in $n$ and the $\pm 1$…
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…
We consider the generalized Thue-Morse sequences $(t_n^{(c)})_{n\ge 0}$ ($c \in [0,1)$ being a parameter) defined by $t_n^{(c)} = e^{2\pi i c s_2(n)}$, where $s_2(n)$ is the sum of digits of the binary expansion of $n$. For the polynomials…
We study a binary Thue--Morse-type sequence arising from the base-$3/2$ expansion of integers, an archetypal automatic sequence in a rational base numeration system. Because the sequence is generated by a periodic iteration of morphisms…
Expansion complexity and maximum order complexity are both finer measures of pseudorandomness than the linear complexity which is the most prominent quality measure for cryptographic sequences. The expected value of the $N$th maximum order…
For each integer n > 1, we present an element in $Q((T^-1))$, having a power series expansion based on an infinite word W(n), over the alphabet ${+1;-1}g and whose continued fraction expansion has a particular pattern which is explicitly…
The Thue--Morse sequence is a prototypical automatic sequence found in diverse areas of mathematics, and in computer science. We study occurrences of factors $w$ within this sequence, more precisely, the sequence of gaps between consecutive…
We introduce and study two analogs of one of the best known sequence in Mathematics : Thue-Morse sequence. The first analog is concerned with the parity of number of runs of 1's in the binary representation of nonnegative integers. The…
We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the…
Given a countable set X (usually taken to be the natural numbers or the integers), an infinite permutation \pi of X is a linear ordering of X. This paper investigates the combinatorial complexity of the infinite permutation on the natural…
In this work we introduce a new notion called opacity complexity to measure the complexity of automatic sequences. We study basic properties of this notion, and exhibit an algorithm to compute it. As applications, we compute the opacity…
Given an integer $q\ge2$ and $\theta_1,\cdots,\theta_{q-1}\in\{0,1\}$, let $(\theta_n)_{n\ge0}$ be the generalized Thue-Morse sequence, defined to be the unique fixed point of the morphism $$0\mapsto0\theta_1\cdots\theta_{q-1}$$…
Given an integer $q\ge 2$ and a real number $c\in [0,1)$, consider the generalized Thue-Morse sequence $(t_n^{(q;c)})_{n\ge 0}$ defined by $t_n^{(q;c)} = e^{2\pi i c S_q(n)}$, where $S_q(n)$ is the sum of digits of the $q$-expansion of $n$.…
Assuming the Riemann hypothesis and Montgomery's Pair Correlation Conjecture, we investigate the distribution of the sequences $(\log|\zeta(\rho+z)|)$ and $(\arg\zeta(\rho+z)).$ Here $\rho=\frac12+i\gamma$ runs over the nontrivial zeros of…
Integer sequences of the form $\lfloor n^c\rfloor$, where $1<c<2$, can be locally approximated by sequences of the form $\lfloor n\alpha+\beta\rfloor$ in a very good way. Following this approach, we are led to an estimate of the difference…
It is a classical fact that the exponential function is solution of the integral equation $ \int_0^X f(x)dx + f(0) =f(X)$. If we slightly modify this equation to $ \int_0^X f(x)dx+f(0)=f(\alpha X)$ with $\alpha\in ]0,1[$, it seems that no…