Related papers: Rarefied Thue-Morse Sums Via Automata Theory and L…
We show how to obtain, via a unified framework provided by logic and automata theory, many classical results of Brillhart and Morton on Rudin-Shapiro sums. The techniques also facilitate easy proofs for new results.
Let (t_n) be the classical Thue-Morse sequence defined by t_n = s_2(n) (mod 2), where s_2 is the sum of the bits in the binary representation of n. It is well known that for any integer k>=1 the frequency of the letter "1" in the…
We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 25 is the sum of at most three natural numbers whose…
Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we…
We discuss the base 3/2 representation of the natural numbers. We prove that the sum of digits function of the representation is a fixed point of a 2-block substitution on an infinite alphabet, and that this implies that sum of digits…
We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our…
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…
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…
We evaluate the classic sum $\sum_{n\in\mathbb{Z}} e^{-\pi n^2}$. The novelty of our approach is that it does not require any prior knowledge about modular forms, elliptic functions or analytic continuations. Even the $\Gamma$ function, in…
In this paper, we establish the following two congruences: \begin{gather*} \sum_{k=0}^{(p+1)/2}(3k-1)\frac{\left(-\frac{1}{2}\right)_k^2\left(\frac{1}{2}\right)_k4^k}{k!^3}\equiv…
The Thue-Morse set is the set of those nonnegative integers whose binary expansions have an even number of $1$. We obtain an exact formula for the state complexity of the multiplication by a constant of the Thue-Morse set $\mathcal{T}$ with…
The Thue--Morse sequence $t=01101001\cdots$ is an automatic sequence over the alphabet $\{0,1\}$. It can be defined as the binary sum-of-digits function $s:\mathbb N\rightarrow\mathbb N$, reduced modulo $2$, or by using the substitution…
For a composition $I$ whose first part exceeds 1, we can define the multiple $t$-value $t(I)$ as the sum of all the terms in the series for the multiple zeta value $\zeta(I)$ whose denominators are odd. In this paper we show that if $I$ is…
Sums of the singular series constants that appear in the Hardy--Littlewood $k$-tuples conjectures have long been studied in connection to the distribution of primes. We study constrained sums of singular series, where the sum is taken over…
We construct an analytic approach to evaluate odd Euler sums, multiple zeta value $\zeta(3,2,\ldots,2)$ and multiple $t$-value $t\left(3,2,\ldots,2\right)$. Moreover, we also conjecture a closed expression for multiple $t$-value…
For every $a\geq1$ we give a recursion algorithm of building of set of solutions of equations of the form $t(x+a)=t(x)$ and $t(x+a)=1-t(x),$ where $\{t(n)\}$ is Thue-Morse sequence. We pose an open problem and two conjectures.
In this paper, we shall show that certain signed cyclic sums of Mordell-Tornheim L-values are rational linear combinations of products of multiple L-values of lower depths (i.e., reducible). This simultaneously generalizes some results of…
Many $\mathbb{Q}$-linear relations exist between multiple zeta values, the most interesting of which are various weighted sum formulas. In this paper, we generalized these to Euler sums and some other variants of multiple zeta values by…
In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…
Correctness proofs for floating point programs are difficult to verify. To simplify the task, a similar, but less complex system, known as logarithmic arithmetic can be used. The Boyer-Moore Theorem Prover, NQTHM, mechanically verified the…