• 検索結果がありません。

仮想結び目のチェッカーボード彩色に ついて

N/A
N/A
Protected

Academic year: 2021

シェア "仮想結び目のチェッカーボード彩色に ついて"

Copied!
59
0
0

読み込み中.... (全文を見る)

全文

(1)

仮想結び目のチェッカーボード彩色に ついて

広島大学大学院理学研究科 今別府 孝規

– Typeset by FoilTEX

(2)

Def

A virtual link diagram is a link diagram which may have virtual crossings.

positive negative virtual

– Typeset by FoilTEX 1

(3)

– Typeset by FoilTEX 2

(4)

Def

A virtual link is the equivalence class of virtual link diagram under the generalized Reidemeister moves.

Generalized Reidmeister moves

– Typeset by FoilTEX 3

(5)

Def

Σ : a compact oriented surface.

D : a virtual link diagram, which is a deformation retract   of Σ.

A pair (Σ, D) is called an abstract link diagram (ALD).

Def

φ :{virtual link diagram}−→{ALD}

We call φ(D) an ALD associated with D.

– Typeset by FoilTEX 4

(6)

ex

Virtual link diagram ALD

– Typeset by FoilTEX 5

(7)

Def

A checkerboard coloring of ALD is a coloring of regions by black and white, such that adjacent regions have different colorings.

– Typeset by FoilTEX 6

(8)

Def

D : a virtual link diagram.

If an ALD associated with D is checkerboard colorable, then D is checkerboard colorable.

Fact

If D is classical link diagram, then D is checkerboard colorable.

– Typeset by FoilTEX 7

(9)

– Typeset by FoilTEX 8

(10)

– Typeset by FoilTEX 9

(11)

– Typeset by FoilTEX 10

(12)

– Typeset by FoilTEX 11

(13)

– Typeset by FoilTEX 12

(14)

– Typeset by FoilTEX 13

(15)

– Typeset by FoilTEX 14

(16)

– Typeset by FoilTEX 15

(17)

– Typeset by FoilTEX 16

(18)

– Typeset by FoilTEX 17

(19)

– Typeset by FoilTEX 18

(20)

Def

L : a virtual link.

L is checkerboard colorable

⇐⇒ L has a checkerboard colorable virtual link diagram.

– Typeset by FoilTEX 19

(21)

A table of virtual knots with up to four real crossing [N.Kamada]

1 2 3 4 5 6 7 8 9

10 11 12 13 14 15 16 17 18

19 20 21 22 23 24 25 26 27

29 30 31 32 33 34 35 36

28

38 39 40 41 42 43 44

37 45

– Typeset by FoilTEX 20

(22)

46 47 48 49 50 51 52 53 54

55 56 57 58 59 60 61 62 63

64 65 66 67 68 69 70 71 72

73 74 75 76 77 78 79 80 81

83 84 85 86 87 88 89 90

82

91 92 93 94 95 96 97 98 99

– Typeset by FoilTEX 21

(23)

Result 1

The following 13 virtual knots are checkerboard colorable.

1 2 3 4 5 6 7 8 9

10 11 12 13 14 15 16 17 18

19 20 21 22 23 24 25 26 27

29 30 31 32 33 34 35 36

28

38 39 40 41 42 43 44

37 45

– Typeset by FoilTEX 22

(24)

Result 1

The following 13 virtual knots are checkerboard colorable.

1 2 3 4 5 6 7 8 9

10 11 12 13 14 15 16 17 18

19 20 21 22 23 24 25 26 27

29 30 31 32 33 34 35 36

28

38 39 40 41 42 43 44

37 45

– Typeset by FoilTEX 23

(25)

46 47 48 49 50 51 52 53 54

55 56 57 58 59 60 61 62 63

64 65 66 67 68 69 70 71 72

73 74 75 76 77 78 79 80 81

83 84 85 86 87 88 89 90

82

91 92 93 94 95 96 97 98 99

– Typeset by FoilTEX 24

(26)

46 47 48 49 50 51 52 53 54

