From 73de6518da8797fad35233eb8b47200b64cb1dcc Mon Sep 17 00:00:00 2001 From: Luke Naylor <l.naylor@sms.ed.ac.uk> Date: Sun, 18 Feb 2024 20:50:06 +0000 Subject: [PATCH] Add two code snippets in algorithm section --- .gitmodules | 3 +++ content.tex | 38 +++++++++++++++++++++++++++++++++++++- main.tex | 1 + newunicodes.tex | 4 ++++ packages.tex | 3 +++ tilt.rs | 1 + 6 files changed, 49 insertions(+), 1 deletion(-) create mode 100644 .gitmodules create mode 100644 newunicodes.tex create mode 160000 tilt.rs diff --git a/.gitmodules b/.gitmodules new file mode 100644 index 0000000..7ae685c --- /dev/null +++ b/.gitmodules @@ -0,0 +1,3 @@ +[submodule "tilt.rs"] + path = tilt.rs + url = https://gitlab.com/pseudowalls/tilt.rs.git diff --git a/content.tex b/content.tex index 53138be..086980e 100644 --- a/content.tex +++ b/content.tex @@ -1912,8 +1912,44 @@ Given a Chern character $v$, the domain of the problem are first verified: that $v$ has positive rank, that it satisfies $\Delta(v) \geq 0$, and that $\beta_{-}(v)$ is rational. +\begin{figure} + \inputminted[ + frame=lines, + framesep=2mm, + baselinestretch=1.2, + fontsize=\scriptsize, + linenos, + firstline=24, + lastline=36 + ]{rust}{tilt.rs/src/tilt_stability/left_pseudo_semistabilizers.rs} + \caption{\raggedleft\texttt{tilt_stability::left_pseudo_semistabilizers\\::considered_b_for_beta}} + \label{fig:code:consideredb} +\end{figure} + Take $\beta_{-}(v)=\frac{a_v}{n}$ in simplest terms. -Iterate over $q \in [0,\chern_1^{\beta_{-}}(v)]\cap\frac{1}{n}\ZZ$. +Iterate over $q = \frac{b}{n} \in [0,\chern_1^{\beta_{-}}(v)]\cap\frac{1}{n}\ZZ$. +The code used to generate the corresponding values for $b$ is shown in figure +\ref{fig:code:consideredb}. + +\begin{figure} + \inputminted[ + frame=lines, + framesep=2mm, + baselinestretch=1.2, + fontsize=\scriptsize, + linenos, + firstline=79, + lastline=99 + ]{rust}{tilt.rs/src/tilt_stability/left_pseudo_semistabilizers.rs} + \caption{\raggedleft\texttt{tilt_stability::left_pseudo_semistabilizers\\::find_all}} + \label{fig:code:reducingtoeachb} +\end{figure} + +We can therefore reduce the problem of finding solutions to the problem to +finding the solutions $u$ with each fixed possible $\chern_1^\beta(u)$ +(i.e. choice of $b$). +The code representing this appears in figure +\ref{fig:code:reducingtoeachb} For any $u = (r,c\ell,\frac{e}{2}\ell^2)$, satisfying $\chern_1^{\beta_{-}}(u)=q$ for one of the $q$ considered is equivalent to diff --git a/main.tex b/main.tex index 2a58257..00b82f3 100644 --- a/main.tex +++ b/main.tex @@ -3,6 +3,7 @@ \input{packages.tex} \input{newcommands.tex} \input{theoremstyles.tex} +\input{newunicodes.tex} \usepackage{sagetex} diff --git a/newunicodes.tex b/newunicodes.tex new file mode 100644 index 0000000..68c60db --- /dev/null +++ b/newunicodes.tex @@ -0,0 +1,4 @@ +\newunicodechar{ᵇ}{b} +\newunicodechar{ₙ}{n} +\newunicodechar{∈}{\in} +\newunicodechar{ℤ}{{$\mathbb{Z}$}} \ No newline at end of file diff --git a/packages.tex b/packages.tex index 828da36..5f7b966 100644 --- a/packages.tex +++ b/packages.tex @@ -8,4 +8,7 @@ \usepackage{cancel} \usepackage{mathtools} \usepackage[]{breqn} +\usepackage[nomap]{FiraMono} +\usepackage[cache=false]{minted} +\usepackage{newunicodechar} diff --git a/tilt.rs b/tilt.rs new file mode 160000 index 0000000..10545bb --- /dev/null +++ b/tilt.rs @@ -0,0 +1 @@ +Subproject commit 10545bb4a862646b57b71e0a0af3e2d304a9ff37 -- GitLab