Abstract:It is well known that $F(x)=\prod_{n=0}^{\infty}(1-x^{2^n})$ is the generating function of the Prouhet-Thue-Morse sequence $\{(-1)^{\sigma_2(n)}\}_{n=0}^\infty$, where $\sigma_2(n)$ is the sum of (binary) digits of $n$. Let $m$ be an integer. In 2018, Gawron, Miska and Ulas initiated the study of arithmetic properties of power series expansion of the function $$F_m(x)=F(x)^m=\sum_{n=0}^{\infty}t_m(n) x^n,$$ and proposed a conjecture stating that for any given integer $m\ge 2$, the sequence $\{t_m(n)\}_{n=0}^{\infty}$ is unbounded. In this paper, we introduce a new method to investigate this conjecture. In fact, by making use of algebraic, $p$-adic and analytic methods, we show that the Gawron-Miska-Ulas conjecture is true.
From: Shaofang Hong [view email]
[v1]
Wed, 24 Jun 2026 13:44:27 UTC (15 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。