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

Celtic Knot Diagram obtained from honeycomb grid

N/A
N/A
Protected

Academic year: 2021

シェア "Celtic Knot Diagram obtained from honeycomb grid"

Copied!
77
0
0

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

全文

(1)

Preliminaries Main Results

Celtic Knot Diagram obtained from honeycomb grid

Yukari Funakoshi

Collaborative Organization for Research in women’s Education of Science, Technology, Engineering, and Mathematics (Nara Women’s University)

December 21, 2019

Joint work with M. Hashizume.

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(2)

1 Preliminaries

2 Main Results

(3)

Preliminaries Main Results

1. Preliminaries

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(4)

Definition 1

Suppose that a plane is divided by polygons. A closed subset of this plane whose boundary is made up of some edges of the polygons is called agrid.

Fact 1

There are only three types of regular polygons that can divide a plane by itself. regular triangle, Square, regular hexagon.

(5)

Preliminaries Main Results

Preliminaries

Definition 2

p×q honeycomb grid

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(6)

Definition 3

Celtic Knot Projection (CKP) induced by p×q honeycomb grid

Celtic Knot Design (CKD) induced by p×q honeycomb grid

(7)

Preliminaries Main Results

Preliminaries

Definition 3

Celtic Knot Projection (CKP) induced by p×q honeycomb grid

Celtic Knot Design (CKD) induced by p×q honeycomb grid

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(8)

Definition 3

Celtic Knot Projection (CKP) induced by p×q honeycomb grid

Celtic Knot Design (CKD) induced by p×q honeycomb grid

(9)

Preliminaries Main Results

Preliminaries

Definition 3

Celtic Knot Projection (CKP) induced by p×q honeycomb grid

Celtic Knot Design (CKD) induced by p×q honeycomb grid

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(10)

Definition 3

Celtic Knot Projection (CKP) induced by p×q honeycomb grid

Celtic Knot Design (CKD) induced by p×q honeycomb grid

(11)

Preliminaries Main Results

Preliminaries

Definition 3

Celtic Knot Projection (CKP) induced by p×q honeycomb grid

Celtic Knot Design (CKD) induced by p×q honeycomb grid

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(12)

Remark 1

CKP

←→

mirror

CKD D1 CKDD2

Today,

We will use D1.

We will express it in CDP, if we don’t need the information above and below of intersections.

(13)

Preliminaries Main Results

Preliminaries Example 1

3×4 4×5

6×10

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(14)

Example 1

3×4 4×5

6×10

(15)

Preliminaries Main Results

Preliminaries Example 1

3×4 4×5

6×10

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(16)

Example 1

3×4 4×5

6×10

(17)

Preliminaries Main Results

Preliminaries Example 1

3×4 4×5

6×10

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(18)

Example 1

3×4 4×5

6×10

(19)

Preliminaries Main Results

Preliminaries Example 1

3×4 4×5

6×10

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(20)

Example 1

3×4 4×5

6×10

(21)

Preliminaries Main Results

Preliminaries Example 1

3×4 4×5

6×10

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(22)

Example 1

3×4 4×5

6×10

(23)

Preliminaries Main Results

Preliminaries Example 1

3×4 4×5

6×10

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(24)

Example 2

r×r honeycomb grid

(25)

Preliminaries Main Results

Preliminaries

Example 2

r×r honeycomb grid

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(26)

Example 2

r×r honeycomb grid

(27)

Preliminaries Main Results

Preliminaries

Example 2

r×r honeycomb grid

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(28)

Example 2

r×r honeycomb grid

(29)

Preliminaries Main Results

Preliminaries

Example 2

r×r honeycomb grid

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(30)

Example 2

r×r honeycomb grid

(31)

Preliminaries Main Results

Preliminaries

Example 2

r×r honeycomb grid

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(32)

Example 3

3×3

3×7

3×11

(33)

Preliminaries Main Results

Preliminaries

Example 3

3×3

3×7

3×11

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(34)

Example 3

3×3

3×7

3×11

(35)

Preliminaries Main Results

Preliminaries

Example 3

3×3

3×7

3×11

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(36)

Example 3

3×3

3×7

3×11

(37)

Preliminaries Main Results

Preliminaries

Example 3

3×3

3×7

3×11

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(38)

Example 4

Examples of other types of links 5×8

7×11

The number of components? The characteristics of each component?

(39)

Preliminaries Main Results

Preliminaries

Example 4

Examples of other types of links 5×8

7×11

The number of components? The characteristics of each component?

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(40)

Example 4

Examples of other types of links 5×8

7×11

The number of components? The characteristics of each component?

(41)

Preliminaries Main Results

Preliminaries

Example 4

Examples of other types of links 5×8

7×11

The number of components? The characteristics of each component?

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(42)

Example 4

Examples of other types of links 5×8

7×11

The number of components? The characteristics of each component?

(43)

