arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.5420math.COmath.LO
收藏

组合函数的可定义性及其线性递推关系

Definability of Combinatorial Functions and Their Linear Recurrence Relations

T. Kotek, J. A. Makowsky

摘要:

我们考虑自然数的功能,允许组合解释为密度函数(速度)的类关系结构,如斐波那契数,贝尔数,加泰罗尼亚数等。这些函数中的许多函数满足$\mathbb Z$或${\mathbb Z}_m$上的线性递归关系,并且允许解释为对满足一元二阶逻辑(MSOL)中可表达的性质的关系的数量进行计数。C. Blatter和E. Specker(1981)表明,如果这样一个函数$f$计算满足MSOL中可表达的性质的二元关系的数量,则$f$对每个$m \in \mathbb{N}$都满足$\mathbb{Z}_m$上的线性递归关系。本文给出了满足$\mathbb{Z}$上线性递归关系的组合函数在MSOL中可定义性的一个完整刻画,并讨论了Specker-Blatter定理的各种推广和局限性.

英文摘要:

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 $\mathbb Z$ or ${\mathbb Z}_m$ 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 $m \in \mathbb{N}$ a linear recurrence relation over $\mathbb{Z}_m$. 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 $\mathbb{Z}$, and discuss various extensions and limitations of the Specker-Blatter theorem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