2000 character limit reached
Minimal free resolution of generalized repunit algebras
Published 10 Dec 2023 in math.AC | (2312.06013v2)
Abstract: Let $\Bbbk$ be an arbitrary field and let $b > 1, n > 1$ and $a$ be three positive integers. In this paper we explicitly describe a minimal $S-$graded free resolution of the semigroup algebra $\Bbbk[S]$ when $S$ is a generalized repunit numerical semigroup, that is, when $S$ is the submonoid of $\mathbb{N}$ generated by ${a_1, a_2, \ldots, a_n}$ where $a_1 = \sum_{j=0}{n-1} bj$ and $a_i - a_{i-1} = a\, b{i-2},\ i = 2, \ldots, n$, with $\gcd(a,a_1) = 1$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.