Updated my name and some papers

1 files changed, 14 insertions, 13 deletions

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},