群的上下文无关偶I:上下文无关偶与图
Context-free pairs of groups I: Context-free pairs and graphs
摘要:
设$G$是一个有限生成群,$A$是生成元的有限集,$K$是$G$的子群.如果$A$上所有在$G$中归约为$K$的元素的词的集合是上下文无关语言,则我们称这对$(G,K)$为上下文无关语言。当$K$是平凡的时,$G$本身被称为上下文无关的;上下文无关的自由群在20多年前就在Muller和Schupp的著名著作中被分类为虚拟自由群。在这里,我们得到了一些基本性质,这样的群对。上下文无关性与生成集的选择无关。它在$G$的有限指数修改和$K$的有限指数放大下保持不变。如果$G$实际上是自由的,并且$K$是随机生成的,则$(G,K)$是上下文无关的。一个基本的工具如下:$(G,K)$是上下文无关的当且仅当$(G,K)$关于$A$的Schreier图是上下文无关图。
英文摘要:
Let $G$ be a finitely generated group, $A$ a finite set of generators and $K$ a subgroup of $G$. We call the pair $(G,K)$ context-free if the set of all words over $A$ that reduce in $G$ to an element of $K$ is a context-free language. When $K$ is trivial, $G$ itself is called context-free; context-free groups have been classified more than 20 years ago in celebrated work of Muller and Schupp as the virtually free groups. Here, we derive some basic properties of such group pairs. Context-freeness is independent of the choice of the generating set. It is preserved under finite index modifications of $G$ and finite index enlargements of $K$. If $G$ is virtually free and $K$ is finitely generated then $(G,K)$ is context-free. A basic tool is the following: $(G,K)$ is context-free if and only if the Schreier graph of $(G,K)$ with respect to $A$ is a context-free graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。