A connection between the poles of the zeta function of a recurrence sequence and the module of relations of its roots
Abstract
Answering a question left open in previous research, we study the enumeration of poles of the zeta function (s) associated to an integer linear recurrence sequence \an\. This enumeration can count poles more than once, and we prove that this happens if and only if the module of relations of the roots of the recurrence is nontrivial. A review of the existing literature on the module of relations yields a series of sufficient conditions for the enumeration of poles of (s) to be injective. All of this is illustrated by examples of both cases.
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.