Related papers: On quotients of numerical semigroups for almost ar…

Given a numerical semigroup $S$ and a positive integer $p$, the quotient $\frac{S}{p}=\{x\in \mathbb{N} \mid px\in S\}$ also forms a numerical semigroup. In this paper, we first characterize the Ap\'ery set for a class of quotients of…

Given three pairwise coprime positive integers $a_1,a_2,a_3 \in \mathbb{Z}^+$ we show the existence of a relation between the sets of the first elements of the three quotients $\frac{\langle a_i,a_j \rangle}{a_k}$ that can be made for every…

For given positive integers $a_1,a_2,\dots,a_k$ with $\gcd(a_1,a_2,\dots,a_k)=1$, the denumerant $d(n)=d(n;a_1,a_2,\dots,a_k)$ is the number of nonnegative solutions $(x_1,x_2,\dots,x_k)$ of the linear equation $a_1 x_1+a_2 x_2+\dots+a_k…

For $p>0$ a small parameter, let $\mathcal A \subseteq \mathbb{Z}_{>0}$ be a random subset where each positive integer is included independently with probability $p$. We show that, with high probability (as $p \to 0$), the numerical…

We propose a class of generating functions denoted by $\textrm{RGF}_p(x)$, which is related to the Sylvester denumerant for the quotients of numerical semigroups. Using MacMahon's partition analysis, we can obtain $\textrm{RGF}_p(x)$ by…

Let a, k, h, c be positive integers and d a non zero integer. Recall that a numerical generalized almost arithmetic semigroup S is a semigroup minimally generated by relatively prime positive integers a, ha + d, ha + 2d, . . . , ha + kd, c,…

We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…

This work delves into the {\it quotient of an affine semigroup by a positive integer}, exploring its intricate properties and broader implications. We unveil an {\it associated tree} that serves as a valuable tool for further analysis.…

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…

We find a relation between the genus of a quotient of a numerical semigroup $S$ and the genus of $S$ itself. We use this identity to compute the genus of a quotient of $S$ when $S$ has embedding dimension $2$. We also exhibit identities…

We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…

Let $\Delta$ be a numerical semigroup and let $d\ge 2$ be an integer. We study the fiber of the quotient map \(S\mapsto S/d\) over $\Delta$. We describe its elements as semigroups of the form $\langle X\rangle+d\Delta$, for suitable finite…

In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…

We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our…

A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…

Let $a,b$ be positive integers. In this note, we study the numerical semigroup $H=\left<a,a+1,b\right>$ and and the associated numerical semigroup ring $R=k[[H]]$. Under the certain conditions, we provide explicit formulas for the Frobenius…

The so-called Frobenius number in the famous linear Diophantine problem of Frobenius is the largest integer such that the linear equation $a_1 x_1+\cdots+a_k x_k=n$ ($a_1,\dots,a_k$ are given positive integers with $\gcd(a_1,\dots,a_k)=1$)…

For a nonnegative integer $p$, we give explicit formulas for the $p$-Frobenius number and the $p$-genus of generalized Fibonacci numerical semigroups. Here, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose…

Let $A=(a_1, a_2, ..., a_n)$ be relative prime positive integers with $a_i\geq 2$. The Frobenius number $F(A)$ is the largest integer not belonging to the numerical semigroup $\langle A\rangle$ generated by $A$. The genus $g(A)$ is the…

In the Frobenius problem we are given a set of coprime, positive integers $a_1, a_2,...,a_k$, and are interested in the set of positive numbers NR that have no representation by the linear form $\sum_i a_ix_i$ in nonnegative integers $x_1,…