Related papers: Arf good semigroups with fixed genus
A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…
Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, Keith and Nath illustrated an injection from numerical semigroups to integer partitions. We explore this connection between partitions and numerical…
Every numerical semigroup can be expressed as an intersection of irreducible numerical semigroups. We show that the unions of sets of lengths of factorizations of numerical semigroups into irreducible numerical semigroups are all equal to…
In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…
Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…
We prove that, for each fixed genus, the portion of semigroups of that genus belonging to infinite chains in the semigroup tree approaches 0 as the genus grows to infinite. This means that most numerical semigroups have a finite number of…
This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical…
We give an algebraic characterization of half-factorial orders in algebraic number fields. This generalizes prior results for seminormal orders and for orders in quadratic number fields.
In this paper we present a mathematical formulation for the omega invariant of a numerical semigroup for each of its minimal generators. The model consists of solving a problem of optimizing a linear function over the efficient set of a…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
Firstly, we introduce a class of new algebraic systems which generalize Hopf quasigroups and Hopf $\pi-$algebras called $Q$-graded Hopf quasigroups, and research some properties of them. Secondly, we define the representations of $Q$-graded…
In this paper we study the limit theory of numerical semigroups with two generators. We give a complete axiomatization in some cases.
A numerical semigroup is a submonoid of $\mathbb N$ with finite complement in $\mathbb N$. A generalized numerical semigroup is a submonoid of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. In the context of numerical…
For any $n$-ary associative algebra we construct a $\Z_{n-1}$ graded algebra, which is a universal object containing the $n$-ary algebra as a subspace of elements of degree 1. Similar construction is carried out for semigroups.
Let $S$ and $\Delta$ be numerical semigroups. A numerical semigroup $S$ is an $\mathbf{I}(\Delta)$-{\it semigroup} if $S\backslash \{0\}$ is an ideal of $\Delta$. We will denote by $\mathcal{J}(\Delta)=\{S \mid S \text{ is an…
We extend and deepen the theory of functional calculus for semigroup generators, based on the algebra $\mathcal B$ of analytic Besov functions, which we initiated in a previous paper. In particular, we show that our construction of the…
Passing from arithmetic schemes to algebraic schemes, in a similar manner we will have the computation of the \'etale fundamental group of an algebraic scheme and then will define and discuss the qc fundamental group of an algebraic scheme…
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…