Generalized Dold sequences on partially-ordered sets (Q2121751)

An integer sequence \((a_n)\) is called a Dold sequence if \(\sum_{d\vert n}\mu(n/d)a_d\equiv 0\) modulo \(n\) for all \(n\ge1\). Such sequences have a standard representation via a `periodic' expansion into a combination of basic periodic sequences. For many reasons it is natural to think of the classical Möbius function as being defined on the poset of finite index subgroups of the integers, and then study properties of Dold type for the Möbius function defined on any poset. Indeed, the Dold property has a strong connection to counts of periodic points for iterates of maps, and studying periodic points for actions of other groups forces this viewpoint (see, for example, work of \textit{R. Miles} and \textit{T. B. Ward} [Proc. Am. Math. Soc. 137, No. 4, 1499--1507 (2009; Zbl 1160.22005); J. Lond. Math. Soc., II. Ser. 81, No. 3, 715--726 (2010; Zbl 1193.37006)]). Here this more general view is taken, and the decomposition into periodic sequences as well as characterization using multiplicative functions other than the Möbius function due to \textit{K. Wójcik} for the integer case \textit{K. Wójcik} [Integers 21, Paper A63, 16 p. (2021; Zbl 1485.11009)] are studied from a combinatorial point of view.