English
Related papers

Related papers: On the additive complexity of a Thue-Morse like se…

200 papers

In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…

Combinatorics · Mathematics 2019-01-07 Songpon Sriwongsa

The secondary zeta function $Z(s)=\sum_{n=1}^\infty\alpha_n^{-s}$, where $\rho_n=\frac12+i\alpha_n$ are the zeros of zeta with $\Im(\rho)>0$, extends to a meromorphic function on the hole complex plane. If we assume the Riemann hypothesis…

Number Theory · Mathematics 2020-06-11 Juan Arias de Reyna

This work is devoted to solving some closely related open problems on the average and asymptotic behavior of the $2$-adic complexity of binary sequences. First, for fixed $N$, we prove that the expected value $E^{\mathrm{2-adic}}_N$ of the…

Combinatorics · Mathematics 2025-01-29 Z. Chen , A. Winterhof

We study the properties of a sequence cn defined by the recursive relation \[\frac{c_0}{n + 1}+\frac{c_1}{n + 2}+\ldots+\frac{c_n}{2n + 1}=0\] for $n>1$ and $c_0=1$. This sequence also has an alternative definition in terms of certain norm…

Number Theory · Mathematics 2019-01-15 Alexander Kalmynin , Petr Kosenko

For 0 < x < 1, take the binary expansion with infinitely many 0's, replace each 0 with -1, this gives the polarized binary expansion of x. Let R_i(x) be the ith "polarized bit" and let S_n(x) be the sum of the first n R_i(x). {S_n} is the…

Probability · Mathematics 2019-11-13 Vladimir Dobric , Marina Skyers , Lee J. Stanley

Explicit evaluations of the Tornheim-like double series in the form \[ \sum_{n,m=1}^\infty \frac{H_{n+m+s}}{nm\left( n+m+s \right)},\ s\in \mathbb{N\cup } \left\{ 0 \right\} \] and their extensions are given. Furthermore, series of the type…

Number Theory · Mathematics 2020-08-07 Ilham A. Aliev , Ayhan Dil

Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in Fibonacci representation. In this note we show how, using the Walnut theorem-prover, to obtain a measure of its complexity, previously studied by Jamet, Popoli, and…

Formal Languages and Automata Theory · Computer Science 2022-03-22 Jeffrey Shallit

Almost asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity $IO_\mathcal{A}\left(n,M\right)$ of a general class of hybrid algorithms computing the product of two integers, each represented with $n$ digits in a…

Computational Complexity · Computer Science 2020-07-20 Lorenzo De Stefani

In this paper we consider the time complexity of computing the sum and product of two $n$-bit numbers within the tile self-assembly model. The (abstract) tile assembly model is a mathematical model of self-assembly in which system…

Data Structures and Algorithms · Computer Science 2013-08-06 Alexandra Keenan , Robert Schweller , Michael Sherman , Xingsi Zhong

Let $G$ be an additive abelian group. A sequence $S=g_1\cdot\ldots\cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1,\ldots,\varepsilon_{\ell}\in\{-1,1\}$ such that $\varepsilon_1…

Commutative Algebra · Mathematics 2023-09-13 Florin Fabsits , Alfred Geroldinger , Andreas Reinhart , Qinghai Zhong

In this paper we study sums of Dirichlet series whose coefficients are terms of the Thue-Morse sequence and variations thereof. We find closed-form expressions for such sums in terms of known constants and functions including the Riemann…

Number Theory · Mathematics 2022-11-28 László Tóth

Let $\bm{i}=1+q+...+q^{i-1}$. For certain sequences $(r_1,...,r_l)$ of positive integers, we show that in the Hecke algebra $\mathscr{H}_n(q)$ of the symmetric group $\mathfrak{S}_n$, the product $(1+\bm{r_1}T_{r_1})... (1+\bm{r_l}T_{r_l})$…

Combinatorics · Mathematics 2009-06-05 Rosena R. X. Du , Richard P. Stanley

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…

Number Theory · Mathematics 2020-06-23 Yining Hu , Guoniu Wei-Han

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

Formal Languages and Automata Theory · Computer Science 2016-07-07 Prateek Karandikar , Manfred Kufleitner , Philippe Schnoebelen

For a nonnegative integer $t$, let $c_t$ be the asymptotic density of natural numbers $n$ for which $s(n + t) \geq s(n)$, where $s(n)$ denotes the sum of digits of $n$ in base $2$. We prove that $c_t > 1/2$ for $t$ in a set of asymptotic…

Combinatorics · Mathematics 2016-05-03 Michael Drmota , Manuel Kauers , Lukas Spiegelhofer

Given a positive integer $N$ and $x$ irrational between zero and one, an $N$-continued fraction expansion of $x$ is defined analogously to the classical continued fraction expansion, but with the numerators being all equal to $N$. Inspired…

Number Theory · Mathematics 2023-02-15 Niels Langeveld , Lucía Rossi , Jörg M. Thuswaldner

We introduce the notion of a Morse sequence, which provides a simple and effective approach to discrete Morse theory. A Morse sequence is a sequence composed solely of two elementary operations, that is, expansions (the inverse of a…

Computer Vision and Pattern Recognition · Computer Science 2024-02-13 Gilles Bertrand

In this paper, we prove that a Thue equation F(x,y) = h, where h is an integer and F is a polynomial of degree n with integer coefficients and without repeated roots, has at most 2n^3 - 2n - 3 solutions provided that the Mordell-Weil rank…

Number Theory · Mathematics 2007-05-23 Dino Lorenzini , Thomas J. Tucker

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

Probability · Mathematics 2013-02-21 Omer Friedland , Ohad Giladi

We prove that for $s=\sigma+it$ with $\sigma\ge0$ and $0<t\le x$, we have \[\zeta(s)=\sum_{n\le x}n^{-s}+\frac{x^{1-s}}{(s-1)}+\Theta\frac{29}{14} x^{-\sigma},\qquad \frac{29}{14}=2.07142\dots\] where $\Theta$ is a complex number with…

Number Theory · Mathematics 2024-06-25 Juan Arias de Reyna