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

关系结构的分解单态性和分类特征

Décomposition monomorphe des structures relationnelles et profil de classes héréditaires

Djamila Oudrar, Maurice Pouzet

摘要:

本文给出了有限结构遗传类的轮廓(别名母函数)的跳跃行为的一些结果的结构方法。我们从N.Thiéry和第二作者提出的以下概念开始。关系结构$R$的\emph{monomorphic decomposition}是其域$V(R)$到集合族$(V_x)_{x\in X}$的划分,使得$R$对$V(R)$的两个有限子集$A$和$A'$的限制是同构的,只要迹$A\cap V_x$和$A'\cap V_x$对于每个$x\in X$具有相同的大小。设$\mathscr S_μ$是不具有有限单态分解的签名$μ$的关系结构类。我们表明,如果遗传子类$\mathscr D$的$\mathscr S_μ$是有序的关系结构,那么它包含一个有限的子集$\mathfrak A$,使每个成员的$\mathscr D$嵌入一些成员的$\mathfrak A$。此外,对于每个$R\in \mathfrak A$,$R$(由$R$的有限子结构制成)的年龄$\mathcal A(R)$的分布至少是指数的。我们推导出,如果一个有限序结构的遗传类的配置文件是不是有界的多项式,那么它至少是指数。这个结果是Balogh,Bollobás and Morris(2006)对有序图分类的一部分。引用本文:Djamila Oudrar,Maurice Pouzet,C. R. Acad. Sci. Paris,Ser. I.}

英文摘要:

We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We start with the following notion due to N.Thiéry and the second author. A \emph{monomorphic decomposition} of a relational structure $R$ is a partition of its domain $V(R)$ into a family of sets $(V_x)_{x\in X}$ such that the restrictions of $R$ to two finite subsets $A$ and $A'$ of $V(R)$ are isomorphic provided that the traces $A\cap V_x$ and $A'\cap V_x$ have the same size for each $x\in X$. Let $\mathscr S_μ$ be the class of relational structures of signature $μ$ which do not have a finite monomorphic decomposition. We show that if a hereditary subclass $\mathscr D$ of $\mathscr S_μ$ is made of ordered relational structures then it contains a finite subset $\mathfrak A$ such that every member of $\mathscr D$ embeds some member of $\mathfrak A$. Furthermore, for each $R\in \mathfrak A$ the profile of the age $\mathcal A(R)$ of $R$ (made of finite substructures of $R$) is at least exponential. We deduce that if the profile of a hereditary class of finite ordered structures is not bounded by a polynomial then it is at least exponential. This result is a part of classification obtained by Balogh, Bollobás and Morris (2006) for ordered graphs. {\it To cite this article: Djamila Oudrar, Maurice Pouzet, C. R. Acad. Sci. Paris, Ser. I.}

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

↑