<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Math on CuriousCoding</title><link>https://curiouscoding.nl/tags/math/</link><description>Recent content in Math on CuriousCoding</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sat, 01 Aug 2026 00:00:00 +0200</lastBuildDate><atom:link href="https://curiouscoding.nl/tags/math/index.xml" rel="self" type="application/rss+xml"/><item><title>NtHash3: first ideas</title><link>https://curiouscoding.nl/posts/nthash-revisited/</link><pubDate>Sat, 01 Aug 2026 00:00:00 +0200</pubDate><guid>https://curiouscoding.nl/posts/nthash-revisited/</guid><description>&lt;div class="ox-hugo-toc toc"&gt;&#10;&lt;div class="heading"&gt;Table of Contents&lt;/div&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="#quick-introduction" &gt;Quick introduction&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#a-new-strategy" &gt;A new strategy&lt;/a&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="#inverse-operation" &gt;Inverse operation&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#some-more-variants" &gt;Some more variants&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#repeated-applications-of-f" &gt;&lt;span class="org-todo todo TODO"&gt;TODO&lt;/span&gt; Repeated applications of \(f\)&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#collisions" &gt;Collisions&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#consecutive-small-values" &gt;&lt;span class="org-todo todo TODO"&gt;TODO&lt;/span&gt; Consecutive small values&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/div&gt;&#10;&lt;!--endtoc--&gt;&#10;&lt;div style="display:none;"&gt;&#10;&lt;p&gt;\[&#10;\newcommand{\rot}{\mathsf{rot}}&#10;\newcommand{\shift}{\mathsf{shift}}&#10;\]&lt;/p&gt;&#10;&lt;/div&gt;&#10;&lt;p&gt;This is the third post in (by now) a series of 3 posts on NtHash:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="https://curiouscoding.nl/posts/nthash/" &gt;NtHash1: making it perfect&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://curiouscoding.nl/posts/nthash2-collisions/" &gt;NtHash2: investigating collisions&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://curiouscoding.nl/posts/nthash-revisited/" &gt;&lt;strong&gt;NtHash3: first ideas&lt;/strong&gt;&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;hr&gt;&#10;&lt;p&gt;Previously, I have written on:&lt;/p&gt;</description></item><item><title>A near-tight lower bound on minimizer density</title><link>https://curiouscoding.nl/posts/minimizer-lower-bound/</link><pubDate>Tue, 25 Jun 2024 00:00:00 +0200</pubDate><guid>https://curiouscoding.nl/posts/minimizer-lower-bound/</guid><description>&lt;div class="ox-hugo-toc toc"&gt;&#10;&lt;div class="heading"&gt;Table of Contents&lt;/div&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="#succinct-background" &gt;Succinct background&lt;/a&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="#definitions" &gt;Definitions&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#lower-bounds" &gt;Lower bounds&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#a-new-lower-bound" &gt;A new lower bound&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#discussion" &gt;Discussion&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#post-scriptum" &gt;Post scriptum&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#acknowledgement" &gt;Acknowledgement&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/div&gt;&#10;&lt;!--endtoc--&gt;&#10;&lt;p&gt;&lt;strong&gt;The results of this post are now published in Bioinformatics: &lt;a href="https://doi.org/10.1093/bioinformatics/btae736" class="external-link" target="_blank" rel="noopener"&gt;&lt;strong&gt;DOI&lt;/strong&gt;&lt;/a&gt;, &lt;a href="https://curiouscoding.nl/papers/sampling-lower-bound.pdf" &gt;&lt;strong&gt;PDF&lt;/strong&gt;&lt;/a&gt;:&lt;/strong&gt;&lt;/p&gt;&#10;&lt;blockquote&gt;&#10;&lt;p&gt;Kille, Bryce, Ragnar Groot Koerkamp, Drake McAdams, Alan Liu, and Todd J Treangen. 2024. “A near-tight Lower Bound on the Density of Forward Sampling Schemes.” Edited by Yann Ponty. &lt;i&gt;Bioinformatics&lt;/i&gt;, December. &lt;a href="https://doi.org/10.1093/bioinformatics/btae736"&gt;&lt;a href="https://doi.org/10.1093/bioinformatics/btae736" class="external-link" target="_blank" rel="noopener"&gt;https://doi.org/10.1093/bioinformatics/btae736&lt;/a&gt;&lt;/a&gt;.&lt;/p&gt;&#10;&lt;/blockquote&gt;&#10;&lt;p&gt;This content has also been absorbed into my &lt;a href="https://curiouscoding.nl/posts/minimizers/" &gt;&lt;strong&gt;thesis chapter on minimizers&lt;/strong&gt;&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>NtHash1: making it perfect</title><link>https://curiouscoding.nl/posts/nthash/</link><pubDate>Sun, 31 Dec 2023 00:00:00 +0100</pubDate><guid>https://curiouscoding.nl/posts/nthash/</guid><description>&lt;div class="ox-hugo-toc toc"&gt;&#10;&lt;div class="heading"&gt;Table of Contents&lt;/div&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="#nthash" &gt;NtHash&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#minimizers" &gt;Minimizers&lt;/a&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="#robust-minimizers" &gt;Robust minimizers&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#is-nthash-injective-on-kmers" &gt;Is NtHash injective on kmers?&lt;/a&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="#searching-for-a-collision" &gt;Searching for a collision&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#proving-perfection" &gt;Proving perfection&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#alternatives" &gt;Alternatives&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="#smhasher-results" &gt;SmHasher results&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/div&gt;&#10;&lt;!--endtoc--&gt;&#10;&lt;p&gt;This is the first post in (by now) a series of 3 posts on NtHash:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="https://curiouscoding.nl/posts/nthash/" &gt;&lt;strong&gt;NtHash1: making it perfect&lt;/strong&gt;&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://curiouscoding.nl/posts/nthash2-collisions/" &gt;NtHash2: investigating collisions&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://curiouscoding.nl/posts/nthash-revisited/" &gt;NtHash3: first ideas&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;h2 id="nthash"&gt;&#10; NtHash&#10; &lt;a class="heading-link" href="#nthash"&gt;&#10; &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;&#10; &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;&#10; &lt;/a&gt;&#10;&lt;/h2&gt;&#10;&lt;p&gt;NtHash (&lt;a href="#citeproc_bib_item_4"&gt;Mohamadi et al. 2016&lt;/a&gt;) is a rolling hash suitable for hashing any kind of text, but made for DNA originally.&#10;For a string of length \(k\) it is a \(64\) bit value computed as:&lt;/p&gt;</description></item><item><title>A Combinatorial Identity</title><link>https://curiouscoding.nl/posts/a-combinatorial-identity/</link><pubDate>Sun, 16 Oct 2022 00:00:00 +0200</pubDate><guid>https://curiouscoding.nl/posts/a-combinatorial-identity/</guid><description>&lt;p&gt;Some notes regarding the identity&lt;/p&gt;&#10;&lt;p&gt;\begin{equation}&#10;\sum_{k=0}^n \binom{2k}k \binom{2n-2k}{n-k} = 4^n&#10;\end{equation}&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Gould has two derivations:&#10;&lt;ul&gt;&#10;&lt;li&gt;&#10;&lt;p&gt;&lt;a href="https://web.archive.org/web/20171225173015/http://math.wvu.edu/~gould/Vol.5.PDF" class="external-link" target="_blank" rel="noopener"&gt;The first&lt;/a&gt;, from Jensens equality, (18) in (&lt;a href="#citeproc_bib_item_2"&gt;Jensen 1902&lt;/a&gt;; &lt;a href="#citeproc_bib_item_3"&gt;Shijie 1303&lt;/a&gt;).&lt;/p&gt;&#10;&lt;/li&gt;&#10;&lt;li&gt;&#10;&lt;p&gt;&lt;a href="https://web.archive.org/web/20171118022119/http://www.math.wvu.edu/~gould/Vol.4.PDF" class="external-link" target="_blank" rel="noopener"&gt;A second&lt;/a&gt; via the Chu-Vandermonde convolution:&lt;/p&gt;&#10;&lt;p&gt;\begin{equation}&#10;\sum_{k=0}^n \binom{x}k \binom{y}{n-k} = \binom{x+y}n&#10;\end{equation}&lt;/p&gt;&#10;&lt;p&gt;using \(x=y=-\frac 12\) and using the &lt;em&gt;$-\frac 12$-transform&lt;/em&gt;:&lt;/p&gt;&#10;&lt;p&gt;\begin{equation}&#10;\binom{-1/2}{n} = (-1)^n\binom{2n}{n}\frac 1 {2^{2n}}&#10;\end{equation}&lt;/p&gt;&#10;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/li&gt;&#10;&lt;li&gt;Duarte and de Oliveira (&lt;a href="#citeproc_bib_item_1"&gt;2012&lt;/a&gt;) has a combinatorial proof.&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;h2 id="references"&gt;&#10; References&#10; &lt;a class="heading-link" href="#references"&gt;&#10; &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;&#10; &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;&#10; &lt;/a&gt;&#10;&lt;/h2&gt;&#10;&lt;style&gt;.csl-entry{text-indent: -1.5em; margin-left: 1.5em;}&lt;/style&gt;&lt;div class="csl-bib-body"&gt;&#10; &lt;div class="csl-entry"&gt;&lt;a id="citeproc_bib_item_1"&gt;&lt;/a&gt;Duarte, Rui, and António Guedes de Oliveira. 2012. “New Developments of an Old Identity.” &lt;a href="https://doi.org/10.48550/ARXIV.1203.5424"&gt;https://doi.org/10.48550/ARXIV.1203.5424&lt;/a&gt;.&lt;/div&gt;&#10; &lt;div class="csl-entry"&gt;&lt;a id="citeproc_bib_item_2"&gt;&lt;/a&gt;Jensen, J. L. W. V. 1902. “Sur Une Identité D’abel et Sur D’autres Formules Analogues.” &lt;i&gt;Acta Mathematica&lt;/i&gt; 26 (0): 307–18. &lt;a href="https://doi.org/10.1007/bf02415499"&gt;https://doi.org/10.1007/bf02415499&lt;/a&gt;.&lt;/div&gt;&#10; &lt;div class="csl-entry"&gt;&lt;a id="citeproc_bib_item_3"&gt;&lt;/a&gt;Shijie, Zhu. 1303. &lt;i&gt;Jade Mirror of the Four Unknowns&lt;/i&gt;.&lt;/div&gt;&#10;&lt;/div&gt;</description></item></channel></rss>