掃一掃
關(guān)注中圖網(wǎng)
官方微博
包郵 鏈接結(jié)構(gòu)_關(guān)于嵌入完全圖的直線中鏈接單形的組合結(jié)構(gòu)(英文版)
作者：[德]邁克·格斯
開本：
32開
頁數(shù)：
254
本類榜單：自然科學(xué)銷量榜
本類五星書更多>
-
>
宇宙、量子和人類心靈
-
>
氣候文明史
-
>
南極100天
-
>
考研數(shù)學(xué)專題練1200題
-
>
希格斯:“上帝粒子”的發(fā)明與發(fā)現(xiàn)
-
>
神農(nóng)架疊層石:10多億年前遠(yuǎn)古海洋微生物建造的大堡礁
-
>
聲音簡史
鏈接結(jié)構(gòu)_關(guān)于嵌入完全圖的直線中鏈接單形的組合結(jié)構(gòu)(英文版) 版權(quán)信息
- ISBN：9787560394237
- 條形碼：9787560394237 ; 978-7-5603-9423-7
- 裝幀：一般膠版紙
- 冊數(shù)：暫無
- 重量：暫無
- 所屬分類：>
鏈接結(jié)構(gòu)_關(guān)于嵌入完全圖的直線中鏈接單形的組合結(jié)構(gòu)(英文版) 內(nèi)容簡介
Imagine two triangles in the three-dimensional space， such that an edge of the one pierces through the interior of the other， and vice versa. In such a geometrical situation， any continuous transformation that separates the two triangles would lead to an intersection of their boundaries at one moment， and so we call the two triangles and their boundaries linked （germ： "verschlungene Dreiecke"）. It is a known fact in graph theory [8] that any embedding of the complete graph with 6 vertices K6 into R3 has at least one pair of those linked triangles. Prof.Dr.U.Brehm （TU-Dresden）， who was my advisor during this diploma thesis， used the so called Gale diagrams to proof that any straight line embedding of the K6 contains either one or exactly three pairs of linked triangles. In Section 1.3.1 we will explain this technique， which leads to the proof of the corresponding Theorem 1.4， and we give visual examples for both cases in Figure 2.
鏈接結(jié)構(gòu)_關(guān)于嵌入完全圖的直線中鏈接單形的組合結(jié)構(gòu)(英文版) 目錄
Introduction
1 Simplices with linked Boundaries and Linking Structures
1.1 Basics of Affine and Convex Geometry
1.2 Simplices with linked Boundaries
1.2.1 (d+4)-Point Configurations
1.3 Simplices with Vertices in a d +3-Point Configuration in Rd
1.3.1 Gale Transform,Gale Diagram, Gale Order
1.3.2 Radon Partitions and Gale Orders
1.4 Properties of d + 3-Point Configuration induced Linking Structures
1.5 Abstract Linking Structures
1.5.1 Cyclic Linking Structure
1.6 Classification of Linking Structures on d +3 Vertices
1.6.1 Introduction .
1.6.2 Integer Partitions
1.6.3 Prime Numbers
1.6.4 Powers of Two
1.6.5 Calculating the Number using Computers
1.6.6 A complete Formula using Pólya Theory of Counting
2 Linking Numbers and oriented Linking Structures
2.1 Oriented Simplices
2.2 Intersection Number
2.3 Linking Number.
2.4 Intersection and Linking Numbers as Concept in Topology
2.5 Oriented Linking Structures induced by Point Configurations
3 Oriented Matroids and abstract oriented Linking Structures
3.1 Introduction to Matroids
3.2 Introduction to oriented Matroids
3.3 Oriented Simplices and their Intersection in oriented Matroids
3.3.1 Linked Boundaries in oriented Matroids and induced Linking Structures
3.4 Dual oriented Matroids
3.5 Oriented Matroids on r+2 vertices and abstract Gale orders
3.6 Realizability of oriented Matroids
3.7 Intersection Numbers and Linking Numbers in oriented Matroids
3.8 Oriented Matroid induced oriented Linking Structures
3.9 Abstract oriented Linking Structures
3.10 Propositions on Linking Structures and oriented Linking Structures.
4 Algorithms and Data Structures
4.1 Linking Matrices
4.1.1 Isomormorphisms of oriented Linking Structures
4.2 Normal Form and Absolute Normal Form of Linking Matrices
4.3 Non-realizable Linking Structures
4.3.1 Checking Linking Structure Axioms
4.3.2 Reorientation Classes of Linking Structures
4.3.3 Exchange Operation
4.3.4 Exchange Operation Graph
5 Computer Generated Data and the Software Package
5.1 Point Configurations
5.1.1 Point Configurations in R3
5.1.2 Point Configurations in R5
5.2 Exchange Operation Graph Results.
展開全部
書友推薦
- >
苦雨齋序跋文-周作人自編集
- >
新文學(xué)天穹兩巨星--魯迅與胡適/紅燭學(xué)術(shù)叢書(紅燭學(xué)術(shù)叢書)
- >
龍榆生：詞曲概論/大家小書
- >
羅曼·羅蘭讀書隨筆-精裝
- >
月亮虎
- >
唐代進(jìn)士錄
- >
有舍有得是人生
- >
史學(xué)評論
本類暢銷
