The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals

A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the ordinarization transform, by removing its smallest non-zero non-gap (the multiplicity) and adding its largest gap (the Frobenius number). This gives another numerical semigroup and by repeating this transform several times we end up with an ordinary semigroup. The genus, that is, the number of gaps, is kept constant in all the transforms.This procedure allows the construction of a tree for each given genus containing all semigroups of that genus and rooted in the unique ordinary semigroup of that genus. We study here the regularity of these trees and the number of semigroups at each depth. For some depths it is proved that the number of semigroups increases with the genus and it is conjectured that this happens at all given depths. This may give some light to a former conjecture saying that the number of semigroups of a given genus increases with the genus.We finally give an identification between semigroups at a given depth in the ordinarization tree and semigroups with a given (large) number of gap intervals and we give an explicit characterization of those semigroups.     

Constructing numerical semigroups of a given genus

Let n _g denote the number of numerical semigroups of genus g. Bras-Amorós conjectured that n _g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree. We offer a new, simpler approach to counting numerical semigroups of a given genus. Our method gives direct constructions of families of numerical semigroups, without referring to the generators or the semigroup tree. In particular, we give an improved asymptotic lower bound for n _g .     

Bounds on the number of numerical semigroups of a given genus

Lower and upper bounds are given for the number n_g of numerical semigroups of genus g. The lower bound is the first known lower bound while the upper bound significantly improves the only known bound given by the Catalan numbers. In a previous work the sequence n_g is conjectured to behave asymptotically as the Fibonacci numbers. The lower bound proved in this work is related to the Fibonacci numbers and so the result seems to be in the direction to prove the conjecture. The method used is based on an accurate analysis of the tree of numerical semigroups and of the number of descendants of the descendants of each node depending on the number of descendants of the node itself.     

The set of numerical semigroups of a given genus

In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence relation is given over this set and a tree structure is defined for each equivalence class. We also provide a more efficient algorithm based on the translation of a numerical semigroup to its so-called Kunz-coordinates vector.     

Densities of maximal embedding dimension numerical semigroups

We define the density of a numerical semigroup and study the densities of all the maximal embedding dimension numerical semigroups with a fixed Frobenius number, as well as the possible Frobenius number for a fixed density. We also prove that for a given possible density, in the sense of Wilf’s conjecture, one can find a maximal embedding dimension numerical semigroup with that density.     

Towards a better understanding of the semigroup tree

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 by the first author. These regularities admit two different types of behavior and in this work we investigate which of the two types takes place for some well-known classes of semigroups. Also we study the question of what kind of chains appear in the tree and characterize the properties (like being (in)finite) thereof. We conclude with some thoughts that show how this study of the semigroup tree may help in solving the conjecture of Fibonacci-like behavior of the number of semigroups with given genus.     

The arithmetic extensions of a numerical semigroup

Abstract

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 arithmetic extension of a given numerical semigroup. As by-product, new explicit formulas for the Frobenius number and the genus of proportionally modular semigroups are obtained.     

Numerical semigroups of genus eight and double coverings of curves of genus three

The authors determine all possible numerical semigroups at ramification points of double coverings of curves when the covered curve is of genus three and the covering curve is of genus eight. Moreover, it is shown that all of such numerical semigroups are actually of double covering type.     

On Weierstrass semigroups of double covering of genus two curves

In this work we prove that are Weierstrass semigroups all numerical semigroups whose three first positive non-gaps are 6, 8 and 10, resolving the problem of the numerical semigroups that appear as Weierstrass semigroups in double coverings of genus two curves.     

The Frobenius problem for numerical semigroups

In this paper, we characterize those numerical semigroups containing 〈n₁,n₂〉. From this characterization, we give formulas for the genus and the Frobenius number of a numerical semigroup. These results can be used to give a method for computing the genus and the Frobenius number of a numerical semigroup with embedding dimension three in terms of its minimal system of generators.     

The maximum proportionally modular numerical semigroup with given multiplicity and ratio

We prove that the set of all proportionally modular numerical semigroups with fixed multiplicity and ratio has a maximum (with respect to set inclusion). We show that this maximum is a maximal embedding dimension numerical semigroup, for which we explicitly calculate its minimal system of generators, Frobenius number and genus.     

Fibonacci-like growth of numerical semigroups of a given genus

We give an asymptotic estimate of the number of numerical semigroups of a given genus. In particular, if n _g is the number of numerical semigroups of genus g, we prove that $$\lim_{g \rightarrow \infty} n_g \varphi^{-g} = S $$ where $\varphi = \frac{1 + \sqrt{5}}{2}$ is the golden ratio and S is a constant, resolving several related conjectures concerning the growth of n _g . In addition, we show that the proportion of numerical semigroups of genus g satisfying f<3m approaches 1 as g→∞, where m is the multiplicity and f is the Frobenius number.     

New results on the conjecture of Rhodes and on the topological conjecture

The Conjecture of Rhodes, originally called the “type II conjecture” by Rhodes, gives an algorithm to compute the kernel of a finite semigroup. This conjecture has numerous important consequences and is one of the most attractive problems on finite semigroups. It was known that the conjecture of Rhodes is a consequence of another conjecture on the finite group topology for the free monoid. In this paper, we show that the topological conjecture and the conjecture of Rhodes are both equivalent to a third conjecture and we prove this third conjecture in a number of significant particular cases.     

Levi’s Commutator Theorems for Cancellative Semigroups

A conjecture of Padmanabhan, on provability in cancellative semigroups, is addressed. Several of Levi’s group theory commutator theorems are proved for cancellative semigroups. The proofs, found by automated deduction, support the conjecture.     

Numerical semigroups with large embedding dimension satisfy Wilf’s conjecture

We give an affirmative answer to Wilf??s conjecture for numerical semigroups satisfying 2????m, where ?? and m are respectively the embedding dimension and the multiplicity of a semigroup. The conjecture is also proved when m??8 and when the semigroup is generated by a generalized arithmetic sequence.     

On the enumeration of the set of saturated numerical semigroups of a given genus

In this paper we present an algorithm for computing the set of saturated numerical semigroups of a given genus. We see how the set of saturated numerical semigroups can be arranged in a tree rooted in \(\mathbb{N}\) and we describe the sons of any vertex of this tree.     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.     

Dihedral semigroups,their defining relations and an application to describing knot semigroups of rational links

It is known that a knot (link) is rational if and only if its \(\pi \)-orbifold group is dihedral. A semigroup version of this result has been formulated as a conjecture. Working towards proving the conjecture, we describe certain semigroups associated with twist links, clarify how these semigroups are related to dihedral groups and find defining relations of these semigroups.     

The dynamics of semigroups of transcendental entire functions II

We introduce the concept of escaping set for semigroups of transcendental entire functions using Fatou-Julia theory. Several results of the escaping set associated with the iteration of one transcendental entire function have been extended to transcendental semigroups. We also investigate the properties of escaping sets for conjugate semigroups and abelian transcendental semigroups. Several classes of transcendental semigroups for which Eremenko’s conjecture holds have been provided.