From b0524102197d3cb94000f581a4148f8129bf4b91 Mon Sep 17 00:00:00 2001
From: Chris Wells <chris@mathematicaster.org>
Date: Thu, 8 Aug 2024 10:53:54 -0500
Subject: updated papers and presentations

---
 content/papers.bib        | 25 ++++++++++++++++++++-----
 content/presentations.bib | 36 ++++++++++++++++++++++++++++++++++++
 2 files changed, 56 insertions(+), 5 deletions(-)

(limited to 'content')

diff --git a/content/papers.bib b/content/papers.bib
index 31cdeb0..be92fa6 100644
--- a/content/papers.bib
+++ b/content/papers.bib
@@ -1,3 +1,14 @@
+@unpublished{briggs_vietoris,
+    title = {Facets in the {V}ietoris--{R}ips complexes of hypercubes},
+    author = {Briggs, Joseph and Feng, Ziqin},
+    month = {aug},
+    year = {2024},
+    eprint = {2408.01288},
+    eprinttype = {arXiv},
+    eprintclass = {math.AT},
+    keywords = {submitted},
+}
+
 @unpublished{briggs_frogs,
     title = {Frogs, hats and common subsequences},
     author = {Briggs, Joseph and Parker, Alex and Schwieder, Coy},
@@ -29,19 +40,23 @@
     eprint = {2307.00116},
     eprintclass = {math.CO},
     eprinttype = {arxiv},
-    keywords = {submitted},
+    keywords = {accepted},
+    journal = {Journal of Graph Theory},
 }
 
-@unpublished{sipp,
+@article{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},
+    volume = {39},
+    pages = {434--459},
+    year = {2023},
+    month = {aug},
+    doi = {10.13001/ela.2023.7579},
     eprint = {2212.05207},
     eprintclass = {math.CO},
     eprinttype = {arxiv},
-    keywords = {accepted},
+    keywords = {published},
     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.}
 }
diff --git a/content/presentations.bib b/content/presentations.bib
index 0a1c146..6b48eaf 100644
--- a/content/presentations.bib
+++ b/content/presentations.bib
@@ -1,3 +1,39 @@
+@misc{ista_24,
+    title = {Maximum likelihood estimators and subgraph counts in planar graphs},
+    year = {2024},
+    month = {jul},
+    howpublished = {ISTA Combinatorics Seminar},
+    location = {Klosterneuburg, Austria},
+    keywords = {invited, seminar},
+}
+
+@misc{graz_24,
+    title = {Maximum likelihood estimators and subgraph counts in planar graphs},
+    year = {2024},
+    month = {jul},
+    howpublished = {TU Graz Combinatorics Seminar},
+    location = {Graz, Austria},
+    keywords = {invited, seminar},
+}
+
+@misc{paris_24,
+    title = {Holey {V}ietoris--{R}ips complex, {B}atman!},
+    year = {2024},
+    month = {jun},
+    howpublished = {Workshop on Topological Combinatorics},
+    location = {Paris, France},
+    keywords = {invited, conference, workshop},
+}
+
+@misc{alamos_24,
+    title = {Small projective codes and equiangular lines},
+    year = {2024},
+    month = {may},
+    howpublished = {Los Alamos T-5 Seminar},
+    location = {Los Alamos, NM},
+    keywords = {invited, seminar},
+}
+
 @misc{ams_24,
     title = {Maximum likelihood estimators and subgraph counts in planar graphs},
     year = {2024},
-- 
cgit v1.2.3