Preliminaries Main Results

Preliminaries

Example 4

Examples of other types of links 5×8

7×11

The number of components? The characteristics of each component?

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(44)

2. Main Results

(45)

Preliminaries Main Results

Main Result

Notation 1

Focus on the red component

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(46)

Notation 2

Focus on the red component

(47)

Preliminaries Main Results

Main Result

Notation 3

Focus on the red component

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(48)

Gp×q honeycomb grid Da CKD induced from G

Main Result 1

The number of components of a link obtained fromDis r.

(49)

Preliminaries Main Results

Main Result

Gp×q honeycomb grid , Da CKD induced fromG Proposition 1

Ifq=m(p+ 1)1 (m= 1,2,3, . . .), then the number of components of a links obtained fromDis p and each component is a trivial knot.

3×3 3×7

3×11

There are other types of links, depending on “size of grid”.

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(50)

recall

(51)

Preliminaries Main Results

Main Result

Gp×q honeycomb grid , Da CKD induced fromG Proposition 1

Ifq=m(p+ 1)1 (m= 1,2,3, . . .), then the number of components of a links obtained fromDis p and each component is a trivial knot.

3×3 3×7

3×11

There are other types of links, depending on “size of grid”.

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(52)

Gp×q honeycomb grid , Da CKD induced fromG Proposition 1

Ifq=m(p+ 1)1 (m= 1,2,3, . . .), then the number of components of a links obtained fromDis p and each component is a trivial knot.

3×3 3×7

3×11

There are other types of links, depending on “size of grid”.

(53)

Preliminaries Main Results

Main Result

Gp×q honeycomb grid , Da CKD induced fromG Proposition 1

Ifq=m(p+ 1)1 (m= 1,2,3, . . .), then the number of components of a links obtained fromDis p and each component is a trivial knot.

3×3 3×7

3×11

There are other types of links, depending on “size of grid”.

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(54)

Gp×q honeycomb grid , Da CKD induced fromG Proposition 1

Ifq=m(p+ 1)1 (m= 1,2,3, . . .), then the number of components of a links obtained fromDis p and each component is a trivial knot.

3×3 3×7

3×11

There are other types of links, depending on “size of grid”.

(55)

Preliminaries Main Results

Main Result

Gp×q honeycomb grid , Da CKD induced fromG Main Result 2

The link component obtained fromDpassing through the regular hexagon at the upper left ofGand the component passing through the regular hexagon at the lower right ofGare coincide.

3×7

7×11

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(56)

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

7×11

(57)

Preliminaries Main Results

Main Result

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(58)

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

(59)

Preliminaries Main Results

Main Result

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(60)

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

(61)

Preliminaries Main Results

Main Result

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(62)

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

(63)

Preliminaries Main Results

Main Result

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(64)

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

(65)

Preliminaries Main Results

Main Result

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(66)

Definition 4

The component of the link obtained fromDthat passing through the regular hexagon at the top left ofG is called bySpur.

3×7 4×5

(67)

Preliminaries Main Results

Main Result

7×11

Main Result 3

For link obtained fromD, each component except Spur are same knot.

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(68)

7×11

Main Result 3

For link obtained fromD, each component except Spur are same knot.

(69)

Preliminaries Main Results

Main Result

7×11

Main Result 3

For link obtained fromD, each component except Spur are same knot.

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(70)

14× 24

(71)

Preliminaries Main Results

Main Result3

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(72)
(73)

Preliminaries Main Results

Main Result3

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(74)
(75)

Preliminaries Main Results

Main Result3

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

(76)
(77)

Preliminaries Main Results

Main Result3

Yukari Funakoshi Celtic Knot Diagram obtained from honeycomb grid

参照

関連したドキュメント

Kilbas; Conditions of the existence of a classical solution of a Cauchy type problem for the diffusion equation with the Riemann-Liouville partial derivative, Differential Equations,

In [7], assuming the well- distributed points to be arranged as in a periodic sphere packing [10, pp.25], we have obtained the minimum energy condition in a one-dimensional case;

The main problem upon which most of the geometric topology is based is that of classifying and comparing the various supplementary structures that can be imposed on a

In analogy with Aubin’s theorem for manifolds with quasi-positive Ricci curvature one can use the Ricci flow to show that any manifold with quasi-positive scalar curvature or

Our method of proof can also be used to recover the rational homotopy of L K(2) S 0 as well as the chromatic splitting conjecture at primes p > 3 [16]; we only need to use the

This paper gives a decomposition of the characteristic polynomial of the adjacency matrix of the tree T (d, k, r) , obtained by attaching copies of B(d, k) to the vertices of

A Darboux type problem for a model hyperbolic equation of the third order with multiple characteristics is considered in the case of two independent variables.. In the class

7.1. Deconvolution in sequence spaces. Subsequently, we present some numerical results on the reconstruction of a function from convolution data. The example is taken from [38],