55 56 57 58 59 60 61 62 63

64 65 66 67 68 69 70 71 72

73 74 75 76 77 78 79 80 81

83 84 85 86 87 88 89 90

82

91 92 93 94 95 96 97 98 99

– Typeset by FoilTEX 25

(27)

2 3 4

38 39 40

– Typeset by FoilTEX 26

(28)

41 42 43

44 45 46

47

– Typeset by FoilTEX 27

(29)

Result 2

The following 83 virtual knots are not checkerboard colorable.

1 2 3 4 5 6 7 8 9

10 11 12 13 14 15 16 17 18

19 20 21 22 23 24 25 26 27

29 30 31 32 33 34 35 36

28

38 39 40 41 42 43 44

37 45

– Typeset by FoilTEX 28

(30)

Result 2

The following 83 virtual knots are not checkerboard colorable.

1 2 3 4 5 6 7 8 9

10 11 12 13 14 15 16 17 18

19 20 21 22 23 24 25 26 27

29 30 31 32 33 34 35 36

28

38 39 40 41 42 43 44

37 45

– Typeset by FoilTEX 29

(31)

46 47 48 49 50 51 52 53 54

55 56 57 58 59 60 61 62 63

64 65 66 67 68 69 70 71 72

73 74 75 76 77 78 79 80 81

83 84 85 86 87 88 89 90

82

91 92 93 94 95 96 97 98 99

– Typeset by FoilTEX 30

(32)

46 47 48 49 50 51 52 53 54

55 56 57 58 59 60 61 62 63

64 65 66 67 68 69 70 71 72

73 74 75 76 77 78 79 80 81

83 84 85 86 87 88 89 90

82

91 92 93 94 95 96 97 98 99

– Typeset by FoilTEX 31

(33)

Fact[Kauffman ’99]f-polynomial f: {virtual link}−→ Z[A, A−1]

Thm[N.Kamada ’02]

L: a virtual link with n components.

EXP(f(L)): the set of integers appearing as exponents of      f(L).

ex) f(L) = 3A6 + A4 2A−2   EXP(f(L)) = {6, 4, −2}

If L is checkerboard colorable, then EXP(f(L)) 4Z if n is odd, and EXP(f(L)) 4Z + 2 if n is even.

– Typeset by FoilTEX 32

(34)

ex

No.1

f(L) = A−4 + A−6 A−10 EXP(f(L)) = {−4, −6, −10}

– Typeset by FoilTEX 33

(35)

Def

c : a classical crossing of an oriented virtual link diagram D.

Dc:a virtual link daigram of the component which have c.

Smoothing c

c

Dc0 : a virtual link diagram of the smoothed Dc.

– Typeset by FoilTEX 34

(36)

If Dc0 is a two-component virtual link diagram, we choose an ordering (k1,k2) for the components of Dc0.

V : the set of virtual crossings between k1 and k2.

k1 k1

k2 k2

ind(v) = 1 ind(v) = −1

– Typeset by FoilTEX 35

(37)

– Typeset by FoilTEX 36

(38)

c

1

– Typeset by FoilTEX 37

(39)

– Typeset by FoilTEX 38

(40)

k2 k1

– Typeset by FoilTEX 39

(41)

Def

If Dc0 is a two-component virtual link diagram, then the virtual intersection index i(c) is given by

i(c) = | X

v∈V

ind(v)|.

– Typeset by FoilTEX 40

(42)

k2 k1

i(c1) = 2

– Typeset by FoilTEX 41

(43)

Def

If Dc0 is a one-component virtual link diagram, then i(c) is given by

i(c) = 0.

– Typeset by FoilTEX 42

(44)

c

2

– Typeset by FoilTEX 43

(45)

i(c2) = 0

– Typeset by FoilTEX 44

(46)

Thm[Y.H.Im-K.Lee-S.Y.Lee ’10]

D : a virtual link diagram.

A polynomial Q(D) is defined by Q(D) = X

c

sign(c)(ti(c) 1) Z[t].

Q(D) is an invariant for virtual links.

