fixing broken link to phd

PermutaTriangle · Jul 3, 2019 · e6be41a · e6be41a
1 parent bb6d029
commit e6be41a
Show file tree

Hide file tree

Showing 5 changed files with 6 additions and 6 deletions.
diff --git a/.DS_Store b/.DS_Store
diff --git a/_authors/bean.md b/_authors/bean.md
@@ -7,7 +7,7 @@ position: Postdoctoral Researcher, Reykjavik University
 ---
 Christian is a postdoc in the [School of Computer Science](https://en.ru.is/scs/) at [Reykjavik University](https://en.ru.is) in Iceland.
 
-- [PhD thesis: Finding structure in permutation sets](http://hdl.handle.net/1946/31663) &nbsp; ![Sage code]({{site.baseurl}}/assets/img/christian.jpg){:align="right" height="180px"}
+- [PhD thesis: Finding structure in permutation sets](https://hdl.handle.net/20.500.11815/1184) &nbsp; ![Sage code]({{site.baseurl}}/assets/img/christian.jpg){:align="right" height="180px"}
 - [arXiv papers](http://arxiv.org/a/bean_c_1)
 - [Google Scholar](https://scholar.google.is/citations?user=_Jvo1bEAAAAJ&hl=en)
 - [MathSciNet Profile](https://mathscinet.ams.org/mathscinet/MRAuthorID/1146492)

diff --git a/_papers/2019-02-27-combex.md b/_papers/2019-02-27-combex.md
@@ -5,7 +5,7 @@ title:
 journal:
  - In preparation
 
-authors: 
+authors:
 - albert
 - bean
 - claesson
@@ -30,6 +30,6 @@ lattice paths are discussed considered.
 ## Download the paper
 <!-- - [{{ page.journal }}](https://cs.uwaterloo.ca/journals/JIS/VOL20/Bean/bean2.html) -->
 <!-- - [arXiv](https://arxiv.org/abs/1802.08672) -->
-- [Christian's PhD thesis: Finding structure in permutation sets](http://hdl.handle.net/1946/31663)
+- [Christian's PhD thesis: Finding structure in permutation sets](https://hdl.handle.net/20.500.11815/1184)
 
-## Presentations
+## Presentations
diff --git a/_programs/2019-6-17-comb.md b/_programs/2019-6-17-comb.md
@@ -49,7 +49,7 @@ create rules about a class of interest, until a specification can be
 found. This package can be used to perform this process automatically.
 See the [Combinatorial Exploration
 project](https://permutatriangle.github.io/papers/2019-02-27-combex.html)
-and [Christian Bean’s PhD thesis](https://skemman.is/handle/1946/31663)
+and [Christian Bean’s PhD thesis](https://hdl.handle.net/20.500.11815/1184)
 for more details.
 
 The remainder of this README will be an example of how to use this

diff --git a/_programs/2019-6-17-tilings.md b/_programs/2019-6-17-tilings.md
@@ -41,7 +41,7 @@ What are gridded permutations and tilings?
 ------------------------------------------
 
 We will be brief in our definitions here, for more details see
-[Christian Bean’s PhD thesis](https://skemman.is/handle/1946/31663).
+[Christian Bean’s PhD thesis](https://hdl.handle.net/20.500.11815/1184).
 
 A `gridded permutation` is a pair `(π, P)` where `π` is a permutation
 and `P` is a tuple of cells, called the positions, that denote the cells