Related papers: Limit Semigroups with 2 Generators
In this paper we extend the Lumer-Phillips theorem to the context of two--parameter C_0-semigroup of contractions. That is, we characterize the infinitesimal generators of two--parameter C_0-semigroups of contractions. Conditions on the…
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…
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…
We consider exponential ultradistribution semigroups with non--densely defined generators and give structural theorems for ultradistribution semigroups. Also structural theorems for exponential ultradistribution semigroups are given.
For any numerical semigroup $S$, there are infinitely many numerical symmetric semigroups $T$ such that $S=\frac{T}{2}$ is their half. We are studying the Betti numbers of the numerical semigroup ring $K[T]$ when $S$ is a 3-generated…
Given a numerical semigroup $S$ and a positive integer $d$, the fraction $\frac{S}{d}=\{ x \in \mathbb{N} \ | \ dx \in S\}$ is again a numerical semigroup. In this paper we determine a generating set for $\frac{S}{d}$ in terms of the…
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…
The purpose of this note is to revisit the proof of the Gearhardt-Pr\"uss-Hwang-Greiner theorem for a semigroup S(t), following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on the norm…
We consider dense 2-generator multiplicative subgroups in $\mathbb C$ and show that for each point $z\in \mathbb C$ the set of limit values for the arguments of the powers of each generator at the point $z$ is either finite or is…
We present a perturbation result for generators of $C_0$-semigroups which can be considered as an operator theoretic version of the Weiss-Staffans perturbation theorem for abstract linear systems. The result are illustrated by applications…
Motivated by appearance of multisemigroups in the study of additive $2$-categories, we define and investigate the notion of a multisemigroup with multiplicities. This notion seems to be better suitable for applications in higher…
We propose a list of open problems in numerical semigroups.
We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.
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 augment the body of existing results on embedding finite semigroups of a certain type into 2-generator finite semigroups of the same type. The approach adopted applies to finite semigroups the idempotents of which form a band and also to…
An affine semigroup is a finitely generated subsemigroup of $(\mathbb Z_{\ge 0}^d, +)$, and a numerical semigroup is an affine semigroup with $d = 1$. A growing body of recent work examines shifted families of numerical semigroups, that is,…
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.
This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…
Methods from additive number theory are applied to construct families of finitely generated linear semigroups with intermediate growth.
We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…