added author display, better homepage, minor improvements

Author: hi-im-buggy

README.md

@@ -1,7 +1,7 @@
 # iiit-notebook
 
 iiit-notebook is a public repository of notes taken by students of IIIT Hyderabad. 
-The website itself is completely static, generated using Jekyll, and made by Pratyaksh Gautam.
+The website itself is completely static, generated using Jekyll.
 
 ## Features
 
@@ -12,9 +12,8 @@ The site has support for various features to improve note-taking such as
 
 + Syntax highlighting for code using Rouge, 
 <pre>
-```language-name
-	insert code here
-
+```c
+	printf("Hello, world!\n");
 ```
 </pre>
 + Graphs written in mermaid-js, simply by writing the code in a `mermaid` code block.
@@ -42,6 +41,30 @@ number: 1
 
 After that, you can add, commit and push your repo, and then make a PR to merge your changes.
 
+### Compatibility between `pandoc` and `jekyll`
+
+The website itself uses jekyll, but the PDF's rendered by `pandoc` generally look better and are more preferable, however not everything is perfectly compatible between the two, especially in math mode.
+When writing your notes keep the following things in mind:
+
+1. If you need to have pipe symbols (`\|`) or curly brackets (`\{`), not only should you escape them as shown here, but also nest them in a `div`. If you don't do this jekyll (the site) probably won't render it properly.  
+For inline math: `<div>$S = \{a, b\}$</div>`  
+For display math:
+```
+<div>
+$$f(x) = \|2 \times x + 1\|$$
+</div>
+```
+
+2. `pandoc` doesn't take kindly to spacing in between math mode delimiiters.  
+This works:
+```
+$\frac{a}{b}$
+```  
+This might not:
+```
+$ \frac{a}{b} $
+```
+
 ### Courses
 
 Sometimes you might be the first person to write notes for a certain course, and as a result, the course itself will not exist as part of the website.

_layouts/post.html

@@ -4,10 +4,11 @@
 <p>
     {% assign course = site.courses | where: 'code', page.code | first%}
     {% if course %}
-	<a href="{{ course.url }}"><h1>{{ course.code | upcase }} - {{ course.name }}</h1></a>
+	<h1><a href="{{ course.url }}">{{ course.code | upcase }} - {{ course.name }}</a> | {{page.title}}</h1>
     with {{ course.lecturer }}
     {% endif %}
     <div class = "date">{{ page.date | date: "%b %d, %Y - %A" }}</div>
+	<div>Written by: {{ page.author }}</div>
 </p>
 
 {{ content }}

_posts/2020-11-05-ds-lecture-22.md

@@ -28,7 +28,7 @@ If a set is (left- or right-) cancellative, it means that all elements of the se
 (i) Left-cancellativity $\Rightarrow$ unique solution
 
 Consider the function $f_{a}: S \rightarrow S$, defined as $f_{a}(x) = a \cdot x$. If it is invertible, then the equation would have a unique solution. Its range is:
-<div> $ S_{a_{L}} = \{a \cdot x | x \in S \} $ </div>
+<div>$S_{a_{L}} = \{a \cdot x | x \in S \}$</div>
 
 By closure, $S_{a_{L}} \subseteq S$. If $\|S_{a_{L}}\| < \|S\|$, then (by PHP), $a \cdot x_{1} = a \cdot x_{2}, x_{1} \neq x_{2}$ for some $x_{1},x_{2} \in S$ (*i.e.*, $f_{a}$ is many-one). However, $a$ is left-cancellative; hence $x_{1} = x_{2}$ and $f_{a}$ is one-one. This is a contradiction – hence $\|S_{a_{L}}\| = \|S\|$ and $S_{a_{L}} = S$.
 
@@ -56,14 +56,14 @@ Note: The crucial step in (i) was the proof of surjectivity. The reverse implica
 | --- | --- | --- | --- |
 | Quasigroup | Closure, Cancellativity | $\langle \mathbb{Z}, - \rangle$ | $\langle \mathbb{V}_ {2}, \times \rangle$[^1] |
 | --- | --- | --- | --- |
-| Group | Closure, Associativity, E. of Inverse, E. of Identity | $\langle \mathbb{Z_{n}}, \times_{n} \rangle$ | $\langle \mathbb{N}, \div \rangle$ |
+| Group | Closure, Associativity, E. of Inverse, E. of Identity | $\langle \mathbb{Z}_{n}, \times_{n} \rangle$ | $\langle \mathbb{N}, \div \rangle$ |
 
-[^1]: $\mathbb{V}_{2}$ = set of all vectors in the plane (non-standard notation); $\times$ = cross product
+[^1]: 
+$\mathbb{V}_{2}$ = set of all vectors in the plane (non-standard notation); $\times$ = cross product
 
 Note that (i) all semigroups, monoids, quasigroups and groups are groupoids, (ii) all monoids and groups are semigroups, and (iii) all groups are groupoids, semigroups, quasigroups and monoids.
 
 A semigroup or monoid is said to be *cyclic* if all its elements can be obtained from one of its elements by repeated application of the operation. Formally, for a system $\langle S, \cdot \rangle$, $\exists s \in S$ such that S can be written as
-
 <div>
 $$
 S = \{s^{n} | n \in \mathbb{N}_{0}\}

index.html

@@ -1,7 +1,12 @@
 ---
 title: Index
 ---
-<h1>Latest Notes</h1>
+<h1>iiit-notebook</h1>
+<p>
+iiit-notebook is a public repository of notes taken by students of IIIT Hyderabad.
+Find the README at the <a href='https://github.com/iiit-notebook/iiit-notebook.github.io'>github repository (click here).</a>
+</p>
+<h2>Latest Notes</h2>
 
 <ul>
     {% for post in site.posts %}