Definability of combinatorial functions and their linear recurrence relations

From MaRDI portal




Abstract: We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these functions satisfy a linear recurrence relation over mathbbZ or mathbbZm and allow an interpretation as counting the number of relations satisfying a property expressible in Monadic Second Order Logic (MSOL). C. Blatter and E. Specker (1981) showed that if such a function f counts the number of binary relations satisfying a property expressible in MSOL then f satisfies for every minmathbbN a linear recurrence relation over mathbbZm. In this paper we give a complete characterization in terms of definability in MSOL of the combinatorial functions which satisfy a linear recurrence relation over mathbbZ, and discuss various extensions and limitations of the Specker-Blatter theorem.











This page was built for publication: Definability of combinatorial functions and their linear recurrence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586014)