On Classification of k-Dimension Paths in n-Cube  

作　　者：G. G. Ryabov V. A. Serov 

机构地区：[1]Research Computer Center of Moscow State University, Moscow State University, Moscow, Russia

出　　处：《Applied Mathematics》2014年第4期723-727,共5页应用数学（英文）

摘　　要：The shortest k-dimension paths (k-paths) between vertices of n-cube are considered on the basis a bijective mapping of k-faces into words over a finite alphabet. The presentation of such paths is proposed as (n - k + 1)×n matrix of characters from the same alphabet. A classification of the paths is founded on numerical invariant as special partition. The partition consists of n parts, which correspond to columns of the matrix.The shortest k-dimension paths (k-paths) between vertices of n-cube are considered on the basis a bijective mapping of k-faces into words over a finite alphabet. The presentation of such paths is proposed as (n - k + 1)×n matrix of characters from the same alphabet. A classification of the paths is founded on numerical invariant as special partition. The partition consists of n parts, which correspond to columns of the matrix.

关 键 词：N-CUBE BIJECTION Cubant k-Face k-Path PARTITION Numerical Invariant Hausdorff-Hamming Metrics 

分 类 号：O1[理学—数学]