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

Introduction Warping polynomial Span of warping polynomial Span and dealternating number Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram

N/A
N/A
Protected

Academic year: 2021

シェア "Introduction Warping polynomial Span of warping polynomial Span and dealternating number Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram"

Copied!
24
0
0

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

全文

(1)
(2)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

.

§ 0. Introduction

D: an oriented knot diagram c(D): the crossing number of D d(D): the warping degree of D cd(D) = (c(D) , d(D)): the

complexity of D

c(D)

cd(D) d(D) d(D ), d(D ), a b

(3)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

.

§ 0. Introduction

D' D

cd(D)=(8,2) cd(D')=(8,2)

c(D)

cd(D) d(D) d(D ), d(D ), a b

(4)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

.

§ 0. Introduction

D'

D 4

5 4 5 4

3 4

5 6 7

6 5

4 3 3 2

4 5 4 3 2

3 2

3 4 5

6 7 6 5 5 6

cd(D)=(8,2) cd(D')=(8,2)

c(D)

cd(D) d(D) d(D ), d(D ), a b

(5)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

.

§ 0. Introduction

D'

D 4

5 4 5 4

3 4

5 6 7

6 5

4 3 2 3

4 5 4 3 2

3 2

3 4 5

6 7

6 5 5 6

D

2 3 4 5 6 7

2 3 4 5 6 7

W (t)=t +3t +5t +4t +t +t

W D(t): the warping polynomial of D W D'(t)=2t +3t +3t +4t +3t +t

c(D)

cd(D) d(D) d(D ), d(D ), a b

W (t)D

(6)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

.

Contents

§ 1. Warping polynomial

§ 2. Span of the warping polynomial

§ 3. Span and dealternating number

(7)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1. Warping polynomial

§ 1.1. Warping degree of D

b

§ 1.2. Warping degree of D

§ 1.3. Warping polynomial

§ 1.4. Properties of the warping polynomial

(8)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1.1. Warping degree of D

b

D: an oriented knot diagram b: a base point of D

.

.

. . .

. .

A crossing point p of D is a warping crossing point of D

b

if we meet the point first at the under-crossing when we go along D by starting from b.

D

D b

b

p q

warping non-warping

(9)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1.1. Warping degree of Db

. .

. . .

.

.

the warping degree of D

b

d(D

b

) = ♯{ warping crossing points of D

b

}

D

d(D )=1 b

b

d(D c)=0 D

c

(10)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1.2. Warping degree of D

. .

. . .

.

.

the warping degree of D d(D) =

minb

d(D

b

)

D

d(D)=0 d(-D)=1 -D

(Warping degree depends on the orientation.)

(11)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1.3. Warping polynomial

. .

. . .

.

.

Warping degree labeling for D is a labeling s.t.

every edge e has the value d(D

b

), where be.

F D

1 0 1 1 2 1

0 2 0

1 2

3

2 1

E

(12)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1.3. Warping polynomial

.

.

. . .

.

.

Lemma.

i-1

i+1 i

i

F D

1 0 1 1 2 1

0 2 0

1 2

3

2 1

E

(13)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1.3. Warping polynomial

D: an oriented knot diagram

.

.

.

.

The warping polynomial W

D

(t) of D is W

D

(t) = ∑

e

t

i(e)

,

where i(e) is the value of an edge e w.r.t. warping degree labeling.

Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram

(14)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1.3. Warping polynomial

F D

1 0 1

D

2 2 3

E F

1 2 1

0 2 0

1 2

3

2 1

E

W (t)=2t+2t

W (t)=2+2t W (t)=1+2t+2t +t

Example.

(15)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

warping degree of Db warping degree of D warping polynomial properties

.

§ 1.4. Properties of the warping polynomial D: an oriented knot diagram with c(D) ≥ 1

D: D with orientation reversed D

: the mirror image of D

.

.

.

.

W

(t) = 1

mindegW

D

(t) = d(D)

W

D

(1) = 2c(D)

W

D

( − 1) = 0

W

D

(t) = W

D

(t) = t

c(D)

W

D

(t

1

)

Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram

(16)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

span crossing number span 1–3

.

§ 2.1. Span of the warping polynomial

.

. . .

.

.

the span of f (t)

span f (t) = maxdeg f (t)mindeg f (t)

.

.

.

.

Proposition.

spanW

D

(t) = c(D)(d(D) + d(D)) .

• ∀ n ≥ 0, ∃ D s.t. spanW

D

(t) = n.

Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram

(17)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

span crossing number span 1–3

.

§ 2.2. Span and crossing number D: a knot diagram with c(D) ≥ 1

.

.

. . .

.

.

Proposition.

spanW

D

(t)c(D).

“ = ” ⇔ D is a one-bridge diagram.

D

2 3

4 0

1

(18)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

span crossing number span 1–3

.

§ 2.3. Warping polynomials with span 1–3

.

.

.

.

Theorem.

( i ) f (t) is a warping polynomial with span f (t) = 1

f (t) = ct

d

+ ct

d+1

, where 1 ≤ c, 1dc − 1.

(ii) f (t) is a warping polynomial with span f (t) = 2

f (t) = at

d

+ ct

d+1

+ (ca)t

d+2

,

where 2 ≤ c, 1ac − 1, 0 ≤ dc − 2.

(iii) f (t) is a warping polynomial with span f (t) = 3

f (t) = at

d

+ bt

d+1

+ (ca)t

d+2

+ (cb)t

d+3

, where 3 ≤ c, 1a < bc − 1, 0 ≤ dc − 3.

Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram

(19)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

dealternating number alternating diagram almost alternating diagram

.

§ 3.1. Span and dealternating number D: a knot diagram

.

.

. . .

.

.

The dealternating number dalt(D) of D is the

minimal number of crossing changes which turn the diagram into an alternating diagram.

.

.

.

.

Proposition.

dalt(D)spanW

D

(t) − 1

2 .

Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram

(20)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

dealternating number alternating diagram almost alternating diagram

.

§ 3.2. Span and alternating diagram D: a knot diagram with c(D) ≥ 1

.

.

. . .

. .

Theorem [S. 2008].

d(D) + d(D) + 1 ≤ c(D).

“ = ” ⇔ D is an alternating diagram.

. .

.

.

Corollary.

spanW

D

(t) = 1 ⇔ D is an alternating diagram.

Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram

(21)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

dealternating number alternating diagram almost alternating diagram

.

§ 3.3. Span and almost alternating diagram

.

.

.. .

.

.

Proposition.

If a knot diagram D is analmost alternatingdiagram, then spanWD(t) is two or three. Furthermore,

( i )if D is obtained from an alternating diagram by a Reidemeister move I, thenspanWD(t)= 2.

(ii)Otherwise,spanWD(t) =3.

(i) D (ii) E

2 3

W (t)=1+2t+2t +tE

2 3

W (t)=t+4t +3t D

(22)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

dealternating number alternating diagram almost alternating diagram

.

§ 3.3. Span and almost alternating diagram

.

.

.

.

Lemma of (i).

i i+1

D D'

i i

i

D' D

W ( t ) =W ( t ) +t ( 1+t ) .

i i

D D''

i+1 i+1

i

D'' D

W ( t ) =tW ( t ) +t ( 1+t ) .

Ayaka Shimizu (Osaka City University) The span of the warping polynomial of a knot diagram

(23)

Introduction Warping polynomial Span of warping polynomial Span and dealternating number

dealternating number alternating diagram almost alternating diagram

.

§ 3.3. Span and almost alternating diagram

.

.

.

.

Lemma of (ii).

D-

D+

, ,

D0

W

D+

(t) + W

D

(t) = (1 + t)W

D0

(t).

1

1 1

2

2 2

D+

0

2 2

3

1 1

D-

0

1 1

2

1 1

D0

(24)

参照

関連したドキュメント

With that goal in mind, we compare the volume, a measure of geometric complexity of the knot complement, with the Mahler measure of the Jones polynomial, a natural measure of

Keywords: Convex order ; Fréchet distribution ; Median ; Mittag-Leffler distribution ; Mittag- Leffler function ; Stable distribution ; Stochastic order.. AMS MSC 2010: Primary 60E05

The (strong) slope conjecture relates the degree of the col- ored Jones polynomial of a knot to certain essential surfaces in the knot complement.. We verify the slope conjecture

Indeed, if we use the indicated decoration for this knot, it is straightforward if tedious to verify that there is a unique essential state in dimension 0, and it has filtration

This paper presents new results on the bifurcation of medium and small limit cycles from the periodic orbits surrounding a cubic center or from the cubic center that have a

Inside this class, we identify a new subclass of Liouvillian integrable systems, under suitable conditions such Liouvillian integrable systems can have at most one limit cycle, and

The techniques used for studying the limit cycles that can bifurcate from the periodic orbits of a center are: Poincaré return map [2], Abelian integrals or Melnikov integrals

Polynomial invariant and reciprocity theorem on the Hopf monoid of hypergraphs..