Sheet number and quandle-colored 2-knot
スポンサーリンク
概要
- 論文の詳細を見る
A diagram of a 2-knot consists of a finite number of compact, connected surfaces called sheets. We prove that if a 2-knot admits a non-trivial coloring by some quandle, then any diagram of the 2-knot needs at least four sheets. Moreover, if a 2-knot admits a non-trivial 5- or 7-coloring, then any diagram needs at least five or six sheets, respectively.
- 社団法人 日本数学会の論文
- 2009-04-01
著者
-
Satoh Shin
Department of Cardiovascular Center, Toho University Sakura Hospital
-
Satoh Shin
Department Of Mathematics Kobe University
関連論文
- PE-328 Relationship Between Preheparin Serum Lipoprotein Lipase Mass and Multiple Risk Factors Clustering Syndrome(Atherosclerosis, Clinical 6 (IHD) : PE56)(Poster Session (English))
- OJ-076 Clinical Significance of Urinary 8-iso-prostaglandin F2 α Levels in Patients with Percutaneous Coronary Intervention(Coronary Revascularization, PICA/Stent/DCA/Rotablator/New Device 1 (IHD) : OJ9)(Oral Presentation (Japanese))
- FRS-164 Low Preheparin Serum Lipoprotein Lipase Mass is a Predictive Factor for Stent Restenosis(Coronary Heart Disease : Basic Science (IHD) : FRS20)(Featured Research Session (English))
- Sporadic acute hepatitis E of a 47-year-old man whose pet cat was positive for antibody to hepatitis E virus
- An autopsy case of Alzheimer's disease with a progressive supranuclear palsy overlap
- Sheet number and quandle-colored 2-knot