Patterns and Higher-Order Stability in the Coefficients of the Colored Jones Polynomial. Katie Walsh Hall
|
|
- Janel Lyons
- 5 years ago
- Views:
Transcription
1 Patterns and Higher-Order Stability in the Coefficients of the Colored Jones Polynomial Katie Walsh Hall
2 The Colored Jones Polynomial The colored Jones polynomial is knot invariant. It assigns to each knot a sequence of polynomials. We want to look at the coefficients of these polynomials. Katie Walsh Hall Patterns and Higher Order Stability 2 / 68
3 The Colored Jones Polynomial The colored Jones polynomial is knot invariant. It assigns to each knot a sequence of polynomials. We want to look at the coefficients of these polynomials. Katie Walsh Hall Patterns and Higher Order Stability 2 / 68
4 The Colored Jones Polynomial The colored Jones polynomial is knot invariant. It assigns to each knot a sequence of polynomials. We want to look at the coefficients of these polynomials. N Highest Terms of the Colored Jones Polynomial of q 2 q + 1 q 1 + q 2 3 q 6 q 5 q 4 + 2q 3 q 2 q + 3 q 1 q q 12 q 11 q 10 +0q 9 + 2q 8 2q 6 + 3q 4 3q q 20 q 19 q 18 +0q 17 +0q q 15 q 14 q q 30 q 29 q 28 +0q 27 +0q 26 +q q q q 42 q 41 q 40 +0q 39 +0q 38 +q 37 +0q q 35 + Katie Walsh Hall Patterns and Higher Order Stability 3 / 68
5 The Colored Jones Polynomial The colored Jones polynomial is knot invariant. It assigns to each knot a sequence of polynomials. We want to look at the coefficients of these polynomials. Katie Walsh Hall Patterns and Higher Order Stability 4 / 68
6 Notes on Normalization The (N + 1) st colored Jones polynomial of a knot K is the Jones polynomial of K decorated with the f (N), the Jones-Wenzl idempotent in TL n. Katie Walsh Hall Patterns and Higher Order Stability 5 / 68
7 Notes on Normalization The (N + 1) st colored Jones polynomial of a knot K is the Jones polynomial of K decorated with the f (N), the Jones-Wenzl idempotent in TL n. Normalized colored Jones polynomial: J N,unknot (q) = 1 Un-normalized colored Jones polynomial: J N,unknot (q) = N 1 = ( 1) N 1 [N] J N,K (q) = J N,K (q) N 1 We use the convention that N = 2 gives the standard Jones polynomial. Katie Walsh Hall Patterns and Higher Order Stability 5 / 68
8 Set-Up Katie Walsh Hall Patterns and Higher Order Stability 6 / 68
9 Set-Up 5 Katie Walsh Hall Patterns and Higher Order Stability 7 / 68
10 The 5 th colored Jones Polynomial for figure 8 knot is: 1 q 20 1 q 19 1 q q 15 1 q 14 1 q 13 1 q 12 1 q q 10 1 q 9 2 q 8 2 q 7 1 q q 5 1 q 4 2 q 3 2 q 2 1 q +7 q 2q2 2q 3 q 4 +6q 5 q 6 2q 7 2q 8 q 9 +5q 10 This has coefficients: q 11 q 12 q 13 q q 15 q 18 q 19 + q 20 {1, 1, 1, 0, 0, 3, 1, 1, 1, 1, 5, 1, 2, 2, 1, 6, 1, 2, 2, 1, 7, 1, 2, 2, 1, 6, 1, 2, 2, 1, 5, 1, 1, 1, 1, 3, 0, 0, 1, 1, 1} Katie Walsh Hall Patterns and Higher Order Stability 8 / 68
11 {1, 1, 1, 0, 0, 3, 1, 1, 1, 1, 5, 1, 2, 2, 1, 6, 1, 2, 2, 1, 7, 1, 2, 2, 1, 6, 1, 2, 2, 1, 5, 1, 1, 1, 1, 3, 0, 0, 1, 1, 1} We can plot these: Figure: Coefficients of the 5 th Colored Jones Polynomial for the Figure Eight Knot Katie Walsh Hall Patterns and Higher Order Stability 9 / 68
12 Figure: Coefficients of the 20 th Colored Jones Polynomial for the Figure Eight Knot Katie Walsh Hall Patterns and Higher Order Stability 10 / 68
13 Figure: Coefficients of the 50 th Colored Jones Polynomial for the Figure Eight Knot Katie Walsh Hall Patterns and Higher Order Stability 11 / 68
14 Figure: Coefficients of the 95 th Colored Jones Polynomial for the Figure Eight Knot Katie Walsh Hall Patterns and Higher Order Stability 12 / 68
15 What is this polynomial? J N,4 1 (q) = = = N 1 n=0 k=1 N 1 n n=0 k=1 N 1 n n=0 k=1 n {N + k}{n k} (q (N+k)/2 q (N+k)/2 )(q (N k)/2 q (N k)/2 ) (q N q k q k + q N ) Katie Walsh Hall Patterns and Higher Order Stability 13 / 68
16 What about other knots? See Mathematica Demo... Katie Walsh Hall Patterns and Higher Order Stability 14 / 68
17 But what about the middle? Katie Walsh Hall Patterns and Higher Order Stability 15 / 68
18 Figure 8 Knot Middle Coefficients Observed Properties The middle coefficient is the constant term. The maximum coefficient is the coefficient of constant term. Some sort of N-periodicity in the middle coefficients. Katie Walsh Hall Patterns and Higher Order Stability 16 / 68
19 Constant Coefficient of the Colored Jones Polynomial of the Figure 8 Knot Constant Coefficient Number of Colors Figure: The Maximum Coefficient of the N Colored Jones Polynomial of the Figure 8 Knot as a function of N. Katie Walsh Hall Patterns and Higher Order Stability 17 / 68
20 Assumption The maximum coefficient takes the form Ae bn where N is the number of colors and A and b depend on the knot. Proposition The colored Jones polynomial of a knot K satisfies log J k (N)(e 2πi/N ) lim lim N N N log m K (N). N If the above assumption holds, then the colored Jones polynomial satisfies log J k (N)(e 2πi/N ) lim b. N N Katie Walsh Hall Patterns and Higher Order Stability 18 / 68
21 Assumption The maximum coefficient takes the form Ae bn where N is the number of colors and A and b depend on the knot. So for knots where the Hyperbolic Volume Conjecture holds we get to following Proposition For knots for which the Hyperbolic Volume conjecture holds vol(s 3 \K) 2π lim N log m K (N). N Now, if we include the above assumption, so that m(k)(n) = Ae bn, we get vol(s 3 \K) 2π b. Katie Walsh Hall Patterns and Higher Order Stability 19 / 68
22 Assumption The maximum coefficient takes the form Ae bn where N is the number of colors and A and b depend on the knot. Assumption The coefficients take the form of a normal distribution times a sine wave of period 2N. Proposition If the colored Jones polynomial of a knot satisfies these two assumptions then log (f N (e 2πi/N )) b = lim. N N If this is a knot for which the Hyperbolic Volume Conjecture holds, b = vol(s 3 \K). 2π Katie Walsh Hall Patterns and Higher Order Stability 20 / 68
23 Further Analysis on the Coefficients of the Figure 8 Knot Katie Walsh Hall Patterns and Higher Order Stability 21 / 68
24 0 semi-(un)normalized colored Jones polynomial:sjn,k (q) = {N}JN,K (q). 0 ±JN,K (q){1} = sjn,k (q) = JN,K (q){n} Katie Walsh Hall Patterns and Higher Order Stability 22 / 68
25 0 semi-(un)normalized colored Jones polynomial:sjn,k (q) = {N}JN,K (q). 0 ±JN,K (q){1} = sjn,k (q) = JN,K (q){n} Figure: The coefficients of the 95 colored semi-(un)normalized Jones polynomial of the figure 8 knot. Katie Walsh Hall Patterns and Higher Order Stability 22 / 68
26 Figure: The middle 3000 coefficients of the sj95,41 (q) Figure: The middle 2000 coefficients of the sj95,41 (q). Katie Walsh Hall Patterns and Higher Order Stability 23 / 68
27 Figure: The middle 1000 coefficients of the sj95,41 (q) Figure: The middle 400 coefficients of the sj95,41 (q). Katie Walsh Hall Patterns and Higher Order Stability 24 / 68
28 Conjecture Let c(q i ) be the coefficient of the q i term of sj N,41 (q). When N is odd, c(q i ) = When N is even, c(q i ) = { ±1 i = ±N/2 or ± 3N/2 0 i < 2N 1/2 and i ±N/2 or ± 3N/2 { ±1 i = ±N or ± 3N/2 0 i < 2N and i ±N or ± 3N/ Figure: The middle Katie Walsh 400 Hallcoefficients Patterns and ofhigher the Order sj 95,41 Stability (q). 25 / 68
29 Head and Tail Stabilty In 2006, Dasbach and Lin conjectured that the first and last coefficients of the colored Jones polynomial stabilize for alternating knots. In 2011, Armond proved this for alternating links and for adequate links, using skein theoretical techniques. The head and tail do not exist for all knots, however. Armond and Dasbach showed that the head and tail does not exist for the (4, 3) torus knot. It was also independently proven by Garoufalidis and Lê. In fact, they proved a stronger version of this stability. Katie Walsh Hall Patterns and Higher Order Stability 26 / 68
30 Definition The head of the Colored Jones Polynomial of a knot K - if it exists - is a polynomial whose first N terms (highest powers of q) have the same coefficients as the first N terms of J N,K. Definition The tail of the Colored Jones Polynomial of a knot K - if it exists - is a polynomial whose last N terms (lowest powers of q) have the same coefficients as the last N terms of J N,K. Katie Walsh Hall Patterns and Higher Order Stability 27 / 68
31 N Highest Terms of the Colored Jones Polynomial of q 2 q + 1 q 1 + q 2 3 q 6 q 5 q 4 + 2q 3 q 2 q + 3 q 1 q q 12 q 11 q 10 +0q 9 + 2q 8 2q 6 + 3q 4 3q q 20 q 19 q 18 +0q 17 +0q q 15 q 14 q q 30 q 29 q 28 +0q 27 +0q 26 +q q q q 42 q 41 q 40 +0q 39 +0q 38 +q 37 +0q q q 56 q 55 q 54 +0q 53 +0q 52 +q 51 +0q 50 +q 49 + Katie Walsh Hall Patterns and Higher Order Stability 28 / 68
32 The Head of the Colored Jones Polynomial of 4 1 J N,4 1 (q) = N 1 n=0 k=1 n q N q k q k + q N The max degree of each summand is Nn so decreasing the n by 1 changes the max degree by N thus only n = N 1 contributes to the head and tail. J N,4 1 (q) reindex:k = N k HT = HT = N 1 k=1 N 1 k=1 N 1 = q N q N q k q k + q N q N q k k=1 1 q k N Katie Walsh Hall N 1 Patterns and Higher Order Stability 29 / 68
33 J N,4 1 (q) HT = N 1 k =1 (1 q k ) Theorem (Euler s Pentagonal Number Theorem) (1 x n ) = n=1 k= ( 1) k x k(3k 1)/2 = 1 x x 2 + x 5 + x 7 x 12 x 15 + A similar arguments shows that the head of twists knots is the same polynomial. Katie Walsh Hall Patterns and Higher Order Stability 30 / 68
34 Theorem (Armond) The head and tail of the colored Jones polynomial exist for alternating and adequate links. Theorem (Armond and Dasbach) The tail and head of the colored Jones polynomial of adequate links only depend on a certain reduced checkerboard graph of a diagram of the link. Katie Walsh Hall Patterns and Higher Order Stability 31 / 68
35 Figure: The Knot 6 2 Katie Walsh Hall Patterns and Higher Order Stability 32 / 68
36 Figure: The Knot 6 2 with a checkerboard coloring Katie Walsh Hall Patterns and Higher Order Stability 33 / 68
37 Figure: The Knot 6 2 with one of its associated graph Katie Walsh Hall Patterns and Higher Order Stability 34 / 68
38 Figure: The Knot 6 2 with the other associated graph Katie Walsh Hall Patterns and Higher Order Stability 35 / 68
39 Knot Knot Diagram White Checkerboard Graph Black Checkerboard Graph Tail Head 3_1 1 h 3 4_1 h 3 h 3 5_1 h 5 1 5_2 h 3 * h 4 6_2 h 3 * h 3 h 4 7_4 h 3 (h 4 ) 2 7_7 (h 3 ) 2 (h 3 ) 3 8_5 h 3??? h b (q) = ( 1) n q bn(n+1)/2 n n Z h b (q) = n Z ɛ(n)q bn(n+1)/2 n Katie Walsh Hall Patterns and Higher Order Stability 36 / 68
40 Definition (Garoufalidis and Lê) A sequence (f n (q)) Z[[q]] is k-stable if there exist Φ j (q) Z((q)) for j = 0,..., k such that k lim f n (q) Φ j (q)q j(n+1) = 0. n q k(n+1) We call Φ k (q) the k-limit of (f n (q)). We say that (f n (q)) is stable if it is k-stable for all k. j=0 For example, a sequence (f n (q)) is 2-stable if ( ( )) lim n q 2(n+1) f n (q) Φ 0 (q) + q (n+1) Φ 1 (q) + q 2(n+1) Φ 2 (q) = 0. Katie Walsh Hall Patterns and Higher Order Stability 37 / 68
41 For the knot 8 5 : Φ 0 = (1 q n ) = ( 1) k q k 2 (3k 1). n=1 k= Φ N = N = N = Katie Walsh Hall Patterns and Higher Order Stability 38 / 68
42 Φ N = N = N = Now, since we know all of Φ 0, we can subtract it from the shifted colored Jones polynomials. Now are coefficients are: Φ N = N = N = Katie Walsh Hall Patterns and Higher Order Stability 39 / 68
43 Φ N = N = N = Shifting these sequences back so that they start with a non-zero term, we can see that they again stabilize. The sequence they stabilize to is Φ 1. Φ N = N = N = Katie Walsh Hall Patterns and Higher Order Stability 40 / 68
44 Φ N = N = N = Subtracting and shifting these sequences back so that they start with a non-zero term, we can see that they again stabilize. The sequence they stabilize to is Φ 2. Φ N = N = N = Katie Walsh Hall Patterns and Higher Order Stability 41 / 68
45 Theorem (Garoufalidis and Lê) For every alternating link K, the sequence f N (q) = ( ˆ J N+1,K (q)) is stable and its associated k-limit Φ K,k (q) can be effectively computed from any reduced alternating diagram D of K. Katie Walsh Hall Patterns and Higher Order Stability 42 / 68
46 A k + 1-stable sequence satisfies: k+1 lim J N+1,K (q) q j(n+1) Φ j (q) = 0. N q (k+1)(n+1) j=0 The first k(n + 1) coefficients of J N+1,K (q) match k j=0 qj(n+1) Φ j for large enough N. This does not guarantee this property from the beginning. Katie Walsh Hall Patterns and Higher Order Stability 43 / 68
47 Order 1st Order Stabilization of Coefficients Which knots stabilize to the same sequence? What do they stablize to? Higher Order adequate links? for alternating links in some cases? Katie Walsh Hall Patterns and Higher Order Stability 44 / 68
48 Corollary Let m be the minimum number of parallel edges in a diagram. In addition to the first N + 1 terms only depending on the overall graph structure, the next (m 1)N terms also depend only on the graph structure. Corollary To find Φ k, we can consider the graph diagram reduced so that multiples edges with multiplicity greater than k are reduced to k multiple edges. Katie Walsh Hall Patterns and Higher Order Stability 45 / 68
49 Order 1st Order Stabilization of Coefficients Which knots stabilize to the same sequence? What do they stablize to? Higher Order adequate links in some cases for alternating links? Katie Walsh Hall Patterns and Higher Order Stability 46 / 68
50 m 1 m 2 m 3 Figure: A knot with its checkerboard graph. Katie Walsh Hall Patterns and Higher Order Stability 47 / 68
51 J N+1,K (q) = m 1 m 2 m 3 = N 3 j i =0 i=1 2ji θ(n, N, 2j i ) m 1 m 2 m3 2 j1 2 j2 2 j3 = N j i =0 i=1 3 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) 2j1 2j2 2j3 = N j i =0 i=1 3 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) Γ N,(j 1,j 2,j 3 ) Katie Walsh Hall Patterns and Higher Order Stability 48 / 68
52 Fusion a b n = = c n c θ(a, b, c) a c a b b (1) = ( 1) n [n + 1] (2) where [n] = {n} {1}, {n} = A2n A 2n and A 4 = a 2 = q. (3) Katie Walsh Hall Patterns and Higher Order Stability 49 / 68
53 Fusion a b = c c θ(a, b, c) a b c a b (4) Assume (a, b, c) is an admissible triple, then let i, j, k be the internal colors, in particular i = (b + c a)/2 j = (a + c b)/2 k = (a + b c)/2. (5) θ(a, b, c) = a b c i+j+k [i + j + k + 1]![i]![j]![k]! = ( 1). (6) [i + j]![j + k]![i + k]! Katie Walsh Hall Patterns and Higher Order Stability 50 / 68
54 J N+1,K (q) = m 1 m 2 m 3 = N 3 j i =0 i=1 2ji θ(n, N, 2j i ) m 1 m 2 m3 2 j1 2 j2 2 j3 = N j i =0 i=1 3 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) 2j1 2j2 2j3 = N j i =0 i=1 3 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) Γ N,(j 1,j 2,j 3 ) Katie Walsh Hall Patterns and Higher Order Stability 51 / 68
55 Twist Coefficients with b a b c = γ(a, b, c) a c (7) γ(a, b, c) = ( 1) a+b c 2 A a+b c+ a2 +b 2 c 2 2. (8) Katie Walsh Hall Patterns and Higher Order Stability 52 / 68
56 J N+1,K (q) = m 1 m 2 m 3 = N 3 j i =0 i=1 2ji θ(n, N, 2j i ) m 1 m 2 m3 2 j1 2 j2 2 j3 = N j i =0 i=1 3 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) 2j1 2j2 2j3 = N j i =0 i=1 3 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) Γ N,(j 1,j 2,j 3 ) Katie Walsh Hall Patterns and Higher Order Stability 53 / 68
57 m-reduced graph Corollary Proof Label edge sets with m or more parallel edges 1 through b. J N+1,K = N j 1,...j k =0 i=1 k γ(n, N, 2j i ) m i (m+1)n = γ(n, N, 2N) b i=1 m i N k j b+1,...,j k =0 i=b+1 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) Γ N,(j 1,...,j k ) k i=1 2ji θ(n, N, 2j i ) Γ N,(N,...,N,j b+1,...,j k Again, since γ(n, N, 2N) only contributes an overall shift, we get the same highest (m + 1)N coefficients regardless of the values of m 1,..., m b and thus knots with the same m + 1-reduced graph structure have the same highest (m + 1)N coefficients. (9) Katie Walsh Hall Patterns and Higher Order Stability 54 / 68
58 J N+1,K (q) = N j i =0 i=1 3 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) Γ N,(j 1,j 2,j 3 ) What terms contribute to the first 2N + 1 coefficients? Katie Walsh Hall Patterns and Higher Order Stability 55 / 68
59 J N+1,K (q) = N j i =0 i=1 3 γ(n, N, 2j i ) m i 2ji θ(n, N, 2j i ) Γ N,(j 1,j 2,j 3 ) What terms contribute to the first 2N + 1 coefficients? either all j i = N or exactly one j i = N 1 and the rest are N Katie Walsh Hall Patterns and Higher Order Stability 55 / 68
60 In the case where each m i is greater than 2, the maximum degree decreases by more than 2N when we decrease j i from N to N 1, thus we only need to deal with the case where each j i = N. Thus we get J N+1,K (q) = 2N+1 = N j i =0 i=1 3 γ(n, N, 2j i ) m i 3 γ(n, N, 2N) m i i=1 = γ(n, N, 2N) m 1+m 2 +m 3 ( = 2N+1 = = ( 1){N}! 3 {N}! 2 ( 1 2q N 1 1 q 1 ) {1} ( 1){N}! ( ). 1 2q N 1 {1} 1 q 1 2ji θ(n, N, 2j i ) Γ N,(j 1,j 2,j 3 ) 2N θ(n, N, 2N) Γ N,(N,N,N) 2N θ(n, N, 2N) ) 3 ( ) ΓN,(N,N,N) Katie Walsh Hall Patterns and Higher Order Stability 56 / 68
61 J N+1,K (q) stabilized head 2N+1 ( ( ) = ( 1) N {N}! 1 + 2q N 1 + q N 1 1 q 1 ) (1 ) q N 1 1 q 1 ) = ( 1) N {N}! (q N 1 + 3q N 1 1 q ( 1 = ( 1) N q N 1 {N}! + 3{N}! ) 1 q 1 = N (1 q i ) + 3 N i=1 (1 q i ) 1 q 1. i=1 Katie Walsh Hall Patterns and Higher Order Stability 57 / 68
62 2N When an m i is 1, we do get a term with j i = N 1. Need to consider the graph Γ(N + 1, N 1, N 1) and its evaluation. N 1 N-1 N-1 N 1 N N 2N N N Katie Walsh Hall Patterns and Higher Order Stability 58 / 68
63 2N 2N N 1 N-1 N-1 N 1 N N 2N N N 1 N-1 1 N-1 N-1 N-1 1 N-1 1 N-1 2N N Γ N,(N 1,N,N) = Γ(N + 1, N 1, N 1)). N Katie Walsh Hall Patterns and Higher Order Stability 59 / 68
64 Theorem (KPWH) Let m be the number edges in the checkerboard graph with m i of 2 or more. The tailneck of knots whose reduced checkboard graph is the triangle graph is: n=1 (1 q n n=1 ) + m (1 qn ), 1 q i.e. the pentagonal numbers plus the m times the partial sum of the pentagonal numbers. Katie Walsh Hall Patterns and Higher Order Stability 60 / 68
65 Oliver Dasbach suggested the following: Redefine the neck and tail neck by subtracting consecutive terms in sequence, shifted so that they have the same minimum degree. This gives us a simpler expression for the higher order stable pieces. Katie Walsh Hall Patterns and Higher Order Stability 61 / 68
66 Oliver Dasbach suggested the following: Redefine the neck and tail neck by subtracting consecutive terms in sequence, shifted so that they have the same minimum degree. Corollary This gives us a simpler expression for the higher order stable pieces. Again, let m be the number edges in the checkerboard graph with m i of 2 or more. Then we have J N,K q J N+1,K N = (1 + m q) (1 q n ). n=1 Katie Walsh Hall Patterns and Higher Order Stability 61 / 68
67 If we want the first 3N + 1 terms, which terms in the sum contribute? Labeling (up to permutation) Increase in min degree from (N, N, N) (N, N, N) 0 (N, N, N 1) at least N + 1 (N, N, N 2) at least 2N + 1 (N, N 1, N 1) at least 2N + 2 (N, N, N 3) at least 3N 1 (N, N 1, N 2) at least 3N + 1 (N 1, N 1, N 1) at least 3N + 3 Katie Walsh Hall Patterns and Higher Order Stability 62 / 68
68 2N The Graph Γ N,(N,N 1,N 1) N N 1 N-1 N-1 1 N N 2N N N 1 N-1 1 N We can absorb the smaller idempotents into the larger ones and combine adjoining ones. N 1 N-1 N-1 N-1 1 N-1 N-1 1 N-1 Katie Walsh Hall Patterns and Higher Order Stability 63 / 68
69 2N We resolve the remaining N idempotents ( but ) only one of the terms is N 2 non-zero. We get a factor of N 1 from each resolution. N-1 1 N-1 N-2 N-2 N-1 N N-1 2N N-1 We can then absorb the remaining N 1 idempotents. N-2 1 N-1 N-1 The evaluation of Γ N,(N,N 1,N 1) = ( N 2 N 1 ) 2 Γ(N, N, N 2). Katie Walsh Hall Patterns and Higher Order Stability 64 / 68
70 Let s look at the next stable sequence for these knots: q (2N+2) (q(ĵ N,K Ĵ N+1,K ) (Ĵ N+1,K Ĵ N+2,K ))/ (1 q i ) i=1 Katie Walsh Hall Patterns and Higher Order Stability 65 / 68
71 Values of (m 1, m 2, m 3 ) T1 T2 : 1 q q2 q 3 q 4 (up to permutation) (1, 1, 1) 1 q (1, 1, 2) 2 q (1, 1, 3 + ) 2 q (1, 2, 2) 3 q (1, 2, 3 + ) 3 q (1, 3 +, 3 + ) 3 q (2, 2, 2) 4 q (2, 2, 3 + ) 4 q (2, 3 +, 3 + ) 4 q (3 +, 3 +, 3 + ) 4 q Katie Walsh Hall Patterns and Higher Order Stability 66 / 68
72 Question What information is contained these coefficients? Katie Walsh Hall Patterns and Higher Order Stability 67 / 68
73 Question What information is contained these coefficients? More questions: Can we prove that these are the stable sequences? Can we get a geometric proof of stability for all knots? What does the stable sequence look like for other families of knots or for even higher stability? Can these sequences help us understand the middle coefficients? Katie Walsh Hall Patterns and Higher Order Stability 67 / 68
74 Any Questions?
Patterns and Stability in the Coefficients of the Colored Jones Polynomial. Katie Walsh Advisor: Justin Roberts
5000 10 000 15 000 3 10 12 2 10 12 1 10 12 Patterns and Stability in the Coefficients of the Colored Jones Polynomial 1 10 12 2 10 12 Advisor: Justin Roberts 3 10 12 The Middle Coefficients of the Colored
More informationResearch Statement Katherine Walsh October 2013
My research is in the area of topology, specifically in knot theory. The bulk of my research has been on the patterns in the coefficients of the colored Jones polynomial. The colored Jones polynomial,j
More informationAdvancement to Candidacy. Patterns in the Coefficients of the Colored Jones Polynomial. Katie Walsh Advisor: Justin Roberts
5000 10 000 15 000 3 10 12 2 10 12 1 10 12 Patterns in the Coefficients of the Colored Jones Polynomial 1 10 12 Advisor: Justin Roberts 2 10 12 3 10 12 Introduction Knots and Knot Invariants The Jones
More informationJones polynomials and incompressible surfaces
Jones polynomials and incompressible surfaces joint with D. Futer and J. Purcell Geometric Topology in Cortona (in honor of Riccardo Benedetti for his 60th birthday), Cortona, Italy, June 3-7, 2013 David
More informationA JONES SLOPES CHARACTERIZATION OF ADEQUATE KNOTS
A JONES SLOPES CHARACTERIZATION OF ADEQUATE KNOTS EFSTRATIA KALFAGIANNI Abstract. We establish a characterization of adequate knots in terms of the degree of their colored Jones polynomial. We show that,
More informationGeneralised Rogers Ramanujan identities and arithmetics. Ole Warnaar School of Mathematics and Physics
Generalised Rogers Ramanujan identities and arithmetics Ole Warnaar School of Mathematics and Physics Based on joint work with Nick Bartlett Michael Griffin Ken Ono Eric Rains History and motivation The
More informationDENSITY SPECTRA FOR KNOTS. In celebration of Józef Przytycki s 60th birthday
DENSITY SPECTRA FOR KNOTS ABHIJIT CHAMPANERKAR, ILYA KOFMAN, AND JESSICA S. PURCELL Abstract. We recently discovered a relationship between the volume density spectrum and the determinant density spectrum
More informationGeometric structures of 3-manifolds and quantum invariants
Geometric structures of 3-manifolds and quantum invariants Effie Kalfagianni Michigan State University ETH/Zurich, EKPA/Athens, APTH/Thessalonikh, June 2017 Effie Kalfagianni (MSU) J 1 / 21 Settings and
More informationRESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES RIMS The state sum invariant of 3-manifolds constructed from the E 6 linear skein.
RIMS-1776 The state sum invariant of 3-manifolds constructed from the E 6 linear skein By Kenta OKAZAKI March 2013 RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES KYOTO UNIVERSITY, Kyoto, Japan THE STATE
More informationInvariants of Turaev genus one links
Invariants of Turaev genus one links Adam Lowrance - Vassar College Oliver Dasbach - Louisiana State University March 9, 2017 Philosophy 1 Start with a family of links F and a link invariant Inv(L). 2
More informationTwist Numbers of Links from the Jones Polynomial
Twist Numbers of Links from the Jones Polynomial Mathew Williamson August 26, 2005 Abstract A theorem of Dasbach and Lin s states that the twist number of any alternating knot is the sum of the absolute
More informationTHE SLOPE CONJECTURE FOR MONTESINOS KNOTS
THE SLOPE CONJECTURE FOR MONTESINOS KNOTS STAVROS GAROUFALIDIS, CHRISTINE RUEY SHAN LEE, AND ROLAND VAN DER VEEN Abstract. The Slope Conjecture relates the degree of the colored Jones polynomial of a knot
More informationA NOTE ON QUANTUM 3-MANIFOLD INVARIANTS AND HYPERBOLIC VOLUME
A NOTE ON QUANTUM 3-MANIFOLD INVARIANTS AND HYPERBOLIC VOLUME EFSTRATIA KALFAGIANNI Abstract. For a closed, oriented 3-manifold M and an integer r > 0, let τ r(m) denote the SU(2) Reshetikhin-Turaev-Witten
More informationHomological representation formula of some quantum sl 2 invariants
Homological representation formula of some quantum sl 2 invariants Tetsuya Ito (RIMS) 2015 Jul 20 First Encounter to Quantum Topology: School and Workshop Tetsuya Ito (RIMS) Homological representation
More informationCompare the growth rate of functions
Compare the growth rate of functions We have two algorithms A 1 and A 2 for solving the same problem, with runtime functions T 1 (n) and T 2 (n), respectively. Which algorithm is more efficient? We compare
More informationSuper-A-polynomials of Twist Knots
Super-A-polynomials of Twist Knots joint work with Ramadevi and Zodinmawia to appear soon Satoshi Nawata Perimeter Institute for Theoretical Physics Aug 28 2012 Satoshi Nawata (Perimeter) Super-A-poly
More informationHyperbolic Knots and the Volume Conjecture II: Khov. II: Khovanov Homology
Hyperbolic Knots and the Volume Conjecture II: Khovanov Homology Mathematics REU at Rutgers University 2013 July 19 Advisor: Professor Feng Luo, Department of Mathematics, Rutgers University Overview 1
More informationThe geometry of cluster algebras
The geometry of cluster algebras Greg Muller February 17, 2013 Cluster algebras (the idea) A cluster algebra is a commutative ring generated by distinguished elements called cluster variables. The set
More informationOn the Visibility of Achirality of Alternating Knots
University of Geneva August 22nd, 2014 Busan, Korea Definition A knot K S 3 is achiral there is an orientation reversing diffeomorphism φ of S 3 s.t. φ(k) = K, φ is a mirror diffeomorphism of K When orienting
More informationAsymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shapes, and column strict arrays
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8:, 06, #6 arxiv:50.0890v4 [math.co] 6 May 06 Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More informationOptimistic limits of the colored Jones polynomials
Optimistic limits of the colored Jones polynomials Jinseok Cho and Jun Murakami arxiv:1009.3137v9 [math.gt] 9 Apr 2013 October 31, 2018 Abstract We show that the optimistic limits of the colored Jones
More informationA Generalization of Wigner s Law
A Generalization of Wigner s Law Inna Zakharevich June 2, 2005 Abstract We present a generalization of Wigner s semicircle law: we consider a sequence of probability distributions (p, p 2,... ), with mean
More informationPolynomials in knot theory. Rama Mishra. January 10, 2012
January 10, 2012 Knots in the real world The fact that you can tie your shoelaces in several ways has inspired mathematicians to develop a deep subject known as knot theory. mathematicians treat knots
More informationTHE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours
THE 018-019 KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: hours 1 Let m be a three-digit integer with distinct digits Find all such integers
More informationThe Three-Variable Bracket Polynomial for Reduced, Alternating Links
Rose-Hulman Undergraduate Mathematics Journal Volume 14 Issue 2 Article 7 The Three-Variable Bracket Polynomial for Reduced, Alternating Links Kelsey Lafferty Wheaton College, Wheaton, IL, kelsey.lafferty@my.wheaton.edu
More informationANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM
q-hypergeometric PROOFS OF POLYNOMIAL ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM S OLE WARNAAR Abstract We present alternative, q-hypergeometric
More informationThe Satellite crossing number conjecture for cables of knots
The Satellite crossing number conjecture for cables of knots Alexander Stoimenow Department of Mathematical Sciences, KAIST April 25, 2009 KMS Meeting Aju University Contents Crossing number Satellites
More information5. Vector Algebra and Spherical Trigonometry (continued)
MA232A Euclidean and Non-Euclidean Geometry School of Mathematics, Trinity College Michaelmas Term 2017 Section 5: Vector Algebra and Spherical Trigonometry David R. Wilkins 5.1. Vectors in Three-Dimensional
More informationQuasi-Trees and Khovanov homology
Quasi-Trees and Khovanov homology Abhijit Champanerkar 1, Ilya Kofman, Neal Stoltzfus 3 1 U. South Alabama CUNY, Staten Island 3 Louisiana State University Virtual Topology Seminar: LSU & Iowa Outline
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationOn the growth of Turaev-Viro 3-manifold invariants
On the growth of Turaev-Viro 3-manifold invariants E. Kalfagianni (based on work w. R. Detcherry and T. Yang) Michigan State University Redbud Topology Conference, OSU, April 018 E. Kalfagianni (MSU) J
More informationPacking nearly optimal Ramsey R(3, t) graphs
Packing nearly optimal Ramsey R(3, t) graphs He Guo Joint work with Lutz Warnke Context of this talk Ramsey number R(s, t) R(s, t) := minimum n N such that every red/blue edge-coloring of complete n-vertex
More informationarxiv: v1 [math.gm] 1 Oct 2015
A WINDOW TO THE CONVERGENCE OF A COLLATZ SEQUENCE arxiv:1510.0174v1 [math.gm] 1 Oct 015 Maya Mohsin Ahmed maya.ahmed@gmail.com Accepted: Abstract In this article, we reduce the unsolved problem of convergence
More informationOn the Mahler measure of Jones polynomials under twisting
On the Mahler measure of Jones polynomials under twisting Abhijit Champanerkar Department of Mathematics, Barnard College, Columbia University Ilya Kofman Department of Mathematics, Columbia University
More informationEuler s partition theorem and the combinatorics of l-sequences
Euler s partition theorem and the combinatorics of l-sequences Carla D. Savage North Carolina State University June 26, 2008 Inspiration BME1 Mireille Bousquet-Mélou, and Kimmo Eriksson, Lecture hall partitions,
More informationTHE BAILEY TRANSFORM AND CONJUGATE BAILEY PAIRS
The Pennsylvania State University The Graduate School Department of Mathematics THE BAILEY TRANSFORM AND CONJUGATE BAILEY PAIRS A Thesis in Mathematics by Michael J. Rowell c 2007 Michael J. Rowell Submitted
More informationNEW IDENTITIES INVOLVING SUMS OF THE TAILS RELATED TO REAL QUADRATIC FIELDS KATHRIN BRINGMANN AND BEN KANE
NEW IDENTITIES INVOLVING SUMS OF THE TAILS RELATED TO REAL QUADRATIC FIELDS KATHRIN BRINGMANN AND BEN KANE To George Andrews, who has been a great inspiration, on the occasion of his 70th birthday Abstract.
More informationA NOTE ON E 8 -INTERSECTION FORMS AND CORRECTION TERMS
A NOTE ON E 8 -INTERSECTION FORMS AND CORRECTION TERMS MOTOO TANGE Abstract. In this paper we construct families of homology spheres which bound 4-manifolds with intersection forms isomorphic to E 8. We
More informationAN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* DENNIS STANTON
AN ELEMENTARY APPROACH TO THE MACDONALD IDENTITIES* DENNIS STANTON Abstract. Elementary proofs are given for the infinite families of Macdonald identities. The reflections of the Weyl group provide sign-reversing
More informationNumber Theory: Niven Numbers, Factorial Triangle, and Erdos' Conjecture
Sacred Heart University DigitalCommons@SHU Mathematics Undergraduate Publications Mathematics -2018 Number Theory: Niven Numbers, Factorial Triangle, and Erdos' Conjecture Sarah Riccio Sacred Heart University,
More informationNetwork Augmentation and the Multigraph Conjecture
Network Augmentation and the Multigraph Conjecture Nathan Kahl Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 e-mail: nkahl@stevens-tech.edu Abstract Let Γ(n, m)
More informationarxiv: v1 [math.gt] 2 Jun 2016
CONVERTING VIRTUAL LINK DIAGRAMS TO NORMAL ONES NAOKO KAMADA arxiv:1606.00667v1 [math.gt] 2 Jun 2016 Abstract. A virtual link diagram is called normal if the associated abstract link diagram is checkerboard
More informationarxiv: v4 [math.gt] 23 Mar 2018
NORMAL AND JONES SURFACES OF KNOTS EFSTRATIA KALFAGIANNI AND CHRISTINE RUEY SHAN LEE arxiv:1702.06466v4 [math.gt] 23 Mar 2018 Abstract. We describe a normal surface algorithm that decides whether a knot,
More informationKnots, computers, conjectures. Slavik Jablan
Knots, computers, conjectures Slavik Jablan Hyperbolic volumes Family p q (joint work with Lj. Radovic) Hyperbolic volumes Family of Lorenz knots 6*-(2p+1).(2q).-2.2.-2 Adequacy: markers and state diagrams
More informationLecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete
More informationContents. D. R. Wilkins. Copyright c David R. Wilkins
MA232A Euclidean and Non-Euclidean Geometry School of Mathematics, Trinity College Michaelmas Term 2017 Section 5: Vector Algebra and Spherical Trigonometry D. R. Wilkins Copyright c David R. Wilkins 2015
More informationIndex Notation for Vector Calculus
Index Notation for Vector Calculus by Ilan Ben-Yaacov and Francesc Roig Copyright c 2006 Index notation, also commonly known as subscript notation or tensor notation, is an extremely useful tool for performing
More information20 The modular equation
18.783 Elliptic Curves Spring 2015 Lecture #20 04/23/2015 20 The modular equation In the previous lecture we defined modular curves as quotients of the extended upper half plane under the action of a congruence
More informationarxiv: v2 [math.gt] 2 Mar 2015
THE AJ CONJECTURE FOR CABLES OF TWO-BRIDGE KNOTS NATHAN DRUIVENGA arxiv:14121053v2 [mathgt] 2 Mar 2015 Abstract The AJ-conjecture for a knot K S 3 relates the A-polynomial and the colored Jones polynomial
More informationLOWELL. MICHIGAN, THURSDAY, AUGUST 16, Specialty Co. Sells to Hudson Mfg. Company. Ada Farmer Dies When Boat Tips
K N» N - K V XXXV - N 22 N 5 V N N q N 0 " " - x Q- & V N -" Q" 24-?? 2530 35-6 9025 - - K ; ) ) ( _) ) N K : ; N - K K ) q ( K N ( x- 89830 z 7 K $2000 ( - N " " K : K 89335 30 4 V N
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationAlexander polynomial, finite type invariants and volume of hyperbolic knots
ISSN 1472-2739 (on-line) 1472-2747 (printed) 1111 Algebraic & Geometric Topology Volume 4 (2004) 1111 1123 Published: 25 November 2004 ATG Alexander polynomial, finite type invariants and volume of hyperbolic
More informationConsider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes?
1 Section 4.1 Mathematical Induction Consider an infinite row of dominoes, labeled by 1,, 3,, where each domino is standing up. What should one do to knock over all dominoes? Principle of Mathematical
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationTotal Linking Numbers of Torus Links and Klein Links
Rose- Hulman Undergraduate Mathematics Journal Total Linking Numbers of Torus Links and Klein Links Michael A Bush a Katelyn R French b Joseph R H Smith c Volume, Sponsored by Rose-Hulman Institute of
More informationLaura Chihara* and Dennis Stanton**
ZEROS OF GENERALIZED KRAWTCHOUK POLYNOMIALS Laura Chihara* and Dennis Stanton** Abstract. The zeros of generalized Krawtchouk polynomials are studied. Some interlacing theorems for the zeros are given.
More informationProof by Induction. Andreas Klappenecker
Proof by Induction Andreas Klappenecker 1 Motivation Induction is an axiom which allows us to prove that certain properties are true for all positive integers (or for all nonnegative integers, or all integers
More information9.4. Mathematical Induction. Introduction. What you should learn. Why you should learn it
333202_090.qxd 2/5/05 :35 AM Page 73 Section 9. Mathematical Induction 73 9. Mathematical Induction What you should learn Use mathematical induction to prove statements involving a positive integer n.
More informationarxiv: v2 [math.gt] 27 Mar 2009
ODD KHOVANOV HOMOLOGY IS MUTATION INVARIANT JONATHAN M. BLOOM arxiv:0903.3746v2 [math.gt] 27 Mar 2009 Abstract. We define a link homology theory that is readily seen to be both isomorphic to reduced odd
More informationRelationships between Braid Length and the Number of Braid Strands
The University of San Francisco USF Scholarship: a digital repository @ Gleeson Library Geschke Center Mathematics College of Arts and Sciences 2007 Relationships between Braid Length and the Number of
More informationEvaluation of sl N -foams. Workshop on Quantum Topology Lille
Evaluation of sl N -foams Louis-Hadrien Robert Emmanuel Wagner Workshop on Quantum Topology Lille a b a a + b b a + b b + c c a a + b + c a b a a + b b a + b b + c c a a + b + c Definition (R. Wagner,
More informationChapter 8 Vectors and Scalars
Chapter 8 193 Vectors and Scalars Chapter 8 Vectors and Scalars 8.1 Introduction: In this chapter we shall use the ideas of the plane to develop a new mathematical concept, vector. If you have studied
More informationVirtual Crossing Number and the Arrow Polynomial
arxiv:0810.3858v3 [math.gt] 24 Feb 2009 Virtual Crossing Number and the Arrow Polynomial H. A. Dye McKendree University hadye@mckendree.edu Louis H. Kauffman University of Illinois at Chicago kauffman@uic.edu
More informationarxiv: v2 [math.nt] 9 Apr 2015
CONGRUENCES FOR PARTITION PAIRS WITH CONDITIONS arxiv:408506v2 mathnt 9 Apr 205 CHRIS JENNINGS-SHAFFER Abstract We prove congruences for the number of partition pairs π,π 2 such that π is nonempty, sπ
More informationUnmixed Graphs that are Domains
Unmixed Graphs that are Domains Bruno Benedetti Institut für Mathematik, MA 6-2 TU Berlin, Germany benedetti@math.tu-berlin.de Matteo Varbaro Dipartimento di Matematica Univ. degli Studi di Genova, Italy
More informationSum of Squares. Defining Functions. Closed-Form Expression for SQ(n)
CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 22: Induction Overview Recursion A programming strategy that solves a problem by reducing it to simpler
More informationGeometric Estimates from spanning surfaces of knots
Geometric Estimates from spanning surfaces of knots joint w/ Stephan Burton (MSU) Michigan State University Knots in Hellas, Olymbia, Greece, July 18, 2016 Burton-Kalfagianni (MSU) J 1 / 20 Knot complement:
More informationCounting Matrices Over a Finite Field With All Eigenvalues in the Field
Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu
More informationOrdering and Reordering: Using Heffter Arrays to Biembed Complete Graphs
University of Vermont ScholarWorks @ UVM Graduate College Dissertations and Theses Dissertations and Theses 2015 Ordering and Reordering: Using Heffter Arrays to Biembed Complete Graphs Amelia Mattern
More informationGenealogy of Pythagorean triangles
Chapter 0 Genealogy of Pythagorean triangles 0. Two ternary trees of rational numbers Consider the rational numbers in the open interval (0, ). Each of these is uniquely in the form q, for relatively prime
More informationDirchlet s Function and Limit and Continuity Arguments
Dirchlet s Function and Limit and Continuity Arguments James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 23, 2018 Outline 1 Dirichlet
More informationIntroduction to Decision Sciences Lecture 11
Introduction to Decision Sciences Lecture 11 Andrew Nobel October 24, 2017 Basics of Counting Product Rule Product Rule: Suppose that the elements of a collection S can be specified by a sequence of k
More informationTwo truncated identities of Gauss
Two truncated identities of Gauss Victor J W Guo 1 and Jiang Zeng 2 1 Department of Mathematics, East China Normal University, Shanghai 200062, People s Republic of China jwguo@mathecnueducn, http://mathecnueducn/~jwguo
More informationQuadruple Systems with Independent Neighborhoods
Quadruple Systems with Independent Neighborhoods Zoltan Füredi Dhruv Mubayi Oleg Pikhurko Abstract A -graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both
More informationFundamentally Different m-colorings of Pretzel Knots
Journal of Knot Theory and Its Ramifications c World Scientific Publishing Company Fundamentally Different m-colorings of Pretzel Knots KATHRYN BROWNELL Lenoir-Rhyne College, Department of Mathematics,
More informationMaximizing the descent statistic
Maximizing the descent statistic Richard EHRENBORG and Swapneel MAHAJAN Abstract For a subset S, let the descent statistic β(s) be the number of permutations that have descent set S. We study inequalities
More informationCongruence Properties of Partition Function
CHAPTER H Congruence Properties of Partition Function Congruence properties of p(n), the number of partitions of n, were first discovered by Ramanujan on examining the table of the first 200 values of
More informationKnots-quivers correspondence, lattice paths, and rational knots
Knots-quivers correspondence, lattice paths, and rational knots 1 CAMGSD, Departamento de Matemática, Instituto Superior Técnico, Portugal 2 Mathematical Institute SANU, Belgrade, Serbia Warszawa, September
More informationTORSION IN KHOVANOV LINK HOMOLOGY
TORSION IN KHOVANOV LINK HOMOLOGY Radmila Sazdanović NC State Summer School on Modern Knot Theory Freiburg 7 June 2017 TORSION IN KHOVANOV HOMOLOGY CONJECTURE (SHUMAKOVITCH) Let L be any prime link other
More informationOn links with cyclotomic Jones polynomials
On links with cyclotomic Jones polynomials Abhijit Champanerkar Department of Mathematics and Statistics University of South Alabama Ilya Kofman Department of Mathematics College of Staten Island, City
More informationApplications of Chromatic Polynomials Involving Stirling Numbers
Applications of Chromatic Polynomials Involving Stirling Numbers A. Mohr and T.D. Porter Department of Mathematics Southern Illinois University Carbondale, IL 6290 tporter@math.siu.edu June 23, 2008 The
More informationTHE FIRST POSITIVE RANK AND CRANK MOMENTS FOR OVERPARTITIONS
THE FIRST POSITIVE RANK AND CRANK MOMENTS FOR OVERPARTITIONS GEORGE ANDREWS, SONG HENG CHAN, BYUNGCHAN KIM, AND ROBERT OSBURN Abstract. In 2003, Atkin Garvan initiated the study of rank crank moments for
More informationSome Identities in the Twisted Group Algebra of Symmetric Groups
Some Identities in the Twisted Group Algebra of Symmetric Groups Milena Sošić Department of Mathematics University of Rijeka Radmile Matejčić 2, Rijeka 51000, Croatia msosic@math.uniri.hr August 8, 2013
More information= A + A 1. = ( A 2 A 2 ) 2 n 2. n = ( A 2 A 2 ) n 1. = ( A 2 A 2 ) n 1. We start with the skein relation for one crossing of the trefoil, which gives:
Solutions to sheet 4 Solution to exercise 1: We have seen in the lecture that the Kauffman bracket is invariant under Reidemeister move 2. In particular, we have chosen the values in the skein relation
More informationMA232A Euclidean and Non-Euclidean Geometry School of Mathematics, Trinity College Michaelmas Term 2017 Vector Algebra and Spherical Trigonometry
MA232A Euclidean and Non-Euclidean Geometry School of Mathematics, Trinity College Michaelmas Term 2017 Vector Algebra and Spherical Trigonometry David R. Wilkins 3.1. Vectors in Three-Dimensional Euclidean
More informationADEQUACY OF LINK FAMILIES. Slavik Jablan, Ljiljana Radović, and Radmila Sazdanović
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 88(102) (2010), 21 52 DOI: 10.2298/PIM1002021J ADEQUACY OF LINK FAMILIES Slavik Jablan, Ljiljana Radović, and Radmila Sazdanović Communicated
More informationIntrinsic geometry and the invariant trace field of hyperbolic 3-manifolds
Intrinsic geometry and the invariant trace field of hyperbolic 3-manifolds Anastasiia Tsvietkova University of California, Davis Joint with Walter Neumann, based on earlier joint work with Morwen Thistlethwaite
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationMORE ON KHOVANOV HOMOLOGY
MORE ON KHOVANOV HOMOLOGY Radmila Sazdanović NC State Summer School on Modern Knot Theory Freiburg 6 June 2017 WHERE WERE WE? Classification of knots- using knot invariants! Q How can we get better invariants?
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationSequences of Real Numbers
Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationKnot theory related to generalized and. cyclotomic Hecke algebras of type B. Soa Lambropoulou. Mathematisches Institut, Gottingen Universitat
Knot theory related to generalized and cyclotomic Hecke algebras of type B Soa Lambropoulou Mathematisches Institut, Gottingen Universitat Introduction After Jones's construction of the classical by now
More informationMATH 2030: EIGENVALUES AND EIGENVECTORS
MATH 2030: EIGENVALUES AND EIGENVECTORS Determinants Although we are introducing determinants in the context of matrices, the theory of determinants predates matrices by at least two hundred years Their
More informationOn the Shadow Geometries of W (23, 16)
On the of W (23, 16) Assaf Goldberger 1 Yossi Strassler 2 Giora Dula 3 1 School of Mathematical Sciences Tel-Aviv University 2 Dan Yishay 3 Department of Computer Science and Mathematics Netanya College
More informationarxiv: v1 [math.co] 8 Feb 2014
COMBINATORIAL STUDY OF THE DELLAC CONFIGURATIONS AND THE q-extended NORMALIZED MEDIAN GENOCCHI NUMBERS ANGE BIGENI arxiv:1402.1827v1 [math.co] 8 Feb 2014 Abstract. In two recent papers (Mathematical Research
More informationarxiv: v1 [math.gr] 2 Aug 2017
RANDOM GROUP COBORDISMS OF RANK 7 arxiv:1708.0091v1 [math.gr] 2 Aug 2017 SYLVAIN BARRÉ AND MIKAËL PICHOT Abstract. We construct a model of random groups of rank 7, and show that in this model the random
More informationCOMBINATORIAL PROOFS OF GENERATING FUNCTION IDENTITIES FOR F-PARTITIONS
COMBINATORIAL PROOFS OF GENERATING FUNCTION IDENTITIES FOR F-PARTITIONS AE JA YEE 1 Abstract In his memoir in 1984 George E Andrews introduces many general classes of Frobenius partitions (simply F-partitions)
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More information