<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Combinatorics on Akkeyre's Blog</title><link>https://akkeyre.pages.dev/tags/combinatorics/</link><description>Recent content in Combinatorics on Akkeyre's Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Mon, 13 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://akkeyre.pages.dev/tags/combinatorics/index.xml" rel="self" type="application/rss+xml"/><item><title>Combinatorial Properties of the Permanent</title><link>https://akkeyre.pages.dev/posts/permanent-combinatorics/</link><pubDate>Mon, 13 Apr 2026 00:00:00 +0000</pubDate><guid>https://akkeyre.pages.dev/posts/permanent-combinatorics/</guid><description>The permanent of a matrix is the forgotten twin of the determinant — identical in definition, wildly different in behaviour. We explore its combinatorial meaning, key identities, and hardness.</description></item></channel></rss>