{{ .Title | safeHTML }}
-{{ .Date.Format "Mon, Jan 2, 2006" }}
-{{ .Content }}
-diff --git a/.gitignore b/.gitignore
index c75eecc..7ba0a09 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1 +1,2 @@
/public
+/resources
diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..cc556cc
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,64 @@
+.PHONY: all build assets static upload serv clean nuke
+.SECONDARY:
+
+HUGO := hugo --gc
+#KATEX_VERSION := 0.10.2
+URL_MATERIALIZE_ZIP := https://github.com/Dogfalo/materialize/releases/download/1.0.0/materialize-src-v1.0.0.zip
+URL_MATERIALICONS_CSS := https://fonts.googleapis.com/icon?family=Material+Icons
+URL_LUNR_JS := https://unpkg.com/lunr/lunr.min.js
+#URL_KATEX := https://cdn.jsdelivr.net/npm/katex@$(KATEX_VERSION)
+#URL_KATEX_CSS := $(URL_KATEX)/dist/katex.min.css
+#URL_KATEX_JS := $(URL_KATEX)/dist/katex.min.js
+#URL_KATEX_AUTO_RENDER_JS := $(URL_KATEX)/dist/contrib/auto-render.min.js
+ASSETS := assets/vendor/materialize-src assets/vendor/material-icons.css
+#assets/katex.min.css assets/katex.min.js assets/katex-auto-render.min.js
+STATIC := static/vendor/lunr.min.js
+
+all: clean build upload
+
+build: assets static
+ $(HUGO)
+
+assets: $(ASSETS)
+
+static: $(STATIC)
+
+upload:
+ echo "Upload not implemented"
+
+assets/vendor/materialize-src: static/vendor/materialize.zip
+ mkdir -p $(dir $@)
+ unzip $< -d $(dir $@)
+
+static/vendor/materialize.zip:
+ mkdir -p $(dir $@)
+ wget -O $@ $(URL_MATERIALIZE_ZIP)
+
+assets/vendor/material-icons.css:
+ mkdir -p $(dir $@)
+ wget -O $@ $(URL_MATERIALICONS_CSS)
+
+static/vendor/lunr.min.js:
+ mkdir -p $(dir $@)
+ wget -O $@ $(URL_LUNR_JS)
+
+#assets/katex.min.css:
+ #mkdir -p $(dir $@)
+ #wget -O $@ $(URL_KATEX_CSS)
+
+#assets/katex.min.js:
+ #mkdir -p $(dir $@)
+ #wget -O $@ $(URL_KATEX_JS)
+
+#assets/katex-auto-render.min.js:
+ #mkdir -p $(dir $@)
+ #wget -O $@ $(URL_KATEX_AUTO_RENDER_JS)
+
+serv: clean assets static
+ $(HUGO) server
+
+clean:
+ rm -rf resources public
+
+nuke: clean
+ rm -rf $(ASSETS) $(STATIC)
diff --git a/assets/.gitignore b/assets/.gitignore
new file mode 100644
index 0000000..61ead86
--- /dev/null
+++ b/assets/.gitignore
@@ -0,0 +1 @@
+/vendor
diff --git a/assets/sass/main.scss b/assets/sass/main.scss
new file mode 100644
index 0000000..3bdb700
--- /dev/null
+++ b/assets/sass/main.scss
@@ -0,0 +1,94 @@
+$primary-color: #1d4e9e;
+$secondary-color: #a6b8e4;
+
+@import "assets/vendor/materialize-src/sass/components/color-variables";
+@import "assets/vendor/materialize-src/sass/components/color-classes";
+
+$button-color: color("orange", "lighten-3");
+$button-background-focus: lighten($button-color, 4%);
+$button-raised-background: $button-color;
+$button-floating-background: $button-color;
+
+@import "assets/vendor/materialize-src/sass/materialize.scss";
+
+h4, span.card-subtitle {
+ color: color("grey", "base");
+}
+
+nav.breadcrumbs {
+ background: $secondary-color;
+}
+
+ul.pagination > li.active {
+ background: $secondary-color;
+}
+
+ul.collection > li.collection-item > div > a {
+ display: inline-block;
+ max-width: 90%;
+}
+
+div.navbar-fixed > nav .input-field {
+ position: absolute;
+}
+
+#search {
+
+ //position: absolute;
+ //transition: width 0.5s ease, color 0.5s ease, background-color 0.5s ease;
+
+ &:focus:not([readonly]) {
+ //width: 100%;
+ }
+
+}
+
+div.container {
+ opacity: 1;
+ transition: opacity 0.5s;
+ body.searching > & {
+ opacity: 0.1;
+ }
+}
+
+nav.searchbar {
+ background-color: $button-color;
+ //transition: height 0.5s ease, color 0.5s ease;
+ body:not(.searched-at-least-once) & {
+ height: 0;
+ overflow: hidden;
+ }
+}
+
+#search-results {
+ opacity: 1;
+ z-index: 1;
+ position: absolute;
+ width: 100%;
+ transition: visibility 0, opacity 0.5s;
+ body:not(.searching) & {
+ visibility:hidden;
+ opacity: 0;
+ }
+
+ & > div.collection > a.collection-item {
+ color: #222;
+
+ &.avatar > p {
+ margin-right: 30px;
+ }
+ }
+}
+
+#search-button {
+ opacity: 1;
+ position: fixed;
+ bottom: 2em;
+ right: 2em;
+ transition: visibility 0, opacity 0.5s;
+ body:not(.searching-initialized) & {
+ visibility: hidden;
+ opacity: 0;
+ }
+}
+
diff --git a/config.yml b/config.yml
index 15e28e9..98570b3 100644
--- a/config.yml
+++ b/config.yml
@@ -1,3 +1,59 @@
-baseurl: https://aureooms.github.io/math/
+baseurl: https://math.blog.aurelienooms.be/
theme: prove
-title: Aurélien's math blog
+title: Aurélien's Math Notebook
+buildFuture: true
+
+permalinks:
+ today: /:year/:month/:day/:title
+ past: /:year/:month/:day/:title
+ upcoming: /:year/:month/:day/:title
+
+taxonomies:
+ tag: tags
+ author: authors
+
+outputs:
+ home:
+ - HTML
+ - RSS
+ - Calendar
+ - JSON
+ section:
+ - HTML
+ - RSS
+ - Calendar
+ page:
+ - HTML
+ - Calendar
+ taxonomy:
+ - HTML
+ - RSS
+ - Calendar
+ taxonomyTerm:
+ - HTML
+
+params:
+ logo:
+ src: https://cdn.jsdelivr.net/gh/aureooms-ulb/logo/files/ulb-logo-blue-square.svg
+ alt: ULB
+ organizer: 'CN="Aurélien Ooms":mailto:info@math.blog.aurelienooms.be'
+ hostname: math.blog.aurelienooms.be
+ editURL: https://github.com/aureooms/math
+ nav:
+ sections:
+ - today
+ - upcoming
+ - past
+ taxonomies:
+ - tags
+ - authors
+ calendar:
+ tzid: Europe/Brussels
+ status:
+ - CONFIRMED # Indicates event is definite.
+ - TENTATIVE # Indicates event is tentative.
+ - CANCELLED # Indicates event was cancelled.
+ classification:
+ - PUBLIC
+ - PRIVATE
+ - CONFIDENTIAL
diff --git "a/content/authors/aur\303\251lien-ooms/_index.md" "b/content/authors/aur\303\251lien-ooms/_index.md"
new file mode 100644
index 0000000..b3924b1
--- /dev/null
+++ "b/content/authors/aur\303\251lien-ooms/_index.md"
@@ -0,0 +1,6 @@
+---
+title: "Aurélien Ooms"
+homepage: "https://aurelienooms.be"
+thumbnail:
+ src: https://ipfs.io/ipfs/QmaLqjQxyBfDfu23Vm2rW9sNpsnsVSToBmAsmgSAzwSqnm
+---
diff --git a/content/post/2015-06-19-gaussian-elimination.mmark b/content/past/2015-06-19-gaussian-elimination.mmark
similarity index 61%
rename from content/post/2015-06-19-gaussian-elimination.mmark
rename to content/past/2015-06-19-gaussian-elimination.mmark
index 4d078c3..f94ed44 100644
--- a/content/post/2015-06-19-gaussian-elimination.mmark
+++ b/content/past/2015-06-19-gaussian-elimination.mmark
@@ -2,6 +2,13 @@
date: 2015-06-19T00:00:00Z
title: Gaussian elimination
url: /2015/06/19/gaussian-elimination/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmYaWTZLBGucEgA1uftuUby1DTmBA4zsPo8jCSYSTqJ9Jk
+tags:
+ - Algorithms
+ - Linear Algebra
+authors:
+ - Aurélien Ooms
---
[Python implementation](https://cocalc.com/projects/1b2a688b-0ee8-41b1-be25-2f6a95c36c76/files/Gaussian%20elimination.sagews).
diff --git a/content/post/2015-06-23-complex-division.mmark b/content/past/2015-06-23-complex-division.mmark
similarity index 61%
rename from content/post/2015-06-23-complex-division.mmark
rename to content/past/2015-06-23-complex-division.mmark
index 0323ddf..3493a69 100644
--- a/content/post/2015-06-23-complex-division.mmark
+++ b/content/past/2015-06-23-complex-division.mmark
@@ -2,9 +2,18 @@
date: 2015-06-23T00:00:00Z
title: Complex numbers division
url: /2015/06/23/complex-division/
+thumbnail:
+ src: https://ipfs.io/ipfs/Qmd7X75zoQ7fn7QDp6TYkQjRdjazvHDJa1mdgq2YiZY1qJ
+tags:
+ - Numbers
---
$$
-\frac{a+bi}{c+di} = \frac{a+bi}{c+di} \frac{c-di}{c-di} = \frac{ac+bd}{c^2+d^2}+\frac{bc-ad}{c^2+d^2}i
+\frac{a+bi}{c+di} = \ldots
$$
+
+
+$$
+\frac{a+bi}{c+di} = \frac{a+bi}{c+di} \frac{c-di}{c-di} = \frac{ac+bd}{c^2+d^2}+\frac{bc-ad}{c^2+d^2}i
+$$
diff --git a/content/post/2015-06-24-binomial-coefficient-tricks.mmark b/content/past/2015-06-24-binomial-coefficient-tricks.mmark
similarity index 73%
rename from content/post/2015-06-24-binomial-coefficient-tricks.mmark
rename to content/past/2015-06-24-binomial-coefficient-tricks.mmark
index 90f7524..d24c144 100644
--- a/content/post/2015-06-24-binomial-coefficient-tricks.mmark
+++ b/content/past/2015-06-24-binomial-coefficient-tricks.mmark
@@ -1,7 +1,15 @@
---
-date: 2015-06-24T00:00:00Z
+date: 2015-06-24T00:00:00+02:00
title: Binomial coefficient tricks
-url: /2015/06/24/binomial-coefficient-tricks/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmQeJRjHamrvs9a7R1zrsJUTTDWsv6BBW79GQm2Yc6Z8gT
+tags:
+ - Identities
+duration: PT30M
+status: TENTATIVE
+categories:
+ - POST
+ - TEST
---
$$
diff --git a/content/post/2015-06-29-fibonacci.mmark b/content/past/2015-06-29-fibonacci.mmark
similarity index 94%
rename from content/post/2015-06-29-fibonacci.mmark
rename to content/past/2015-06-29-fibonacci.mmark
index 87d39a3..c8d1f4e 100644
--- a/content/post/2015-06-29-fibonacci.mmark
+++ b/content/past/2015-06-29-fibonacci.mmark
@@ -2,6 +2,11 @@
date: 2015-06-29T00:00:00Z
title: Fibonacci numbers
url: /2015/06/29/fibonacci/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmZ45td48HxWKnBGLLMCLwyd7qUmLV6yNcU914nxLMZuTW
+tags:
+ - Numbers
+ - Recurrences
---
The Fibonacci numbers are defined as $$f_0 = 0,\ f_1 = 1$$ and, for $$i \ge
diff --git a/content/post/2015-06-29-inverse-sum.mmark b/content/past/2015-06-29-inverse-sum.mmark
similarity index 85%
rename from content/post/2015-06-29-inverse-sum.mmark
rename to content/past/2015-06-29-inverse-sum.mmark
index 6c6ca56..5b0514d 100644
--- a/content/post/2015-06-29-inverse-sum.mmark
+++ b/content/past/2015-06-29-inverse-sum.mmark
@@ -2,6 +2,12 @@
date: 2015-06-29T00:00:00Z
title: Inverse sum equations
url: /2015/06/29/inverse-sum/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmNnXTqBHeNReAhAE9svPrr5bcXqerc71qb9LJYUhF99h9
+tags:
+ - Brute Force
+ - Algorithms
+ - Systems of Inequalities
---
We are given $$k > 0 \in \mathbb{R}$$ and $$a_1, a_2, \ldots, a_n \ge 1 \in \mathbb{N}$$ such that
diff --git a/content/post/2015-07-31-probabilistic-primality-testing.mmark b/content/past/2015-07-31-probabilistic-primality-testing.mmark
similarity index 66%
rename from content/post/2015-07-31-probabilistic-primality-testing.mmark
rename to content/past/2015-07-31-probabilistic-primality-testing.mmark
index 9e61049..9e68506 100644
--- a/content/post/2015-07-31-probabilistic-primality-testing.mmark
+++ b/content/past/2015-07-31-probabilistic-primality-testing.mmark
@@ -2,6 +2,11 @@
date: 2015-07-31T00:00:00Z
title: Probabilistic primality testing
url: /2015/07/31/probabilistic-primality-testing/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmPQSrNd3tqzbesJWXzkswVqY3G8NzEmFMoCq6nkBYjDbM
+tags:
+ - Algorithms
+ - Prime Numbers
---
[Sage implementation](https://cocalc.com/projects/49ff84e6-2108-4af7-8b75-1f17996aa5a0/files/PRIMALITY.sagews).
diff --git a/content/post/2015-11-08-symbols.mmark b/content/past/2015-11-08-symbols.mmark
similarity index 82%
rename from content/post/2015-11-08-symbols.mmark
rename to content/past/2015-11-08-symbols.mmark
index 9a4eb1f..32d1fdf 100644
--- a/content/post/2015-11-08-symbols.mmark
+++ b/content/past/2015-11-08-symbols.mmark
@@ -2,6 +2,12 @@
date: 2015-11-08T00:00:00Z
title: Symbols
url: /2015/11/08/symbols/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmcuGk8P95Rom4bQgmSqXFswvQ8M2n1ETDaBEsGbTdS1kx
+ caption: Mmmh
+tags:
+ - Notation
+ - Numbers
---
$$
diff --git a/content/post/2016-01-15-polyhedral-sets.mmark b/content/past/2016-01-15-polyhedral-sets.mmark
similarity index 93%
rename from content/post/2016-01-15-polyhedral-sets.mmark
rename to content/past/2016-01-15-polyhedral-sets.mmark
index ca539f3..b9fbc4b 100644
--- a/content/post/2016-01-15-polyhedral-sets.mmark
+++ b/content/past/2016-01-15-polyhedral-sets.mmark
@@ -2,6 +2,11 @@
date: 2016-01-15T00:00:00Z
title: Polyhedral sets
url: /2016/01/15/polyhedral-sets/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmSu4S43YGRZr16TrnNtZA3UxEoEpvSpYLEZiBjkiCn7Gg
+tags:
+ - Geometry
+ - Definitions
---
A *polyhedral set* in $$\mathbb{R}^d$$ is the intersection of a finite
diff --git a/content/post/2016-01-17-d-hyperplanes-intersection-bounds.mmark b/content/past/2016-01-17-d-hyperplanes-intersection-bounds.mmark
similarity index 99%
rename from content/post/2016-01-17-d-hyperplanes-intersection-bounds.mmark
rename to content/past/2016-01-17-d-hyperplanes-intersection-bounds.mmark
index 5a98108..599a4ec 100644
--- a/content/post/2016-01-17-d-hyperplanes-intersection-bounds.mmark
+++ b/content/past/2016-01-17-d-hyperplanes-intersection-bounds.mmark
@@ -1,7 +1,12 @@
---
-date: 2016-01-17T00:00:00Z
+date: 2016-01-17T00:00:00+01:00
title: \(d\) hyperplanes intersection bounds
-url: /2016/01/17/d-hyperplanes-intersection-bounds/
+url: /2016/01/17/d-hyperplanes-intersection-bounds
+thumbnail:
+ src: https://ipfs.io/ipfs/QmPAdhtD5ojLZP69nVe9EbHgAhon7BDnQbxic9nGSBk5cv
+tags:
+ - Geometry
+ - Linear Algebra
---
We bound the position of the $$0$$-cells of an arrangement of hyperplanes in
diff --git a/content/post/2016-04-12-vc-dimension.mmark b/content/past/2016-04-12-vc-dimension.mmark
similarity index 91%
rename from content/post/2016-04-12-vc-dimension.mmark
rename to content/past/2016-04-12-vc-dimension.mmark
index 254c6f5..fb0df8c 100644
--- a/content/post/2016-04-12-vc-dimension.mmark
+++ b/content/past/2016-04-12-vc-dimension.mmark
@@ -2,8 +2,17 @@
date: 2016-04-12T00:00:00Z
title: VC-dimension
url: /2016/04/12/vc-dimension/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmZpYeMXHBqCC1m8NtDJh82DQS8Q5YDLMPAsW3e4ZJtXTz
+tags:
+ - Geometry
+ - VC-dimension
+ - epsilon-nets
---
+Definitions of VC-dimesion and $$\varepsilon$$-nets.
+
+
## Definition 1 (Espilon net)
Let $$X$$ be a set, let $$\mu$$ be a probability measure on $$X$$, let
$$\mathcal{F}$$ be a system of $$\mu$$-measurable subsets of $$X$$, and let
@@ -12,7 +21,6 @@ called an $$\varepsilon$$-net for $$(X,\mathcal{F})$$ with respect to
$$\mu$$ if $$N \cap S \neq \emptyset$$ for all $$S \in \mathcal{F}$$ with
$$\mu(S) \ge \varepsilon$$.
-
## Definition 2 (Trace of $$\mathcal{F}$$ on $$Y$$)
Let $$\mathcal{F}$$ be a set system on $$X$$ and let $$Y \subseteq X$$. We define the
restriction of $$\mathcal{F}$$ on $$Y$$ (also called the *trace* of
@@ -25,7 +33,7 @@ $$
## Definition 3 (VC-dimension)
Let $$\mathcal{F}$$ be a set system on a set $$X$$. Let us say that a subset $$A
-\subseteq X$$ is shttered by $$\mathcal{F}$$ if each of the subsets of $$A$$ can
+\subseteq X$$ is shattered by $$\mathcal{F}$$ if each of the subsets of $$A$$ can
be obtained as the intersection of some $$S \in \mathcal{F}$$ with $$A$$, i.e.,
if $$\mathcal{F}|_A = 2^{A}$$. We define the VC-dimension of
$$\mathcal{F}$$, denoted
diff --git a/content/post/2016-04-14-log-log-log.mmark b/content/past/2016-04-14-log-log-log.mmark
similarity index 93%
rename from content/post/2016-04-14-log-log-log.mmark
rename to content/past/2016-04-14-log-log-log.mmark
index 670c778..7828eb2 100644
--- a/content/post/2016-04-14-log-log-log.mmark
+++ b/content/past/2016-04-14-log-log-log.mmark
@@ -2,6 +2,12 @@
date: 2016-04-14T00:00:00Z
title: Log Log Log
url: /2016/04/14/log-log-log/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmRqy5uiX5KXLUe52bF5ADozyxHPuNAgdWiVbZ8vqZUnYi
+tags:
+ - Identities
+ - Inequalities
+ - Analysis of Algorithms
---
## Theorem
diff --git a/content/post/2016-04-27-equivalence-of-3sum-problems.mmark b/content/past/2016-04-27-equivalence-of-3sum-problems.mmark
similarity index 58%
rename from content/post/2016-04-27-equivalence-of-3sum-problems.mmark
rename to content/past/2016-04-27-equivalence-of-3sum-problems.mmark
index 4e0ebbd..a314be0 100644
--- a/content/post/2016-04-27-equivalence-of-3sum-problems.mmark
+++ b/content/past/2016-04-27-equivalence-of-3sum-problems.mmark
@@ -2,8 +2,16 @@
date: 2016-04-27T00:00:00Z
title: Equivalence of 3SUM problems
url: /2016/04/27/equivalence-of-3sum-problems/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmeHrVkaqogCPYKw3Gu29PWgkYCBWc4YEio16iNVjzcUzg
+tags:
+ - Algorithms
---
+Are different versions of the 3SUM problem equivalent?
+
+
+
## Reducing 3SUMx1 to 3SUMx3
???
@@ -11,5 +19,3 @@ url: /2016/04/27/equivalence-of-3sum-problems/
## Reducing 3SUMx3 to 3SUMx1
$$ (a, 3), (b, 4), (c, -7) $$
-
-
diff --git a/content/post/2016-05-04-polynomial-time-approximation-schemes.mmark b/content/past/2016-05-04-polynomial-time-approximation-schemes.mmark
similarity index 79%
rename from content/post/2016-05-04-polynomial-time-approximation-schemes.mmark
rename to content/past/2016-05-04-polynomial-time-approximation-schemes.mmark
index edbcfe6..978e594 100644
--- a/content/post/2016-05-04-polynomial-time-approximation-schemes.mmark
+++ b/content/past/2016-05-04-polynomial-time-approximation-schemes.mmark
@@ -2,6 +2,10 @@
date: 2016-05-04T00:00:00Z
title: Polynomial-time approximation schemes
url: /2016/05/04/polynomial-time-approximation-schemes/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmZBeHAHCWne2HVihGvCqcVK1meLfRyctk8WVH8qP2szN1
+tags:
+ - Approximation Algorithms
---
## PTAS
diff --git a/content/post/2017-04-21-converging-series.mmark b/content/past/2017-04-21-converging-series.mmark
similarity index 86%
rename from content/post/2017-04-21-converging-series.mmark
rename to content/past/2017-04-21-converging-series.mmark
index 841f7e9..ae69795 100644
--- a/content/post/2017-04-21-converging-series.mmark
+++ b/content/past/2017-04-21-converging-series.mmark
@@ -2,6 +2,10 @@
date: 2017-04-21T00:00:00Z
title: Converging series
url: /2017/04/21/converging-series/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmWiF78w2jN5QXdo4a3zcZ9cKvdPoHUj4pTLpxg3xP3KBP
+tags:
+ - Identities
---
Let $$-1 < x < 1$$,
diff --git a/content/post/2017-04-22-recurrences.mmark b/content/past/2017-04-22-recurrences.mmark
similarity index 89%
rename from content/post/2017-04-22-recurrences.mmark
rename to content/past/2017-04-22-recurrences.mmark
index 89bf8ff..4dc98cc 100644
--- a/content/post/2017-04-22-recurrences.mmark
+++ b/content/past/2017-04-22-recurrences.mmark
@@ -2,6 +2,10 @@
date: 2017-04-22T00:00:00Z
title: Recurrences
url: /2017/04/22/recurrences/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmT9GxdAYNzHF4rZUADZ7BX81UMUFypmJJK88RJfs6BcfK
+tags:
+ - Recurrences
---
## Theorem
diff --git a/content/post/2017-07-21-quantum-computer-algorithms.mmark b/content/past/2017-07-21-quantum-computer-algorithms.mmark
similarity index 89%
rename from content/post/2017-07-21-quantum-computer-algorithms.mmark
rename to content/past/2017-07-21-quantum-computer-algorithms.mmark
index d071fac..0e98e4f 100644
--- a/content/post/2017-07-21-quantum-computer-algorithms.mmark
+++ b/content/past/2017-07-21-quantum-computer-algorithms.mmark
@@ -2,6 +2,13 @@
date: 2017-07-21T00:00:00Z
title: Quantum Computer Algorithms
url: /2017/07/21/quantum-computer-algorithms/
+thumbnail:
+ src: https://ipfs.io/ipfs/Qma4SHRZJHV16PBNPu6kypZJwPDuA4TNvzTFeVBaWJDymR
+tags:
+ - Quantum Computing
+ - Algorithms
+authors:
+ - Aurélien Ooms
---
[Notes](https://ipfs.io/ipfs/QmctoycyfhWTrDy4c4jZeyLcRmmutFii5H5RLGk7pMbDoS)
diff --git a/content/post/2017-07-22-infinite-number-of-primes.mmark b/content/past/2017-07-22-infinite-number-of-primes.mmark
similarity index 75%
rename from content/post/2017-07-22-infinite-number-of-primes.mmark
rename to content/past/2017-07-22-infinite-number-of-primes.mmark
index e71580d..875ee3c 100644
--- a/content/post/2017-07-22-infinite-number-of-primes.mmark
+++ b/content/past/2017-07-22-infinite-number-of-primes.mmark
@@ -1,7 +1,18 @@
---
date: 2017-07-22T00:00:00Z
title: Infinite Number of Primes
-url: /2017/07/22/infinite-number-of-primes/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmeKDgrff9eE9gZFGBvoVA95QFnP8fNGcsDfMQhun7pApa
+ caption: Ulam's Spiral
+tags:
+ - Number Theory
+ - Prime Numbers
+ - Numbers
+location: Europe
+geolocation:
+ latitude: 50
+ longitude: 3
+status: CANCELLED
---
The erroneous proof I hear most often is: Suppose $$P$$ is a
diff --git a/content/post/2017-07-23-sums-of-geometric-series.mmark b/content/past/2017-07-23-sums-of-geometric-series.mmark
similarity index 85%
rename from content/post/2017-07-23-sums-of-geometric-series.mmark
rename to content/past/2017-07-23-sums-of-geometric-series.mmark
index 13442eb..21f7e80 100644
--- a/content/post/2017-07-23-sums-of-geometric-series.mmark
+++ b/content/past/2017-07-23-sums-of-geometric-series.mmark
@@ -2,6 +2,13 @@
date: 2017-07-23T00:00:00Z
title: Sums of geometric series
url: /2017/07/23/sums-of-geometric-series/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmScXVCgnEHUoZF3Mu14A8aneUnRRt1bqQuUtN5bJWpbhx
+ caption: Two
+tags:
+ - Identities
+ - Inequalities
+ - Analysis of Algorithms
---
Among the identities that are useful in the analysis of algorithms,
@@ -17,7 +24,7 @@ $$
That's nice. There are many ways to prove it, a cool one is to first
-[prove](/math/2017/04/21/converging-series) that
+[prove]({{< ref "2017-04-21-converging-series" >}}) that
$$
\sum_{i=0}^{\infty} x^i = \frac{1}{ {(1-x)} },
diff --git a/content/post/2018-10-17-drunkards-walk.mmark b/content/past/2018-10-17-drunkards-walk.mmark
similarity index 89%
rename from content/post/2018-10-17-drunkards-walk.mmark
rename to content/past/2018-10-17-drunkards-walk.mmark
index 685f55e..8318c84 100644
--- a/content/post/2018-10-17-drunkards-walk.mmark
+++ b/content/past/2018-10-17-drunkards-walk.mmark
@@ -2,6 +2,13 @@
date: 2018-10-17T00:00:00Z
title: The Drunkard's Walk
url: /2018/10/17/drunkards-walk/
+thumbnail:
+ src: https://ipfs.io/ipfs/QmSAXMJTDSRbyNyJZWhXUrdXuKiCxD6p6H9ths64L32dQm
+ caption: The Drunkard's Pilgrimage
+tags:
+ - Recurrences
+authors:
+ - Aurélien Ooms
---
A drunkard is zigzagging home. At every steps forward (or backward) he is
diff --git a/content/today/2019-05-30-test.mmark b/content/today/2019-05-30-test.mmark
new file mode 100644
index 0000000..e542969
--- /dev/null
+++ b/content/today/2019-05-30-test.mmark
@@ -0,0 +1,6 @@
+---
+title: "2019 05 30 Test"
+date: 2019-05-30T00:41:15+02:00
+draft: false
+---
+
diff --git a/content/upcoming/2020-05-29-future-post.mmark b/content/upcoming/2020-05-29-future-post.mmark
new file mode 100644
index 0000000..31d9195
--- /dev/null
+++ b/content/upcoming/2020-05-29-future-post.mmark
@@ -0,0 +1,8 @@
+---
+title: "2020 05 29 Future Post"
+date: 2020-05-29T09:51:40+02:00
+draft: false
+---
+
+testaroo
+
diff --git a/static/.gitignore b/static/.gitignore
new file mode 100644
index 0000000..61ead86
--- /dev/null
+++ b/static/.gitignore
@@ -0,0 +1 @@
+/vendor
diff --git a/static/lunrConfig.js b/static/lunrConfig.js
new file mode 100644
index 0000000..d4354ec
--- /dev/null
+++ b/static/lunrConfig.js
@@ -0,0 +1,16 @@
+var lunrConfig = {
+ "limit": 5,
+} ;
+
+var lunrPlugins = [
+ function () {
+ this.ref('id');
+ this.field('link');
+ this.field('title');
+ this.field('content');
+ this.field('summary');
+ this.field('status');
+ this.field('authors');
+ this.field('tags');
+ }
+] ;
diff --git a/themes/prove/README.md b/themes/prove/README.md
new file mode 100644
index 0000000..0c45fd5
--- /dev/null
+++ b/themes/prove/README.md
@@ -0,0 +1,63 @@
+# The Material Theme
+
+## About minification of generated files
+
+Use `hugo --minify ...`.
+
+## About the `duration` attribute
+
+Excerpt from https://www.ietf.org/rfc/rfc5545.txt:
+
+3.3.6. Duration
+
+ Value Name: DURATION
+
+ Purpose: This value type is used to identify properties that contain
+ a duration of time.
+
+ Format Definition: This value type is defined by the following
+ notation:
+
+ dur-value = (["+"] / "-") "P" (dur-date / dur-time / dur-week)
+
+ dur-date = dur-day [dur-time]
+ dur-time = "T" (dur-hour / dur-minute / dur-second)
+ dur-week = 1*DIGIT "W"
+ dur-hour = 1*DIGIT "H" [dur-minute]
+ dur-minute = 1*DIGIT "M" [dur-second]
+ dur-second = 1*DIGIT "S"
+ dur-day = 1*DIGIT "D"
+
+ Description: If the property permits, multiple "duration" values are
+ specified by a COMMA-separated list of values. The format is
+ based on the [ISO.8601.2004] complete representation basic format
+ with designators for the duration of time. The format can
+ represent nominal durations (weeks and days) and accurate
+ durations (hours, minutes, and seconds). Note that unlike
+ [ISO.8601.2004], this value type doesn't support the "Y" and "M"
+ designators to specify durations in terms of years and months.
+
+ The duration of a week or a day depends on its position in the
+ calendar. In the case of discontinuities in the time scale, such
+ as the change from standard time to daylight time and back, the
+ computation of the exact duration requires the subtraction or
+ addition of the change of duration of the discontinuity. Leap
+ seconds MUST NOT be considered when computing an exact duration.
+ When computing an exact duration, the greatest order time
+ components MUST be added first, that is, the number of days MUST
+ be added first, followed by the number of hours, number of
+ minutes, and number of seconds.
+
+ Negative durations are typically used to schedule an alarm to
+ trigger before an associated time (see Section 3.8.6.3).
+
+ No additional content value encoding (i.e., BACKSLASH character
+ encoding, see Section 3.3.11) are defined for this value type.
+
+ Example: A duration of 15 days, 5 hours, and 20 seconds would be:
+
+ P15DT5H0M20S
+
+ A duration of 7 weeks would be:
+
+ P7W
diff --git a/themes/prove/assets/search.js b/themes/prove/assets/search.js
new file mode 100644
index 0000000..ed281ea
--- /dev/null
+++ b/themes/prove/assets/search.js
@@ -0,0 +1,117 @@
+var ICONS = {
+ 'collection': 'class' ,
+ 'item' : 'notes' ,
+ 'author': 'face' ,
+ 'tag' : 'label' ,
+} ;
+
+var searchTimeout = undefined;
+
+function statusAndDate ( date , status ) {
+ if (status === "CANCELLED") return ` ${subtitle}${text ? '${date} (CANCELLED)` ;
+ else if (status === "TENTATIVE") return `${date} (TENTATIVE DATE AND TIME)`;
+ return date;
+}
+
+function getKind ( url ) {
+ const parts = url.slice(1,-1).split('/');
+
+ if (parts.length === 1) return 'collection' ;
+
+ if (parts[0] === 'authors') return 'author' ;
+ if (parts[0] === 'tags') return 'tag' ;
+
+ return 'item' ;
+}
+
+function matchToHTML ( match ) {
+ const href = match.document.link;
+ const title = `${match.document.link} - ${match.document.title} (${match.result.score.toFixed(3)})`;
+ const subtitle = match.document.date ? statusAndDate(match.document.date, match.document.status) : '';
+ const text = match.document.summary;
+ const kind = getKind(match.document.link);
+ const icon = ICONS[kind];
+ let avatar = `${icon}` ;
+ const thumbnail = match.document.thumbnail;
+ if ( thumbnail ) {
+ avatar = `` ;
+ }
+ return `
+ ${avatar}
+ ${title}
+
'+text : ''}
Page not found.
+{{ .Content }}
-{{ .Content }}
+{{ .Summary }}
- Read more about {{ .Title | safeHTML }} -{{ .Summary }}
+