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

具有一元二阶0-1律的一元二阶森林类

Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law

Jason Bell, Stanley Burris, Karen Yeats

摘要:

设$\cT$是一元二阶有限树类,$\bT(x)$是它的(普通)生成函数,收敛半径为$ρ$ .如果$ρ\ge 1$,则$\cT$在联合、求和、堆栈以及多集运算符$(n)$和$(\ge n)$方面具有显式规范(不使用递归)。利用这一点,人们就可以用初始函数$x$和$x\cdot \big(1-x^n\big)^{-1}$、加法和乘法运算以及Pólya指数运算符$\sE_n, \sE_{\ge n}$来显式表达$\bT(x)$。设$\cF$是有限森林的一元二阶类,$\bF(x)=\sum_n f(n) x^n$是它的(普通)生成函数.假设$\cF$在提取成分树和森林之和下是封闭的。使用上述结构理论的类$\cT$的树在$\cF$,康普顿理论的0- 1法律,并显着加强版本的2003年结果贝尔和伯里斯的生成函数,我们表明,$\cF$有一个一元二阶0- 1法律当且仅当$\bF(x)$的收敛半径是1当且仅当$\bT(x)$的收敛半径是$\ge 1$。

英文摘要:

Let $\cT$ be a monadic-second order class of finite trees, and let $\bT(x)$ be its (ordinary) generating function, with radius of convergence $ρ$. If $ρ\ge 1$ then $\cT$ has an explicit specification (without using recursion) in terms of the operations of union, sum, stack, and the multiset operators $(n)$ and $(\ge n)$. Using this, one has an explicit expression for $\bT(x)$ in terms of the initial functions $x$ and $x\cdot \big(1-x^n\big)^{-1}$, the operations of addition and multiplication, and the Pólya exponentiation operators $\sE_n, \sE_{\ge n}$. Let $\cF$ be a monadic-second order class of finite forests, and let $\bF(x)=\sum_n f(n) x^n$ be its (ordinary) generating function. Suppose $\cF$ is closed under extraction of component trees and sums of forests. Using the above-mentioned structure theory for the class $\cT$ of trees in $\cF$, Compton's theory of 0--1 laws, and a significantly strengthened version of 2003 results of Bell and Burris on generating functions, we show that $\cF$ has a monadic second-order 0--1 law iff the radius of convergence of $\bF(x)$ is 1 iff the radius of convergence of $\bT(x)$ is $\ge 1$.

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

↑