Related papers: Numerical Semigroups Generated by Concatenation of…
Our aim in this paper is to initiate the study of exponent semigroups for rational matrices. We prove that every numerical semigroup is the exponent semigroup of some rational matrix. We also obtain lower bounds on the size of such matrices…
In this paper we present a complete description of a stochastic semigroup of finite-dimensional projections in Hilbert space. The geometry of such semigroups is characterized by the asymptotic behavior of the widths of compact subsets with…
We study the tangent cone at the origin and the Hilbert series for a family of numerical semigroups generated by concatenation of arithmetic sequences. We prove that all the concatenation classes have Cohen-Macaulay tangent cones except the…
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…
We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…
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…
We define the concentration of a numerical semigroup $S$ as $\mathsf{C}(S)=\max \left\{\text{next}_S(s)-s ~|~ s\in S \backslash \{0\}\right\}$ wherein $\text{next}_S(s)=\min\left\{x \in S ~|~ s<x\right\}$. In this paper, we study the class…
This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…
This paper is focused on numerical semigroups and presents a simple construction, that we call dilatation, which, from a starting semigroup $S$, permits to get an infinite family of semigroups which share several properties with $S$. The…
A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic…
A random group contains many quasiconvex surface subgroups.
We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's…
In this paper we present a new algorithm to calculate the set of Arf numerical semigroups with given conductor. Moreover, we extend the previous problem to the class of good semigroups, presenting procedures to compute the set of the Arf…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
In this paper, we give an introduction to basic concepts of automaton semigroups. While we must note that this paper does not contain new results, it is focused on extended introduction in the subject and detailed examples.
We introduce the quasi-ordinarization transform of a numerical semigroup. This transform will allow to organize all the semigroups of a given genus in a forest rooted at all quasi-ordinary semigroups with the given genus. This construction…
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…
Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…
Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$, and $T_n(\mathbb{K})$ be the set of $n\times n$ lower triangular matrices with entries in $\mathbb{K}$. We show that $T_n(\mathbb{K})$ has dense subsemigroups that are generated by $n+1$…