\documentclass[11pt,notitlepage]{article}
\def\bare{n}
\usepackage[all]{xy}
\usepackage[english,greek]{babel}
\usepackage{dbnsymb, amsmath, graphicx, amssymb, multicol, stmaryrd, pifont,
  amscd, colortbl, mathtools, wasysym, needspace, import, longtable, overpic,
  enumitem, bbm, pdfpages, ../picins, array, setspace, datetime, multicol}
\usepackage[export]{adjustbox} % Follows https://tex.stackexchange.com/questions/6073/scale-resize-large-images-graphics-that-exceed-page-margins
\usepackage{tensor}
\usepackage{txfonts}	% for the likes of \coloneqq.
\usepackage{fontawesome} % for \faPlay
\usepackage[usenames,dvipsnames]{xcolor}
\usepackage{utfsym}	% for the likes of \car=\usym{1F697}
\usepackage{soul} % for strikeouts, \st.
\usepackage[textwidth=8.5in,textheight=11in,centering]{geometry}
\parindent 0in
\usepackage[makeroom]{cancel}

% Following http://tex.stackexchange.com/a/847/22475:
\usepackage[setpagesize=false]{hyperref}
\hypersetup{colorlinks,
  linkcolor={blue!50!black},
  citecolor={blue!50!black},
  urlcolor={blue!50!black}
}

% Following http://tex.stackexchange.com/questions/59340/how-to-highlight-an-entire-paragraph
\usepackage[framemethod=tikz]{mdframed}

\usepackage[T1]{fontenc}

\usepackage[]{qrcode}
\def\qurl#1{{\qrcode[height=1em,level=L,nolink]{#1}~\url{http://#1}}}

