Arithmetic properties of the sequence of degrees of Stern polynomials and related results
Maciej Ulas

TL;DR
This paper investigates the arithmetic properties of Stern polynomials, focusing on the degrees and orders at zero, revealing new relationships and counting solutions within specific intervals, and providing a closed-form sum expression.
Contribution
It establishes that the order at zero of Stern polynomials equals the maximal power of 2 dividing n and counts solutions to degree-related equations within intervals.
Findings
d(n) equals the maximal power of 2 dividing n
Counted solutions to e(m)=i and e(m)-d(m)=i in [1, 2^n]
Derived a closed-form expression for a sum involving Stern polynomials
Abstract
Let be a -th Stern polynomial and let be its degree. In this note we continue our study started in \cite{Ul} of the arithmetic properties of the sequence of Stern polynomials and the sequence . We also study the sequence . Among other things we prove that , where is the maximal power of 2 which dividies the number . We also count the number of the solutions of the equations and in the interval . We also obtain an interesting closed expression for a certain sum involving Stern polynomials.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Advanced Mathematical Theories and Applications
