Built site for gh-pages

.nojekyll

@@ -1 +1 @@
-f1c30306
+354f9a8d

pages/notes/gf2.html

@@ -619,7 +619,7 @@ <h2 class="anchored" data-anchor-id="some-things-are-simpler">Some things are si
 <section id="gaussian-elimination-in-f2" class="level2">
 <h2 class="anchored" data-anchor-id="gaussian-elimination-in-f2">Gaussian Elimination in <span class="math inline">\(\mathbb{F}_2\)</span></h2>
 <p>Suppose that <span class="math inline">\(A\)</span> is an <span class="math inline">\(n \times n\)</span> matrix over <span class="math inline">\(\mathbb{F}_2\)</span> and <span class="math inline">\(b\)</span> is a compatibly sized bit-vector where we are interested in finding an <span class="math inline">\(x\)</span> satisfying <span class="math inline">\(A \cdot x = b\)</span>. Then the pseudocode for Gaussian elimination looks like:</p>
-<div id="alg-ge" class="pseudocode-container quarto-float" data-no-end="false" data-comment-delimiter="//" data-caption-prefix="Algorithm" data-pseudocode-number="1" data-line-number="true" data-line-number-punc=":" data-indent-size="1.2em">
+<div id="alg-ge" class="pseudocode-container quarto-float" data-pseudocode-number="1" data-line-number-punc=":" data-indent-size="1.2em" data-no-end="false" data-line-number="true" data-comment-delimiter="//" data-caption-prefix="Algorithm">
 <div class="pseudocode">
 \begin{algorithm} \caption{Gaussian Elimination in $F_2$} \begin{algorithmic} \Procedure{Solve}{$A, b, n$} \For {$j = 0$ \To $n - 1$} \State $s = j$ \While {$A(s,j) = 0$} \State $s = s + 1$ \EndWhile \If {$s &gt; n$} \Continue \EndIf \If {$ s \ne j$} \State swap rows $s$ and $j$ in the matrix $A$ \State swap elements $s$ and $j$ in the vector $b$ \EndIf \For {$i = j+1$ \To $n$} \If {$A(i,j) == 1$} \State replace row $i$ in $A$ with the sum of rows $i$ and $j$ \State replace element $i$ in $b$ with the sum of elements $i$ and $j$ \EndIf \EndFor \EndFor \EndProcedure \end{algorithmic} \end{algorithm}
 </div>

pages/polynomial/degree.html

@@ -591,7 +591,7 @@ <h1 class="title d-none d-lg-block"><code>bit::polynomial</code> — Polynomial
 </div>
 <section id="degree-versus-size" class="level2">
 <h2 class="anchored" data-anchor-id="degree-versus-size">Degree versus Size</h2>
-<p>The <em>size</em> of a polynomial, as returned by the [polynomial::size] method, is the number of its coefficients. The <em>degree</em> of a polynomial is the index of its highest non-trivial power term. For example, <span class="math display">\[
+<p>The <em>size</em> of a polynomial, as returned by the <a href="../../pages/polynomial/size.html"><code>polynomial::size</code></a> method, is the number of its coefficients. The <em>degree</em> of a polynomial is the index of its highest non-trivial power term. For example, <span class="math display">\[
 p(x) = x + x^3,
 \]</span> has a degree 3 and a size that is <em>at least</em> 4. If we write out all the coefficients, it might be that <span class="math display">\[
 p(x) = 0 + 1*x + 0*x^2 + 1*x^3 + 0*x4 + 0*x5,

search.json

@@ -822,7 +822,7 @@
     "href": "pages/polynomial/degree.html#degree-versus-size",
     "title": "bit::polynomial — Polynomial Degree",
     "section": "Degree versus Size",
-    "text": "Degree versus Size\nThe size of a polynomial, as returned by the [polynomial::size] method, is the number of its coefficients. The degree of a polynomial is the index of its highest non-trivial power term. For example, \\[\np(x) = x + x^3,\n\\] has a degree 3 and a size that is at least 4. If we write out all the coefficients, it might be that \\[\np(x) = 0 + 1*x + 0*x^2 + 1*x^3 + 0*x4 + 0*x5,\n\\] with two trailing zero coefficients \\(p_4 = p_5 = 0\\) so the polynomial has size 6. In this case, the query p.monic() will return false and p.make_monic() will eliminate those.\n\n\n\n\n\n\nThe make_monic() method does not alter the memory footprint\n\n\n\nCalling make_monic on a non-zero polynomial simply ensures that size() == degree() + 1. This operation releases no memory — see the polynomial::shrink_to_fit method."
+    "text": "Degree versus Size\nThe size of a polynomial, as returned by the polynomial::size method, is the number of its coefficients. The degree of a polynomial is the index of its highest non-trivial power term. For example, \\[\np(x) = x + x^3,\n\\] has a degree 3 and a size that is at least 4. If we write out all the coefficients, it might be that \\[\np(x) = 0 + 1*x + 0*x^2 + 1*x^3 + 0*x4 + 0*x5,\n\\] with two trailing zero coefficients \\(p_4 = p_5 = 0\\) so the polynomial has size 6. In this case, the query p.monic() will return false and p.make_monic() will eliminate those.\n\n\n\n\n\n\nThe make_monic() method does not alter the memory footprint\n\n\n\nCalling make_monic on a non-zero polynomial simply ensures that size() == degree() + 1. This operation releases no memory — see the polynomial::shrink_to_fit method."
   },
   {
     "objectID": "pages/polynomial/degree.html#efficiency",