Related papers: Ordinarization numbers of numerical semigroups

In this work, we study good semigroups of $\mathbb{N}^n$ introducing the definition of length and genus for these objects. We show how to count the local good semigroup with a fixed genus. Furthermore, we study the relationships of these…

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 study suitable parameters and relations in a numerical semigroup S. When S is the Weierstrass semigroup at a rational point P of a projective curve C, we evaluate the Feng-Rao order bound of the associated family of Goppa codes. Further…

In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…

In this paper we present a procedure to build the set of irreducible numerical semigroups with a fixed Frobenius number. The construction gives us a rooted tree structure for this set. Furthermore, by using the notion of Kunz-coordinates…

In this paper we introduce a particular semigroup transform $\mathcal{A}$ that fixes the invariants involved in Wilf's conjecture, except the embedding dimension. It also allows one to arrange the set of not ordinary and not irreducible…

Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…

Given a polynomial ring $P$ over a field $K$, an element $g \in P$, and a $K$-subalgebra $S$ of $P$, we deal with the problem of saturating $S$ with respect to $g$, i.e. computing $Sat_g(S) = S[g, g^{-1}]\cap P$. In the general case we…

This paper studies Young diagrams of symmetric and pseudo-symmetric numerical semigroups and describes new operations on Young diagrams as well as numerical semigroups. These provide new decompositions of symmetric and pseudo-symmetric…

Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…

We show that, for any fixed genus $g$, the ordinary generating function for the genus $g$ partitions of an $n$-element set into $k$ blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a…

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.…

In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…

In this paper, we study averaging operators from an algebraic and combinatorial point of view. We first construct free averaging algebras in terms of a class of bracketed words called averaging words. We next apply this construction to…

There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…

The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…

This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…

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…

In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed earlier. These regularites admit two different types of behavior and in this work we investigate which…