| 最大跳跃数M(19,10) |
| |
| 引用本文： | 游林,王天明. 最大跳跃数M(19,10)[J]. 北京邮电大学学报, 2003, 26(Z1): 28-37 |
| |
| 作者姓名： | 游林 王天明 |
| |
| 作者单位： | 1.大连理工大学 应用数学系,大连 116023;2.海南师范大学 组合与信息实验室,海口 571158 |
| |
| 基金项目： | 海南省自然科学基金;10002; |
| |
| 摘 要： | 如果n及k（n≥k）是两个较大的正整数,那么要计算出最大跳跃数M（n,k）的值非常困难,Brualdi与Jung曾给出了当1≤k≤n≤10时M（n,k）的值,对于k=10,n=19,证明了M（19,10）=33,这证实了Brualdi与Jung的关于最大跳跃数M（2k+1,k+1）的值的猜想在k=9时成立,但是他们的另一个猜想M（n,k）
|
| 关 键 词： | (0 1)-矩阵 最大跳跃数 猜想 |
| 文章编号： | 1007-5321(2003)增-0028-10 |
| 修稿时间： | 2002-10-01 |
The Maximal Jump Number M(19,10) |
| |
| YOU Lin,WANG Tian-ming. The Maximal Jump Number M(19,10)[J]. Journal of Beijing University of Posts and Telecommunications, 2003, 26(Z1): 28-37 |
| |
| Authors: | YOU Lin WANG Tian-ming |
| |
| Affiliation: | 1.Department of Applied Mathematics, Dalian University of Technology, Dalian 116023, China;2.Combinatorics and Information Laboratory, Hainan Normal University, Haikou 571158, China |
| |
| Abstract: | If n and k (n>=k) are two large positive integers, then it is quite difficult to give the value of the maximal jump number M(n,k). Brualdi and Jung gave a table about the values of M(n,k) for 1<=k<=n<=10. For k=10, n=19, we prove M(19,10)=33, which verifies that one of their conjecture about the value M(2k+1,k+1) holds for k=9 and that their another conjecture M(n,k)
|
| |
| Keywords: | (0 1 )-matrix maximal jump number conjecture |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
|
