© | Dror Bar-Natan: Classes: 2013-14: AKT: | < > |
width: 400 720 | ogg/AKT-140106_400.ogg | orig/AKT-140106.MOD |
Videography by Iva Halacheva | troubleshooting |
Notes on AKT-140106: [edit, refresh]
Course introduction, knots and Reidemeister moves, knot colourings.
# | Week of... | Notes and Links |
---|---|---|
1 | Jan 6 | About This Class (PDF). ![]() Tricolourability without Diagrams ![]() ![]() Friday Introduction (the quantum pendulum) |
2 | Jan 13 | Homework Assignment 1. ![]() ![]() ![]() |
3 | Jan 20 | Homework Assignment 2. ![]() ![]() ![]() Class Photo. |
4 | Jan 27 | Homework Assignment 3. ![]() ![]() ![]() ![]() |
5 | Feb 3 | Homework Assignment 4. ![]() The Fulton-MacPherson Compactification (PDF). ![]() ![]() ![]() ![]() |
6 | Feb 10 | Homework Assignment 5. ![]() ![]() ![]() |
R | Feb 17 | Reading Week. |
7 | Feb 24 | ![]() ![]() ![]() ![]() From Gaussian Integration to Feynman Diagrams (PDF). |
8 | Mar 3 | Homework Assignment 6 (PDF) ![]() ![]() ![]() Graph Cohomology and Configuration Space Integrals (PDF) ![]() Mar 9 is the last day to drop this class. |
9 | Mar 10 | Homework Assignment 7 (PDF) ![]() ![]() ![]() ![]() |
10 | Mar 17 | Homework Assignment 8 (PDF) ![]() ![]() ![]() ![]() Gaussian Integration, Determinants, Feynman Diagrams (PDF). |
11 | Mar 24 | Homework Assignment 9 (PDF) ![]() ![]() ![]() Friday: class cancelled. |
12 | Mar 31 | Monday, Wednesday: class cancelled. ![]() |
E | Apr 7 | ![]() |
![]() Add your name / see who's in! | ||
Dror's Notebook | ||
![]() |
Claim: The number of legal 3-colorings of a knot diagram is always a power of 3.
This is an expansion on the proof given by Przytycki (https://arxiv.org/abs/math/0608172).
We'll show that the set of legal 3-colorings forms a subgroup of
, for some r, which suffices to prove the claim. First, label each of the segments of the given diagram 1 through n, and denote a 3-coloring of this diagram by
, where each
is an element of the cyclic group of order 3
(each element representing a different colour). It is clear that
is a subset of
. To show it is a subgroup, we'll take
, and show that
. It suffices to restrict our attention to one crossing in the given diagram, so we can without loss of generality let n = 3.
First, we (sub)claim that a crossing (involving colours is legal if and only if
in
. Indeed, if the crossing is legal, either it is the trivial crossing in which case their product is clearly 1, or each
is distinct, in which case
. Conversely, suppose
, and suppose
. It suffices to show that
. This follows by case checking: if
, then
; if
, then
, implying that
; and if
, then
, implying that
. Thus, the subclaim is proven.
As a result, satisfies
since both
. This implies that
, and hence shows that
is a subgroup of
for n = the number of line segments in the diagram. By Lagrange's theorem, the number of legal 3-colorings (the order of
) is a power of 3.
(Note by User:Leo algknt):
Using linear Algebra: Idea from class on Wednesday 23 May, 2018
Let be a knot diagram for the knot
with
crossings. There are
arcs. Let
represent the arcs. Now let
. Define
by
,
so that
.
Then, with the above definition, we get a linear equation for each each of the
crossings, where
. Thus we get a system of
linear equation, from which we get a matrix
. The nullspace
of
is the solution to this system of equation and this is exactly the set of all 3-colourings of
. This is a vector space of size