<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>数学小品 on vegetablefj</title><link>https://vegetablefj.github.io/blog/categories/%E6%95%B0%E5%AD%A6%E5%B0%8F%E5%93%81/</link><description>Recent content in 数学小品 on vegetablefj</description><generator>Hugo</generator><language>zh-cn</language><copyright>vegetablefj</copyright><lastBuildDate>Sun, 26 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://vegetablefj.github.io/blog/categories/%E6%95%B0%E5%AD%A6%E5%B0%8F%E5%93%81/rss.xml" rel="self" type="application/rss+xml"/><item><title>n-循环的Molien级数</title><link>https://vegetablefj.github.io/blog/post/2026/04/24/molien/</link><pubDate>Fri, 24 Apr 2026 07:44:23 +0800</pubDate><guid>https://vegetablefj.github.io/blog/post/2026/04/24/molien/</guid><description>Molien公式 Molien公式告诉我们, 对于有限群$G$和其在域$k$上的表示$(V,\rho:G\to \mathrm{GL}(V))$, 使得$\mathrm{char}</description></item></channel></rss>