From d82e77f5902e62c41ec6d0d18aeba7141d100ba5 Mon Sep 17 00:00:00 2001 From: Chris Wells Date: Fri, 24 Apr 2026 09:08:29 -0500 Subject: Updating to Haverford info --- data/papers.bib | 2 +- www/contact/index.html | 38 ++++++++++++++++++++----------------- www/img/haverford_logo.svg | 47 ++++++++++++++++++++++++++++++++++++++++++++++ www/index.html | 16 ++++++++++++---- www/teaching/index.md | 6 +++++- 5 files changed, 86 insertions(+), 23 deletions(-) create mode 100644 www/img/haverford_logo.svg diff --git a/data/papers.bib b/data/papers.bib index cbf4c8a..0b67f8b 100644 --- a/data/papers.bib +++ b/data/papers.bib @@ -8,7 +8,7 @@ eprintclass = {math.DG}, archivePrefix={arXiv}, primaryClass={math.DG}, - abstract = {A compact metric surface $M$ isometrically fills a closed metric curve $C$ if $\partial M=C$ and $d_M(x,y)=d_C(x,y)$ for every $x,y\in C=\partial M$; that is, $M$ does not introduce any ``shortcuts''; between points on its boundary. Gromov's filling area conjecture in differential geometry from 1983 asserts that among all compact, orientable Riemannian surfaces which isometrically fill the Riemannian circle, the one with the smallest surface area is the hemisphere. Gromov demonstrated that this is indeed the case if $M$ is homeomorphic to the disk. While Gromov's conjecture has since been verified in some other cases, the full conjecture remains unresolved. + abstract = {A compact metric surface $M$ isometrically fills a closed metric curve $C$ if $\partial M=C$ and $d_M(x,y)=d_C(x,y)$ for every $x,y\in C=\partial M$; that is, $M$ does not introduce any ``shortcuts'' between points on its boundary. Gromov's filling area conjecture in differential geometry from 1983 asserts that among all compact, orientable Riemannian surfaces which isometrically fill the Riemannian circle, the one with the smallest surface area is the hemisphere. Gromov demonstrated that this is indeed the case if $M$ is homeomorphic to the disk. While Gromov's conjecture has since been verified in some other cases, the full conjecture remains unresolved. In this paper, we consider a discrete analogue of Gromov's problem, which is likely natural to those who study graph embeddings on arbitrary surfaces. Using standard graph-theoretic tools, such as Menger's theorem, we obtain reasonable asymptotic bounds on this discrete variant. We then demonstrate how these discrete bounds can be translated to the continuous setting, showing that any isometric filling of the Riemannian circle of length $2\pi$ has surface area at least $1.36\pi$ (the hemisphere has surface area $2\pi$). This appears to be the first quantitative lower-bound on Gromov's problem that applies to arbitrary isometric fillings. }, diff --git a/www/contact/index.html b/www/contact/index.html index 6c5b967..2e6835e 100644 --- a/www/contact/index.html +++ b/www/contact/index.html @@ -6,21 +6,25 @@ short_title: Contact

Contact

- - - - - - - - - -
$workEmail$
-
    -
  • 112 Parker Hall [map]
    • -
  • Department of Mathematics and Statistics
    • -
  • Auburn University
    • -
  • Auburn, AL 36849
    • -
-
+ + + + + + + + + + + + + +
$workEmail$
+
    +
  • KINSC [map]
    • +
  • Department of Mathematics and Statistics
    • +
  • Haverford College
    • +
  • Haverford, PA 19041
    • +
+
diff --git a/www/img/haverford_logo.svg b/www/img/haverford_logo.svg new file mode 100644 index 0000000..35e6dec --- /dev/null +++ b/www/img/haverford_logo.svg @@ -0,0 +1,47 @@ + + + + haverford + Created with Sketch. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/www/index.html b/www/index.html index 462c324..2f0f13c 100644 --- a/www/index.html +++ b/www/index.html @@ -8,8 +8,8 @@ short_title: Chris Wells

(The mathematician formerly known as Chris Cox)

- I'm currently a postdoc working with the discrete math group at Auburn University. - Previously, I completed an RTG postdoc at Iowa State University. + I'm currently a Visiting Assistant Professor in the Department of Mathematics and Statistics at Haverford College. + Previously, I completed postdocs at Auburn University and at Iowa State University. I obtained a PhD in Algorithms, Combinatorics and Optimization (ACO) from Carnegie Mellon University under the guidance of $personA("Boris Bukh")$. My research focuses on the interplay between probabilistic, algebraic and geometric tools in extremal combinatorics, but I find all areas of math to be beautiful. To anyone who wants to know more about what I do, I recommend watching this video. @@ -57,10 +57,18 @@ short_title: Chris Wells

Employment

-
Postdoctoral Research Associate
+
Visiting Assistant Professor
+ AU + +
+
+
Postdoctoral Research Fellow
AU
diff --git a/www/teaching/index.md b/www/teaching/index.md index 71a7c69..595f1a5 100644 --- a/www/teaching/index.md +++ b/www/teaching/index.md @@ -4,7 +4,11 @@ short_title: Teaching --- If a course listed here doesn't have a link, then the course was administered through Canvas. -## Auburn University (2023--Present) +## Haverford College (2026--Present) + +Fall 2026 + +## Auburn University (2023--2026) Spring 2026 -- cgit v1.2.3