一些简单秩一理论中的剪切
Shearing in some simple rank one theories
AI总结:
本文刻画了随机图的剪切性质,并利用剪切区分随机图与高阶无三角形随机图理论 $T_{n,k}$,证明剪切在简单不稳定秩一理论中不同于划分且具有分类意义。
摘要:
划分(Dividing)关注沿不可辨序列的不一致性。为了研究没有太多划分的简单理论的更精细结构,作者最近引入了剪切(shearing)概念,它本质上关注沿广义不可辨序列的不一致性。本文刻画了随机图的剪切。随后我们利用剪切来区分随机图与理论 $T_{n,k}$,后者是无三角形随机图的高阶类比。由此得出,在简单不稳定理论中,剪切不同于划分,并且能在简单不稳定秩一理论的各类之间进行有意义的区分。本文以剪切的概述开篇,并包含一些开放问题。
英文摘要:
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along generalized indiscernible sequences. Here we characterize the shearing of the random graph. We then use shearing to distinguish between the random graph and the theories $T_{n,k}$, the higher-order analogues of the triangle-free random graph. It follows that shearing is distinct from dividing in simple unstable theories, and distinguishes meaningfully between classes of simple unstable rank one theories. The paper begins with an overview of shearing, and includes open questions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。