首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4篇
  免费   0篇
数学   3篇
综合类   1篇
  2019年   1篇
  2013年   1篇
  2009年   1篇
  2002年   1篇
排序方式: 共有4条查询结果,搜索用时 15 毫秒
1
1.
目的:探讨儿童急性白血病转归与治疗的关系。方法;对接受治疗的患儿进行疗效观察,比较。结果:接受正规化疗者骨髓持续完全缓解率[CCR]高,不正规化疗者出现并发症,预后差。结论:正规长期化疗与长期生存呈正相关关系。  相似文献   
2.
Ralf Goertz 《Discrete Mathematics》2009,309(16):5248-5252
Motivated by a question about uniform dessins d’enfants, it is conjectured that every cyclic planar difference set of prime power order m≠4 can be cyclically ordered such that the difference of every pair of neighbouring elements is coprime to the module v?m2+m+1. We prove that this is the case whenever the number ω(v) of different prime divisors of v is less than or equal to 3. To achieve this we consider a graph related to the difference set and show that it is Hamiltonian.  相似文献   
3.
Let  = osp(2, 2n) denote the complex Lie superalgebra of type C of rank n + 1. Let V(λ) denote the irreducible representation of  with the highest weight λ. For each finite dimensional V(λ), we describe the character of V(λ) combinatorially using the generalized osp(2, 2n)-standard tableaux of λ.  相似文献   
4.
《Discrete Mathematics》2019,342(2):314-325
A dessin is a 2-cell embedding of a connected 2-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of colour- and orientation-preserving automorphisms acts regularly on the edges. In this paper we employ group-theoretic method to determine and enumerate the isomorphism classes of regular dessins with complete bipartite underlying graphs of odd prime power order.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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