Updated my name and some papers

5 files changed, 37 insertions, 22 deletions

diff --git a/content/header.tex b/content/header.tex
index da56d16..6c886d3 100644
--- a/content/header.tex
+++ b/content/header.tex
@@ -1,16 +1,16 @@
 \begin{minipage}[ht]{0.5\textwidth}
 	\flushleft
-	\Huge{Christopher Cox}
+    {\Huge Chris Wells}\quad{\Large(n\'ee Cox)}
 	\vspace{5pt}
 
 	\hspace{2pt}\Large{\doc}
 \end{minipage}
 \begin{minipage}{0.49\textwidth}
 	\flushright
-    408C Carver Hall\\
-	Iowa State University\\
-    Ames, IA 50011\\
-	\texttt{cocox@iastate.edu}\\
+    112 Parker Hall\\
+    Auburn University\\
+    Auburn, AL 36849\\
+	\texttt{coc0014@auburn.edu}\\
     \url{https://mathematicaster.org/}%
 \end{minipage}
 
diff --git a/content/papers.bib b/content/papers.bib
index 246e3b6..cce6b26 100644
--- a/content/papers.bib
+++ b/content/papers.bib
@@ -1,28 +1,29 @@
+@unpublished{heath_oddcycles,
+    author = {Heath, Emily and Martin, Ryan R.},
+    title = {The maximum number of odd cycles in a planar graph},
+    year = {2023},
+    month = {Jul},
+    % url = {https://arxiv.org/abs/2307.00116},
+    eprint = {2307.00116},
+    eprintclass = {math.CO},
+    eprinttype = {arxiv},
+    keywords = {submitted},
+}
+
 @unpublished{sipp,
     author = {Brennan, Zach and Curtis, Bryan and Gomez-Leos, Enrique and Hadaway, Kimberly and Hogben, Leslie and Thompson, Conor},
     title = {Orthogonal realizations of random sign patterns and other applications of the SIPP},
+    journal = {Electronic Journal of Linear Algebra},
     year = {2022},
     month = {Dec},
-    url = {http://arxiv.org/abs/2212.05207},
     eprint = {2212.05207},
     eprintclass = {math.CO},
     eprinttype = {arxiv},
-    keywords = {submitted},
+    keywords = {accepted},
     author+an = {1=earlygrad; 3=earlygrad; 4=earlygrad; 6=earlygrad},
     abstract = {A sign pattern is an array with entries in $\{+,-,0\}$. A matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A.~Curtis and B.L.~Shader, Sign patterns of orthogonal matrices and the strong inner product property, Linear Algebra Appl. 592: 228--259, 2020], is an important tool when determining whether a sign pattern allows row orthogonality because it guarantees there is a nearby matrix with the same property, allowing zero entries to be perturbed to nonzero entries, while preserving the sign of every nonzero entry. This paper uses the SIPP to initiate the study of conditions under which random sign patterns allow row orthogonality with high probability. Building on prior work, $5\times n$ nowhere zero sign patterns that minimally allow orthogonality are determined. Conditions on zero entries in a sign pattern are established that guarantee any row orthogonal matrix with such a sign pattern has the SIPP.}
 }
 
-@unpublished{unicorns,
-    author = {King, Emily J. and Mixon, Dustin G. and Parshall, Hans},
-    title = {Uniquely optimal codes of low complexity are symmetric},
-    year = {2020},
-    eprint = {2008.12871},
-    eprintclass = {math.CO},
-    eprinttype = {arxiv},
-    keywords = {submitted},
-    abstract = {We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.}
-}
-
 @article{cox_planarcycles,
     author = {Martin, Ryan R.},
     title = {The maximum number of 10- and 12-cycles in a planar graph},
diff --git a/content/positions.tex b/content/positions.tex
index 180cf9c..f47c90c 100644
--- a/content/positions.tex
+++ b/content/positions.tex
@@ -1,4 +1,6 @@
-\textbf{RTG postdoctoral research associate}\dotfill 2020--Cur\at{Iowa State University, Ames, IA}
+\textbf{Postdoctoral research fellow}\dotfill 2023--Cur\at{Auburn University, Auburn, AL}
+
+\textbf{RTG postdoctoral research associate}\dotfill 2020--2023\at{Iowa State University, Ames, IA}
 \begin{itemize}
     \item Supported by U.S.\ taxpayers through NSF Research Training Grant DMS-1839918
 %     \item Instructor: Algebraic Methods in Combinatorics (MATH 595: graduate reading course), Graph Theory (MATH 314), Calculus I (MATH 165), Edit Distance in Graphs (MATH 595: early graduate research course)
diff --git a/content/service.tex b/content/service.tex
index f6b1248..34f85dc 100644
--- a/content/service.tex
+++ b/content/service.tex
@@ -1,4 +1,7 @@
 \begin{itemize}[leftmargin=*]
-    \item Co-organizer of the \href{https://seminar.mathematicaster.org/}{Iowa State University Discrete Math Seminar}.\dotfill 2020--Cur
-    \item Co-organizer of the \href{https://sites.google.com/view/mmmm22}{5th Mostly annual Mostly Manitoba, Michigan and Minnesota Combinatorics Graduate Student Workshop}.\dotfill 2022
+    \item Co-organizer of the \emph{Special Session on Advances in Combinatorics} at the Fall 2023 AMS Southeastern Sectional Meeting\dotfill 2023
+    \item Co-organizer of the \emph{Iowa State University Discrete Math Seminar}\dotfill 2020--2023
+    \item Co-organizer of the \emph{5th Mostly annual Mostly Manitoba, Michigan and Minnesota Combinatorics Graduate Student Workshop}\dotfill 2022
+    % \item Co-organizer of the \href{https://seminar.mathematicaster.org/}{Iowa State University Discrete Math Seminar}.\dotfill 2020--Cur
+    % \item Co-organizer of the \href{https://sites.google.com/view/mmmm22}{5th Mostly annual Mostly Manitoba, Michigan and Minnesota Combinatorics Graduate Student Workshop}.\dotfill 2022
 \end{itemize}
diff --git a/content/teaching.tex b/content/teaching.tex
index c4ef950..d674ed6 100644
--- a/content/teaching.tex
+++ b/content/teaching.tex
@@ -1,4 +1,13 @@
-\subsection*{Iowa State University \normalfont{\normalsize\dotfill 2014--2015, 2020--Cur}}
+\subsection*{Auburn University \normalfont{\normalsize\dotfill 2023--Cur}}
+\subsubsection*{Instructor}
+\begin{itemize}
+    \item MATH 1120: Precalculus
+        \begin{itemize}
+            \item Fall 2023
+        \end{itemize}
+\end{itemize}
+
+\subsection*{Iowa State University \normalfont{\normalsize\dotfill 2014--2015, 2020--2023}}
 \subsubsection*{Instructor}
 \begin{itemize}
     \item MATH 595: Longest Common Subsequences