<?xml version="1.0" encoding="UTF-8"?>

<rss version="2.0"
 xmlns:blogChannel="http://backend.userland.com/blogChannelModule"
>

<channel>
<title>taboege.de</title>
<link>https://taboege.de</link>
<description>Blog taboege.de</description>
<pubDate>Wed,  6 May 2026 12:19:47 +0000</pubDate>
<docs>https://cyber.harvard.edu/rss/rss.html</docs>
<webMaster>Tobias Boege</webMaster>

<item>
<title>Maximum entropy principle, Copy lemma and information inequalities</title>
<link>/blog/2025/09/Maximum-entropy-principle--Copy-lemma-and-information-inequalities</link>
<description>&#x3C;p&#x3E;I present the Maximum entropy principle in information theory as a way to tweak probability distributions into more special positions while preserving some of their marginal entropies.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>copy-lemma, information-inequalities, maximum-entropy, conditional-independence</category>
<guid isPermaLink="true">/blog/2025/09/Maximum-entropy-principle--Copy-lemma-and-information-inequalities</guid>
<pubDate>Fri, 12 Sep 2025 00:00:00 +0000</pubDate>
</item>
<item>
<title>Counting combinatorial objects using SAT solvers</title>
<link>/blog/2025/02/Counting-combinatorial-objects-using-SAT-solvers</link>
<description>&#x3C;p&#x3E;This is a short article on how to compute the numbers of combinatorial objects using a model counter. At the end I provide challenges in the form of CNF files for open counting problems.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>antimatroids, gaussoids, semigraphoids, matroids, forknesses, sat-solvers, oeis</category>
<guid isPermaLink="true">/blog/2025/02/Counting-combinatorial-objects-using-SAT-solvers</guid>
<pubDate>Fri, 28 Feb 2025 00:00:00 +0000</pubDate>
</item>
<item>
<title>Computing the characteristic set of a quasiaffine variety</title>
<link>/blog/2025/01/Computing-the-characteristic-set-of-a-quasiaffine-variety</link>
<description>&#x3C;p&#x3E;Given a system of polynomial equations and inequations with integer coefficients, one can compute the set of characteristics of fields over which the system has a solution. This is proved constructively in books on model theory, but the given procedure is usually rather complicated to implement. This article shows how to do it in practice using Gr&#xF6;bner bases as a blackbox and presents a toy application computing the characteristic sets of some small matroids.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>algebraic-geometry, groebner-basis, model-theory, matroid</category>
<guid isPermaLink="true">/blog/2025/01/Computing-the-characteristic-set-of-a-quasiaffine-variety</guid>
<pubDate>Wed,  8 Jan 2025 00:00:00 +0000</pubDate>
</item>
<item>
<title>Keeping mathematical software working and available</title>
<link>/blog/2024/02/Keeping-mathematical-software-working-and-available</link>
<description>&#x3C;p&#x3E;This article is about the use of containers in the context of mathematical research data. Container image build files document the often complex setup of custom mathematical software and make it repeatable. The resulting image can be shared to avoid any setup at all. The image also acts as an archive recording the versions of the software and all its dependencies which made the computation work.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>mathematical-software, containers, research-data, reproducibility</category>
<guid isPermaLink="true">/blog/2024/02/Keeping-mathematical-software-working-and-available</guid>
<pubDate>Sat,  3 Feb 2024 00:00:00 +0000</pubDate>
</item>
<item>
<title>On prose in math papers</title>
<link>/blog/2022/05/On-prose-in-math-papers</link>
<description>&#x3C;p&#x3E;This is an apology for writing prose in mathematics papers (and a clarification of what I mean by &#x201C;prose&#x201D;).&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>writing-mathematics</category>
<guid isPermaLink="true">/blog/2022/05/On-prose-in-math-papers</guid>
<pubDate>Sat, 28 May 2022 00:00:00 +0000</pubDate>
</item>
<item>
<title>First-order objects in algebraic geometry</title>
<link>/blog/2022/05/First-order-objects-in-algebraic-geometry</link>
<description>&#x3C;p&#x3E;Some properties of varieties over the complex numbers do not change when the variety (via its defining equations which must have integral coefficients) is instead considered over sufficiently large finite fields of sufficiently large characteristic. This phenomenon can be explained via symbolic algorithms in computer algebra, particularly Gr&#xF6;bner bases.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>algebraic-geometry, model-theory, lefschetz-principle, finite-field</category>
<guid isPermaLink="true">/blog/2022/05/First-order-objects-in-algebraic-geometry</guid>
<pubDate>Sat, 21 May 2022 00:00:00 +0000</pubDate>
</item>
<item>
<title>Document preparation at home vs. the arXiv</title>
<link>/blog/2022/05/Document-preparation-at-home-vs--the-arXiv</link>
<description>&#x3C;p&#x3E;I describe the two more subtle problems I used to run into when submitting papers to the arXiv and their solutions.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>arxiv, latex, publishing</category>
<guid isPermaLink="true">/blog/2022/05/Document-preparation-at-home-vs--the-arXiv</guid>
<pubDate>Tue, 17 May 2022 00:00:00 +0000</pubDate>
</item>
<item>
<title>App::Muletracks - Downloader for Nugs.net</title>
<link>/blog/2022/05/App--Muletracks--Downloader-for-Nugs-net</link>
<description>&#x3C;p&#x3E;I present a Nugs.net downloader I wrote and which is now usable.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>perl, mojo, music, muletracks</category>
<guid isPermaLink="true">/blog/2022/05/App--Muletracks--Downloader-for-Nugs-net</guid>
<pubDate>Sun, 15 May 2022 00:00:00 +0000</pubDate>
</item>
<item>
<title>Locally finite cover on a primary basic semialgebraic set</title>
<link>/blog/2022/02/Locally-finite-cover-on-a-primary-basic-semialgebraic-set</link>
<description>&#x3C;p&#x3E;Any open cover of a primary basic semialgebraic set can be refined to a locally finite one. Here is an explicit proof of this fact when the cover consists of neighborhoods indexed by points from the set itself and which, after an initial adjustment of the sizes of the open sets, constructs a locally finite subcover, i.e., just removes redundant open sets. This detail matters when the points indexing the original cover have special significance elsewhere.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>semialgebraic-geometry, topology, axiom-of-choice, open-cover</category>
<guid isPermaLink="true">/blog/2022/02/Locally-finite-cover-on-a-primary-basic-semialgebraic-set</guid>
<pubDate>Fri, 11 Feb 2022 00:00:00 +0000</pubDate>
</item>
<item>
<title>On stable equivalence of semialgebraic sets</title>
<link>/blog/2022/02/On-stable-equivalence-of-semialgebraic-sets</link>
<description>&#x3C;p&#x3E;I give a counterexample to a claim in the book &#x201C;Realization spaces of polytopes&#x201D;. This counterexample shows that a fundamental definition in this book is (slightly, technically) wrong. I explain what causes the failure and how it might be fixed in a forthcoming note.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>semialgebraic-geometry, topology, stable-equivalence, universality</category>
<guid isPermaLink="true">/blog/2022/02/On-stable-equivalence-of-semialgebraic-sets</guid>
<pubDate>Wed,  9 Feb 2022 00:00:00 +0000</pubDate>
</item>
<item>
<title>On experimental mathematics</title>
<link>/blog/2021/07/On-experimental-mathematics</link>
<description>&#x3C;p&#x3E;Experimental mathematics uses computers to inspire research in terms of finding examples and counterexamples, suggesting conjectures or informing proof strategies. I present a strange phenomenon in this practice at two examples: it happens that mathematical software confirms conjectured properties of very large objects very quickly. Much, much more quickly than one might expect a general problem of that type to be solved. In these cases, the software apparently knows a &#x201C;proof&#x201D; of the conjecture and the human can either look it up in the source code or at least be more confident in the conjecture.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>mathematical-software, experimental-math, heuristics, open-source</category>
<guid isPermaLink="true">/blog/2021/07/On-experimental-mathematics</guid>
<pubDate>Sat, 17 Jul 2021 00:00:00 +0000</pubDate>
</item>
<item>
<title>A rational realization of &#x160;ime&#x10D;ek&#x27;s &#x2116; 85</title>
<link>/blog/2020/03/A-rational-realization-of-Simecek-s--85</link>
<description>&#x3C;p&#x3E;In his article &#x201C;Gaussian Representation of Independence Models over Four Random Variables&#x201D; Petr &#x160;ime&#x10D;ek gives realizations of all conditional independence models arising from (not necessarily regular) Gaussian distributions in dimension 4. Only one of these models, M85, is given with irrational correlations. Here I give a rational representation of this model. The question whether all Gaussian CI models are realizable by rational correlation matrices is still open and M85 was the only concrete undecided example I am aware of.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>ci, rationality, gaussian</category>
<guid isPermaLink="true">/blog/2020/03/A-rational-realization-of-Simecek-s--85</guid>
<pubDate>Fri, 20 Mar 2020 00:00:00 +0000</pubDate>
</item>
<item>
<title>tappp.hpp v0.2.0 released</title>
<link>/blog/2020/02/tappp-hpp-v0-2-0-released</link>
<description>&#x3C;p&#x3E;tappp.hpp is a header-only TAP producer for C++17.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>c++, tappp, testing</category>
<guid isPermaLink="true">/blog/2020/02/tappp-hpp-v0-2-0-released</guid>
<pubDate>Thu, 27 Feb 2020 00:00:00 +0000</pubDate>
</item>
<item>
<title>The computation of symmetry orbits of LUBF-gaussoids in dimension 8</title>
<link>/blog/2019/09/The-computation-of-symmetry-orbits-of-LUBF-gaussoids-in-dimension-8</link>
<description>&#x3C;p&#x3E;The symmetry reduction of &#x3C;code&#x3E;LUBF&#x3C;/code&#x3E;-gaussoids in dimension 8 was a tough nut. I learned that precomputing invariants of the symmetry classes first allows more intelligent distribution of tasks in a parallel symmetry reduction algorithm. In this case, I achieved a 160-fold speedup.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>perl, gaussoids, postgresql, mojo, sagemath, symmetry</category>
<guid isPermaLink="true">/blog/2019/09/The-computation-of-symmetry-orbits-of-LUBF-gaussoids-in-dimension-8</guid>
<pubDate>Wed,  4 Sep 2019 00:00:00 +0000</pubDate>
</item>
<item>
<title>bah! Another static site generator</title>
<link>/blog/2019/01/bah--Another-static-site-generator</link>
<description>&#x3C;p&#x3E;Yet another static site generator &#x2013; for a blog and homepage.&#x3C;/p&#x3E;
</description>
<author>Tobias</author>
<category>perl, vim, web</category>
<guid isPermaLink="true">/blog/2019/01/bah--Another-static-site-generator</guid>
<pubDate>Wed, 30 Jan 2019 00:00:00 +0000</pubDate>
</item>
</channel>
</rss>