首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1篇
  免费   0篇
综合类   1篇
  2014年   1篇
排序方式: 共有1条查询结果,搜索用时 15 毫秒
1
1.
We solve two problems about ascent sequences: how to get the ascent sequence of the reflection of A with respect to its antidiagonal for a matrix A∈ Intn and its ascent sequences, and how to determine the ascent sequence of A+B for k×k matrices A∈ Intn and B∈ Intm. We give the other definition of ascent sequence and get M-sequence. For the first question, we define M-sequence of A and rewrite the ascent sequences as another form.We build the bijection between M-sequences and ascent sequences and prove that our bijection is well-defined. For the second question, we define an operation on M-sequences. On the basis of the operation and the bijections, we get the ascent sequences of the sum of two matrices.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号