Related papers: Minimal free resolution of generalized repunit alg…

We construct a minimal free resolution of the semigroup ring k[C] in terms of minimal resolutions of k[A] and k[B] when <C> is a numerical semigroup obtained by gluing two numerical semigroups <A> and <B>. Using our explicit construction,…

Numerical semigroups with multiplicity $m$ are parameterized by integer points in a polyhedral cone $C_m$, according to Kunz. For the toric ideal of any such semigroup, the main result here constructs a free resolution whose overall…

In this paper, we introduce and study the numerical semigroups generated by $\{a_1, a_2, \ldots \} \subset \mathbb{N}$ such that $a_1$ is the repunit number in base $b > 1$ of length $n > 1$ and $a_i - a_{i-1} = a\, b^{i-2},$ for every $i…

Let $\mm=(m_0,m_1,m_2,n)$ be an almost arithmetic sequence, i.e., a sequence of positive integers with ${\rm gcd}(m_0,m_1,m_2,n) = 1$, such that $m_0<m_1<m_2$ form an arithmetic progression, $n$ is arbitrary and they minimally generate the…

Each numerical semigroup $S$ with smallest positive element $m$ corresponds to an integer point in a polyhedral cone $C_m$, known as the Kunz cone. The faces of $C_m$ form a stratification of numerical semigroups that has been shown to…

We present a general algorithm for constructing a free resolution for unit groups of orders in semisimple rational algebras. The approach is based on computing a contractible $G$-complex employing the theory of minimal classes of quadratic…

Let $\mathbb{N}^{d}$ be the $d$-dimensional monoid of non-negative integers. A generalized numerical semigroup is a submonoid $ S\subseteq \mathbb{N}^d$ such that $H(S)=\mathbb{N}^d \setminus S$ is a finite set. We introduce irreducible…

We study the minimal bigraded free resolution of an ideal with three generators of the same bidegree, contained in the bihomogeneous maximal ideal $ \langle s,t\rangle \cap \langle u,v \rangle$ of the bigraded ring K[s,t;u,v]. Our analysis…

With a view to study problems of smoothability, we construct a minimal free resolution for the coordinate ring of an algebroid monomial curve associated to an $AS$ numerical semigroup (i.e. generated by an arithmetic sequence), obtained…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…

Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this…

Let $R:= \Bbbk[x_1,\ldots,x_{n}]$ be a polynomial ring over a field $\Bbbk$, $I \subset R$ be a homogeneous ideal with respect to a weight vector $\omega = (\omega_1,\ldots,\omega_n) \in (\mathbb{Z}^+)^n$, and denote by $d$ the Krull…

Let $k$ be a field and let $A=\bigoplus_{n\ge 1}A_n$ be a positively graded $k$-algebra. We recall that $A$ is graded nilpotent if for every $d\ge 1$, the subalgebra of $A$ generated by elements of degree $d$ is nilpotent. We give a method…

Let $A=K[a_1,\ldots,a_n]$ be a weighted $\mathbb{N}$-filtered solvable polynomial algebra with filtration $FA=\{ F_pA\}_{p\in\mathbb{N}}$, where solvable polynomial algebras are in the sense of (A. Kandri-Rody and V. Weispfenning,…

Let $\mm=(m_0,...,m_n)$ be an arithmetic sequence, i.e., a sequence of integers $m_0<...<m_n$ with no common factor that minimally generate the numerical semigroup $\sum_{i=0}^{n}m_i\N$ and such that $m_i-m_{i-1}=m_{i+1}-m_i$ for all…

A free numerical semigroup is a submonoid of the non-negative integers with finite complement that is additively generated by the terms in a telescopic sequence with gcd 1. However, such a sequence need not be minimal, which is to say that…

A numerical semigroup is a submonoid of ${\mathbb Z}_{\ge 0}$ whose complement in ${\mathbb Z}_{\ge 0}$ is finite. For any set of positive integers $a,b,c$, the numerical semigroup $S(a,b,c)$ formed by the set of solutions of the inequality…

For a fixed positive integer $d$ and a small real $p>0$, sample a $p$-random subset $A \subseteq \mathbb{Z}_{\geq 0}^d$, and let $S:=\langle A \rangle$ be the generalized numerical semigroup generated by $A$. We show that with high…