\def\myurl{http://www.math.toronto.edu/~drorbn}
\def\thistalk{CUMC-2606}
\def\title{Car Traffic on Knot Diagrams and Some Cool Knot Invariants}

\def\navigator{{
  \href{\myurl}{Dror Bar-Natan}:
  \href{\myurl/Talks}{Talks}:
  \href{\myurl/Talks/\thistalk/}{\thistalk}:
}}
\def\thanks{{Thanks for inviting me to the CUMC!}}
\def\webdef{{{\greektext web}$\coloneqq$\href{http://drorbn.net/cumc26}{http://drorbn.net/cumc26}}}
\def\web#1{{\href{\myurl/Talks/\thistalk/#1}{{\greektext web}/#1}}}
\def\titleA{{\title}}
\def\titleB{{\title}}
\def\titleC{{\title}}

\definecolor{mblue}{HTML}{E0E0FF}
\definecolor{mgray}{HTML}{B0B0B0}
\definecolor{morange}{HTML}{FFA50A}
\definecolor{mpink}{HTML}{FFE0E0}
\definecolor{myellow}{HTML}{FFFF00}
\def\blue{\color{blue}}
\def\gray{\color{gray}}
\def\mgray{\color{mgray}}
\def\morange{\color{morange}}
\def\pink{\color{pink}}
\def\magenta{\color{magenta}}
\def\red{\color{red}}
\def\yellowm#1{{\setlength{\fboxsep}{0pt}\colorbox{yellow}{$#1$}}}
\def\myellowm#1{{\setlength{\fboxsep}{0pt}\colorbox{myellow}{$#1$}}}
\def\mpinkm#1{{\setlength{\fboxsep}{0pt}\colorbox{mpink}{$#1$}}}
\def\mbluem#1{{\setlength{\fboxsep}{0pt}\colorbox{mblue}{$#1$}}}
\def\morangem#1{{\setlength{\fboxsep}{0pt}\colorbox{morange}{$#1$}}}
\def\cbox#1#2{{\setlength{\fboxsep}{0pt}\colorbox{#1}{#2}}}

\def\arXiv#1{{\href{http://arxiv.org/abs/#1}{{\tiny arXiv:}\linebreak[0]{#1}}}}

\def\qed{{\linebreak[1]\null\hfill\text{$\Box$}}}

\def\act{{\hspace{-1pt}\sslash\hspace{-0.75pt}}}
\def\ad{\operatorname{ad}}
\def\Ad{\operatorname{Ad}}
\def\aft{$\overrightarrow{\text{4T}}$}
\def\AS{\mathit{AS}}
\def\bbZZ{{\mathbb Z\mathbb Z}}
\def\CW{\text{\it CW}}
\def\diag{\operatorname{diag}}
\def\eps{\epsilon}
\def\FL{\text{\it FL}}
\def\Hom{\operatorname{Hom}}
\def\IHX{\mathit{IHX}}
\def\Kh{\text{\it Kh}}
\def\mor{\operatorname{mor}}
\def\PvT{{\mathit P\!v\!T}}
\def\remove{\!\setminus\!}
\def\STU{\mathit{STU}}
\def\SW{\text{\it SW}}
\def\TC{\mathit{TC}}
\def\tr{\operatorname{tr}}
\def\Vol{\text{\it Vol}}
\def\vT{{\mathit v\!T}}

\def\bara{{\bar a}}
\def\barb{{\bar b}}
\def\barT{{\bar T}}
\def\bbE{{\mathbb E}}
\def\bbe{\mathbbm{e}}
\def\bbH{{\mathbb H}}
\def\bbN{{\mathbb N}}
\def\bbO{{\mathbb O}}
\def\bbQ{{\mathbb Q}}
\def\bbR{{\mathbb R}}
\def\bbZ{{\mathbb Z}}
\def\bcA{{\bar{\mathcal A}}}
\def\calA{{\mathcal A}}
\def\calD{{\mathcal D}}
\def\calF{{\mathcal F}}
\def\calG{{\mathcal G}}
\def\calH{{\mathcal H}}
\def\calI{{\mathcal I}}
\def\calK{{\mathcal K}}
\def\calL{{\mathcal L}}
\def\calM{{\mathcal M}}
\def\calO{{\mathcal O}}
\def\calP{{\mathcal P}}
\def\calR{{\mathcal R}}
\def\calS{{\mathcal S}}
\def\calT{{\mathcal T}}
\def\calU{{\mathcal U}}
\def\fraka{{\mathfrak a}}
\def\frakb{{\mathfrak b}}
\def\frakg{{\mathfrak g}}
\def\frakh{{\mathfrak h}}
\def\tilE{\tilde{E}}
\def\tilq{\tilde{q}}

\def\tDelta{\tilde{\Delta}}
\def\tf{\tilde{f}}
\def\tF{\tilde{F}}
\def\tg{\tilde{g}}
\def\tI{\tilde{I}}
\def\tm{\tilde{m}}
\def\tR{\tilde{R}}
\def\tsigma{\tilde{\sigma}}
\def\tS{\tilde{S}}
\def\tSW{\widetilde{\SW}}

\def\car{\reflectbox{\usym{1F697}}}
\def\rac{\usym{1F697}}

% From http://tex.stackexchange.com/questions/154672/how-to-get-a-medium-sized-otimes
\DeclareMathOperator*{\midotimes}{\text{\raisebox{0.25ex}{\scalebox{0.8}{$\bigotimes$}}}}

%%%

\def\Abstract{{\raisebox{2mm}{\parbox[t]{3.95in}{
\parshape 1 0in 3.15in
{\red\bf Abstract.} We will study some strange traffic rules for cars
driving through an interchange: When they enter via an underpass, they
just go through. But when they enter via an overpass, they fall down to
the underpass with some small probability $p$, and then keep going unharmed,
down under.

\parshape 3 0in 3.15in 0in 3.15in 0in 3.95in
We will learn that to analyze this traffic game we need matrices and that
to play it better we need probabilities that are not numbers between
0 and 1. We will also learn how this game can be used to define some
knot invariants (a notion we will explain) \text{which} may be the best we
presently have.

\footnotesize {\bf\red Acknowledgement.} Work supported by NSERC
grant RGPIN-2025-06718 and by the Chu Family Foundation (NYC).
}}}}

\def\Perko{{\raisebox{0mm}{\parbox[t]{3.95in}{
\parshape 5 0in 2.5in 0in 2.5in 0in 2.5in 0in 2.5in 0in 3.95in 
For many years the Perko pair (on the right) were thought to be
different, until in 1973 an undergrad, K.~Perko, had shown them the same.
Seeing that eyeballing isn't good enough, how can we tell with
certainty if two diagrams represent the same, or different, knots?
}}}}

\def\Knots{{\raisebox{0.6mm}{\parbox[t]{3.95in}{
Tell knots apart? Alternating? Bound a genus 7 surface? Complement is
fibered over $S^1$? Complement is hyperbolic? Bounds a disk with only
ribbon singularities? Bounds a topological / smooth non-singular disk
in $B^4$?
$\ldots$
}}}}

\def\TrafficRules{{\raisebox{2mm}{\parbox[t]{3.95in}{
{\bf\red Model $T$ Traffic Rules.} Cars always drive
forward. When a car crosses over a bridge it goes through with
probability $T\sim 1$, but falls off with probability
$p=1-T\sim 0$.
On various edges {\em traffic counters} are placed.
}}}}

\def\dtA{{\tiny image credits:}}
\def\dtB{{\tiny
\href{https://diamondtraffic.com/productcategory/Portable-Counters}{diamondtraffic.com}}}

\def\gab{{\raisebox{2mm}{\parbox[t]{3.95in}{
\parshape 4 0in 2.9in 0in 2.9in 0in 2.9in 0in 3.95in
{\bf\red Definition.} The {\em traffic function} $G=(g_{\alpha\beta})$
is the reading of a traffic counter at $\beta$, if car traffic is
injected at $\alpha$ (if $\alpha=\beta$, the counter is {\em after}
the injection point).\hfill\text{\footnotesize (knots must be cut open!)}
\hfill{\bf\red Example~1.}
\vskip 1.65cm
Note. $\sum_{d\geq 0}p^d=\frac{1}{1-p}$ so $\sum_{d\geq 0}(1-T)^d = \frac{1}{1-(1-T)} = T^{-1}$.
}}}}

\def\kinkA{{$\sum_{d\geq 0}(1\!-\!T)^d=T^{-1}$}}
\def\kinkG{{$G=\begin{pmatrix}1&T^{-1}&1\\0&T^{-1}&1\\0&0&1\end{pmatrix}$}}

\def\Trefoil{{\raisebox{2mm}{\parbox[t]{2.75in}{
{\bf\red What about the Trefoil?} We get:
{\setlength{\jot}{2pt} \begin{eqnarray*}
  \morangem{g_{75}} & = & 0 \\
  \myellowm{g_{65} - g_{75}} & = & 0 \\
  \myellowm{g_{35} - Tg_{45} - (1-T)g_{75}} & = & 0 \\
  \mpinkm{g_{25} - g_{35}} & = & 0 \\
  \mpinkm{g_{55} - Tg_{65} - (1-T)g_{35}} & = & 1 \\
  \mbluem{g_{45} - g_{55}} & = & 0 \\
  \mbluem{g_{15} - T2_{65} - (1-T)g_{55}} & = & 0
\end{eqnarray*}}
\parshape 1 0in 3.95in
In other words,
\renewcommand{\arraystretch}{0.88}
\[
  \left(
    \begin{array}{ccccccc}
      \mbluem{\ 1\ } & \mbluem{-T} & 0 & 0 & \mbluem{T-1} & 0 & 0 \\
      0 & \mpinkm{\ 1\ } & \mpinkm{-1} & 0 & 0 & 0 & 0 \\
      0 & 0 & \myellowm{\ 1\ } & \myellowm{-T} & 0 & 0 & \myellowm{T-1} \\
      0 & 0 & 0 & \mbluem{\ 1\ } & \mbluem{-1} & 0 & 0 \\
      0 & 0 & \mpinkm{T-1} & 0 & \mpinkm{\ 1\ } & \mpinkm{-T} & 0 \\
      0 & 0 & 0 & 0 & 0 & \myellowm{\ 1\ } & \myellowm{-1} \\
      0 & 0 & 0 & 0 & 0 & 0 & \morangem{\ 1\ } \\
    \end{array}
  \right)
  \left(
    \begin{array}{c}
      g_{15} \\ g_{25} \\ g_{35} \\ g_{45} \\ g_{55} \\ g_{65} \\ g_{75}
    \end{array}
  \right)
  = \left(
    \begin{array}{c}
      0 \\ 0 \\ 0 \\ 0 \\ 1 \\ 0 \\ 0
    \end{array}
  \right).
\]
So with $A$ the $7\times 7$ matrix above, $g_{\alpha\beta} = (A^{-1}e_\alpha)_\beta =
(A^{-1})_{\alpha\beta} =: G_{\alpha\beta}$
with
\newline$\displaystyle
  G \!=\! A^{-1} \!=\! \left(
  \begin{array}{ccccccc}
   1 & T & 1 & T & 1 & T & 1 \\
   0 & 1 & \frac{1}{T^2-T+1} & \frac{T}{T^2-T+1} & \frac{T}{T^2-T+1} & \frac{T^2}{T^2-T+1} &
     1 \\
   0 & 0 & \frac{1}{T^2-T+1} & \frac{T}{T^2-T+1} & \frac{T}{T^2-T+1} & \frac{T^2}{T^2-T+1} &
     1 \\
   0 & 0 & \frac{1-T}{T^2-T+1} & \frac{1}{T^2-T+1} & \frac{1}{T^2-T+1} & \frac{T}{T^2-T+1} &
     1 \\
   0 & 0 & \frac{1-T}{T^2-T+1} & -\frac{(T-1) T}{T^2-T+1} & \frac{1}{T^2-T+1} &
     \frac{T}{T^2-T+1} & 1 \\
   0 & 0 & 0 & 0 & 0 & 1 & 1 \\
   0 & 0 & 0 & 0 & 0 & 0 & 1 \\
  \end{array}
  \right)
$
}}}}

\def\Fheorem{{\raisebox{2mm}{\parbox[t]{3.95in}{
{\bf\red Fheorem.} The traffic function $g_{\alpha\beta}$ is a ``relative invariant'':
}}}}

\def\messA{{$(1\!-\!T)^2\!+\!T(1\!-\!T)$}}
\def\messB{{$(1\!-\!T)T$}}
\def\messC{{$T(1\!-\!T)$}}
\def\messD{{$1\!-\!T$}}

\def\Resolution{{\raisebox{2mm}{\parbox[t]{3.95in}{
{\bf\red Resolution.} There are two types of crossings! In a ``positive''
crossing $\overcrossing$, cars on the underpass see the cars on the overpass going from
left to right (Canada!). In a ``negative'' one $\undercrossing$, they go right to left
(England!). In $(-)$ crossings, use $T^{-1}$ instead of $T$:
}}}}

\def\SmallPrint{{\raisebox{2mm}{\parbox[t]{1.45in}{
{\bf\red Small Print.} Other lane orientations must also be checked. They work.
}}}}

\def\Hecklers{{\raisebox{1mm}{\parbox[t]{3in}{
{\bf\red Waldorf.} But $T^{-1}$? Probabilities bigger than $1$?? But $1-T^{-1}$? Negative
probabilities??? That frog ain't a mathematician!

\parshape 1 0in 2.25in
{\bf\red Statler.} The show's so bad, let it go on. That frog must be an algebraist.

\parshape 1 0in 2.25in
{\bf\red Me.} Now the Fheorem is a Theorem!
}}}}

\def\TheoremTwo{{\raisebox{2mm}{\parbox[t]{3.25in}{
{\bf\red Theorem 2.} With $\Delta=T^{\text{easy}}\det(A)$ and 
\begin{multline*}
  R_1(c) = s \left[
    g_{ji} \left(g_{j+1,j}+g_{j,j+1}-g_{ij}\right) \right. \\
    \left. -g_{ii} \left(g_{j,j+1}-1\right) -1/2
  \right],
\end{multline*}
\parshape 1 0in 3.95in
$\Delta$ and $\displaystyle
  \rho_1 \coloneqq \Delta^2\left(\sum_c R_1(c)
  + \parbox{0.6in}{\centering a minor\newline correction}
\right)$ 
are knot invariants.

{\bf\red Proof.} An easy computation, but not today.
}}}}

\def\TheoremThree{{\raisebox{2mm}{\parbox[t]{3.95in}{
{\bf\red Theorem 3.} Let $T_1$ and $T_2$ be variables and let $T_3=T_1T_2$. Let
$g_{\nu\alpha\beta}=g_{\alpha\beta}(T\to T_\nu)$ for $\nu=1,2,3$ and let
$\Delta_\nu=\Delta(T\to T_\nu)$. Let
\vskip -6mm{\footnotesize
\begin{multline*}
  F_1(c) = s
    \left[1/2 - g_{3ii} +  T_2^s g_{1ii} g_{2ji} - T_2^s g_{3jj} g_{2ji}
      - (T_2^s-1) g_{3ii} g_{2ji} \right. \\
  \left. + (T_3^s-1) g_{2ji} g_{3ji} - g_{1ii} g_{2jj} + 2 g_{3ii} g_{2jj}
      + g_{1ii} g_{3jj} - g_{2ii} g_{3jj} \right] \\
  + \frac{s}{T_2^s-1}
    \left[
      (T_1^s-1)T_2^s \left( g_{3jj} g_{1ji} - g_{2jj} g_{1ji} + T_2^s g_{1ji} g_{2ji} \right)
\right. \\
  + \left. (T_3^s-1) g_{3ji} \left( 1 - T_2^s g_{1ii} + g_{2ij} + (T_2^s-2) g_{2jj}
        - (T_1^s-1) (T_2^s+1) g_{1ji} \right)\right],\quad
\end{multline*}
\vskip -7mm
\begin{multline*}
  F_2(c_0,c_1) =\frac{s_1 (T_1^{s_0}-1) (T_3^{s_1}-1) g_{1j_1i_0} g_{3j_0i_1}}{T_2^{s_1}-1} \\
  \cdot\left(T_2^{s_0} g_{2i_1i_0}+g_{2j_1j_0} - T_2^{s_0} g_{2j_1i_0}-g_{2i_1j_0} \right)
\end{multline*}
}
\vskip -7mm
\[
  \theta(D) \coloneqq \underbrace{\Delta_1\Delta_2\Delta_3}_{\parbox{0.66in}{\scriptsize\centering
    clears all denominators
  }}
  \left(\sum_c F_1(c) + \sum_{c_0,c_1} F_2(c_0,c_1) + \sum_kF_3(\varphi_k,k)\right),
\]

\vskip 24mm
Then $\Theta=(\Delta,\theta)$ is a knot invariant.

{\bf\red Proof.} An easy computation, but not today.

{\bf\red Fast!} A key to the Jones polynomial is Kauffman's relation
$\slashoverback\to A\smoothing+A^{-1}\hsmoothing$. The Jones poly is much simpler but much slower!
}}}}

\def\Strong{{\raisebox{2.5mm}{\parbox[t]{3.95in}{
{\red\bf Strong.} Testing $\Theta=(\Delta,\theta)$ on prime knots
up to mirrors and reversals, counting the number of distinct values
(with deficits in parenthesis):
\hfill{\footnotesize (\text{\it Vol} is approximate, $H\supset\Delta,J$)
}

\centering\footnotesize\begin{tabular}[t]{c|c|c|c|c}
  & knots & $(H,Kh,\text{\it Vol},\sigma_{LT})$ & $\Theta=(\Delta,\theta)$ & together \\
  \hline
  xing $\leq 10$ & 249 & 249 (0) & 249 (0) & 249 (0) \\
  \hline
  xing $\leq 11$ & 801 & 787 (14) & 798 (3) & 798 (3) \\
  \hline
  xing $\leq 12$ & 2,977 & (84) & (19) & (10) \\
  \hline
  xing $\leq 13$ & 12,965 & (911) & (194) & (169) \\
  \hline
  xing $\leq 14$ & 59,937 & (5,917) & (1,118) & (972) \\
  \hline
  xing $\leq 15$ & 313,230 & (41,434) & (6,758) & (6,304) \\
\end{tabular}
}}}}

\def\More{{\raisebox{2mm}{\parbox[t]{3.95in}{
{\red\bf Morals.}
$\bullet$~Matrices are useful!
$\bullet$~There's some probability theory even outside of $[0,1]$!
$\bullet$~There's a lot we still don't know!

{\red\bf Read More?}
$\bullet$~An article in Quanta Magazine: \qurl{drorbn.net/cumc26/quanta}.
$\bullet$~Videos and handouts from several other talks I gave on and around $\theta$: \qurl{drorbn.net/talks}.
$\bullet$~Our original paper, with context, proofs and code: \qurl{drorbn.net/cumc26/theta}.
}}}}

\pagestyle{empty}

\begin{document} \latintext
%\setlength{\jot}{0ex}
\setlength{\abovedisplayskip}{0.5ex}
\setlength{\belowdisplayskip}{0.5ex}
\setlength{\abovedisplayshortskip}{0ex}
\setlength{\belowdisplayshortskip}{0ex}

\begin{center} \null\vfill\input{TrafficT1.pdftex_t}\vfill\null \end{center}

\begin{center} \null\vfill\import{}{TrafficT2.pdftex_t}\vfill\null \end{center}

\end{document}

\endinput

