...
首页> 外文期刊>Theoretical computer science >Topological adjacency relations on Z(n)
【24h】

Topological adjacency relations on Z(n)

机译:Z(n)上的拓扑邻接关系

获取原文
获取原文并翻译 | 示例

摘要

For which adjacency relations (i.e., irreflexive symmetric binary relations) alpha on Z(n) does there exist a topology tau on Z(n) such that the tau-connected sets are exactly the alpha-path-connected subsets of Z(n)? If such a topology exists then we say that the relation alpha is topological. Let l(1) and l(infinity), respectively, denote the 4- and the 8-adjacency relations on Z(2) and the analogs of these two relations on Z(n) (for any positive integer n). Consider adjacency relations alpha on Z(n) such that 1. For x, y is an element of Z(n), x l(1) y double right arrow x alpha y double right arrow x l(infinity) y 2. For all x is an element of Z(n), the set (x) boolean OR (y x alpha y) is l(1)-path-connected. Among the uncountably many adjacency relations alpha satisfying conditions 1 and 2 above, Eckhardt and Latecki showed that there are (up to isomorphism) just two topological relations on Z(2), and essentially showed that there are just four topological relations on Z(3). We show in this paper that for any positive integer n there are only finitely many topological adjacency relations on Z(n) that satisfy conditions I and 2, and we relate the problem of finding these relations to the problem of finding all sets of vertices of an n-cube such that no two vertices in the set are the endpoints of an edge of the n-cube. From our main theorems we deduce the above-mentioned results of Latecki and Eckhardt, and also deduce that there are (again, up to isomorphism) exactly 16 topological adjacency relations on Z(4) that satisfy conditions I and 2. (C) 2002 Elsevier Science B.V. All rights reserved. [References: 10]
机译:对于Z(n)上的a的邻接关系(即,非反身对称二进制关系),在Z(n)上是否存在拓扑tau,使得tau连接的集合恰好是Z(n)的alpha路径连接的子集?如果存在这样的拓扑,则可以说关系alpha是拓扑。令l(1)和l(infinity)分别表示Z(2)的4和8邻接关系以及Z(n)的这两个关系的类似物(对于任何正整数n)。考虑Z(n)上的邻接关系alpha,使得1.对于x,y是Z(n)的元素,xl(1)y双右箭头x alpha y双右箭头xl(infinity)y2。对于所有x是Z(n)的元素,则集合(x)布尔OR(y x alpha y)是l(1)路径连接的。在满足上述条件1和2的无数个邻接关系alpha中,Eckhardt和Latecki表明(直到同构)Z(2)上只有两个拓扑关系,实质上表明Z(3)上只有四个拓扑关系。 )。我们在本文中证明,对于任何正整数n,在Z(n)上仅存在满足条件I和2的有限多个拓扑邻接关系,并且我们将找到这些关系的问题与找到的所有顶点集合的问题联系起来。 n立方体,使得集合中没有两个顶点是n立方体的边缘的端点。从我们的主要定理中,我们推论出Latecki和Eckhardt的上述结果,并且还推论出Z(4)上恰好有16个拓扑邻接关系(再次达到同构),满足条件I和2。(C)2002 Elsevier Science BV保留所有权利。 [参考:10]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号