论文标题
Brin-Higman-Thompson小组的单调版本
A monoid version of the Brin-Higman-Thompson groups
论文作者
论文摘要
我们将Brin-higman-Thompson组概括为$ n g_ {k，1} $ to monoids $ n m_ {k，1} $，用于$ n \ ge 1 $和$ k \ ge 2 $，通过部分功能替换生物。 monoid $ n m_ {k，1} $具有$ n g_ {k，1} $作为其组的组，并且是一致的简单。此外，$ n m_ {k，1} $是有限生成的，对于$ n \ ge 2 $，其单词问题是{\ sf conp} -complete。我们还提出了有关高维无连接代码的新结果。
We generalize the Brin-Higman-Thompson groups $n G_{k,1}$ to monoids $n M_{k,1}$, for $n \ge 1$ and $k \ge 2$, by replacing bijections by partial functions. The monoid $n M_{k,1}$ has $n G_{k,1}$ as its group of units, and is congruence-simple. Moreover, $n M_{k,1}$ is finitely generated, and for $n \ge 2$ its word problem is {\sf coNP}-complete. We also present new results about higher-dimensional joinless codes.
