arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.2494math.LOmath.CO
收藏

谱与方程组

Spectra and Systems of Equations

Jason Bell, Stanley Burris, Karen Yeats

摘要:

在以前的工作中,我们介绍了一个基本的方法来分析由一个单一的方程y=G(x,y)定义的生成函数的周期性。这是基于推导出定义母函数谱的单个集合方程Y = Gammma(Y)。本文将周期性分析推广到由方程组y = G(x,y)定义的母函数。最后一节着眼于周期性结果的频谱一元二阶类的频谱是由一个方程的规格-康普顿的观察表明,一元二阶类的树有这个属性。本节的结论是对Gurevich和Shelah在2003年关于谱的基础论文中的证明进行了实质性的简化,即给出了以下新的证明:(1)$m$着色函数有向图的每个一元二阶类最终是周期的,以及(2)有限树的一元二阶理论是可判定的。

英文摘要:

In a previous work we introduced an elementary method to analyze the periodicity of a generating function defined by a single equation y=G(x,y). This was based on deriving a single set-equation Y = Gammma(Y) defining the spectrum of the generating function. This paper focuses on extending the analysis of periodicity to generating functions defined by a system of equations y = G(x,y). The final section looks at periodicity results for the spectra of monadic second-order classes whose spectrum is determined by an equational specification - an observation of Compton shows that monadic-second order classes of trees have this property. This section concludes with a substantial simplification of the proofs in the 2003 foundational paper on spectra by Gurevich and Shelah, namely new proofs are given of: (1) every monadic second-order class of $m$-colored functional digraphs is eventually periodic, and (2) the monadic second-order theory of finite trees is decidable.

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

↑