arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.13328cs.LO
收藏

秩递减转导

Rank-decreasing transductions

Mikołaj Bojańczyk, Pierre Ohlmann

AI总结:

本文证明在有界树宽输入下,渐近降低截秩的结构变换恰为一元二阶逻辑可定义的转导,并说明无该假设时刻画失效。

摘要:

我们提议研究图上的变换,更一般地说是结构上的变换,方法是考察从输入结构到输出结构时,子集的 cut-rank(截秩,由 Oum 引入)如何受到影响。我们考虑输入和输出的底层集合相同的变换,因此可以方便地比较子集的截秩。本文的目的是用纯结构术语刻画逻辑定义的转导,而不涉及逻辑:在渐近意义下降低截秩的变换,恰好就是那些可以在 monadic second-order logic(一元二阶逻辑)中定义的变换。该刻画假设转导的输入具有有界 treewidth(树宽);我们还表明,在没有任何假设的情况下,该刻画不成立。

英文摘要:

We propose to study transformations on graphs, and more generally structures, by looking at how the cut-rank (as introduced by Oum) of subsets is affected when going from the input structure to the output structure. We consider transformations in which the underlying sets are the same for both the input and output, and so the cut-ranks of subsets can be easily compared. The purpose of this paper is to give a characterisation of logically defined transductions that is expressed in purely structural terms, without referring to logic: transformations which decrease the cut-rank, in the asymptotic sense, are exactly those that can be defined in monadic second-order logic. This characterisation assumes that the transduction has inputs of bounded treewidth; we also show that the characterisation fails in the absence of any assumptions.

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

↑