Proof of the Gawron-Miska-Ulas conjecture concerning unboundedness of coefficients of power series expansion of Πn=0∞(1-x2n)m
Abstract
It is well known that F(x)=Πn=0∞(1-x2n) is the generating function of the Prouhet-Thue-Morse sequence \(-1)σ2(n)\n=0∞, where σ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 Fm(x)=F(x)m=Σn=0∞tm(n) xn, and proposed a conjecture stating that for any given integer m 2, the sequence \tm(n)\n=0∞ 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.