– Typeset by FoilTEX 45

(47)

c

1

i(c1) = 2, sign(c1)(ti(c1) 1) = t2 1

– Typeset by FoilTEX 46

(48)

c

2

i(c2) = 0, sign(c2)(ti(c2) 1) = 0

– Typeset by FoilTEX 47

(49)

Q(D) = t2 + 2t 3

– Typeset by FoilTEX 48

(50)

Thm[Y.H.Im-K.Lee-S.Y.Lee ’10]

L : a virtual link.

If L is checkerboard colorable, then Q(L) Z[t2].

– Typeset by FoilTEX 49

(51)

Q(D) = t2 + 2t 3 / Z[t2]

– Typeset by FoilTEX 50

(52)

Result 2

The following 83 virtual knots are not checkerboard colorable.

1 2 3 4 5 6 7 8 9

10 11 12 13 14 15 16 17 18

19 20 21 22 23 24 25 26 27

29 30 31 32 33 34 35 36

28

38 39 40 41 42 43 44

37 45

– Typeset by FoilTEX 51

(53)

Result 2

The following 83 virtual knots are not checkerboard colorable.

1 5 6 8 9

10 11 12 13 14 15 16 17 18

19 20 21 22 23 24 25 26 27

29 30 31 32 33 34 35 36

37

– Typeset by FoilTEX 52

(54)

Result 2

The following 83 virtual knots are not checkerboard colorable.

1 5 6 8 9

10 11 12 13 14 15 16 17 18

19 20 21 22 23 24 25 26 27

29 30 31 32 33 34 35 36

37

– Typeset by FoilTEX 53

(55)

46 47 48 49 50 51 52 53 54

55 56 57 58 59 60 61 62 63

64 65 66 67 68 69 70 71 72

73 74 75 76 77 78 79 80 81

83 84 85 86 87 88 89 90

82

91 92 93 94 95 96 97 98 99

– Typeset by FoilTEX 54

(56)

48 49 50 51 52 53 54

55 56 57 58 59 60 62 63

64 65 66 67 68 69 70 71 72

73 74 75 76 77 78 79 80 81

83 84 85 86 87 88 89 90

82

91 92 93 94 95 96 97 98 99

– Typeset by FoilTEX 55

(57)

48 49 50 51 52 53 54

55 56 57 58 59 60 62 63

64 65 66 67 68 69 70 71 72

73 74 75 76 77 78 79 80 81

83 84 85 86 87 88 89 90

82

91 92 93 94 95 96 97 98 99

– Typeset by FoilTEX 56

(58)

Result 3

For the following 3 virtual knots, checkerboard colorability is unknown.

7 28 96

f = 1 f = 1 f = 1 A−4

Q = 0 Q = 0 Q = 2(t2 1)

– Typeset by FoilTEX 57

(59)

Thank you

– Typeset by FoilTEX 58

参照

関連したドキュメント

Nevertheless, as demonstrated by our evaluation, quasicrystal sampling is shown to be proficient at supporting a uniform sampling density, centroidal Voronoi regions, accurate

・虹彩色素沈着(メラニンの増加により黒目(虹彩)の色が濃くなる)があらわれ

In this section we generalize some of the results of Sommers [16] on bounded dominant regions of Cat and positive filters in + to bounded dominant regions of A m and

A map is bipartite if its vertices are colored in white and black, and each white vertex has only black neighbors.. Figure 1: A non-oriented bipartite map on the

Provided that the reduction of the time interval leads to incomparableness of normalized bubble-size distributions and does not change the comparable distributions in terms of

The basic bound on the chromatic number of a graph of maximum degree ∆ is ∆ + 1 obtained by coloring the vertices greedily; Brooks theorem states that equality holds only for

This paper is a sequel to [1] where the existence of homoclinic solutions was proved for a family of singular Hamiltonian systems which were subjected to almost periodic forcing...

The Bruhat ordering of every nontrivial quotient of a dihedral group is a chain, so all such Coxeter groups and their quotients have tight Bruhat orders by Theorem 2.3.. Also, we