相关论文: Arf good semigroups with fixed conductor
The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.
We introduce some general tools to design exact splitting methods to compute numerically semigroups generated by inhomogeneous quadratic differential operators. More precisely, we factorize these semigroups as products of semigroups that…
Let $S$ and $\mathcal{C}$ be affine semigroups in $\mathbb{N}^d$ such that $S\subseteq \mathcal{C}$. We provide a characterization for the set $\mathcal{C}\setminus S$ to be finite, together with a procedure and computational tools to check…
We analyze Fourier hyperfunction and hyperfunction semigroups with non-densely defined generators and their connections with local convoluted $C$-semigroups. Structural theorems and spectral characterizations give necessary and sufficient…
For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many…
Let n_g denote the number of numerical semigroups of genus g. Bras-Amoros 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 present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
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…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
For sufficiently nice families of semigroups and monoids, the structure theorem for sets of length states that the length set of any sufficiently large element is an arithmetic sequence with some values omitted near the ends. In this paper,…
In this paper we characterize when a Cayley automaton semigroup is a group, is trivial, is finite, is free, is a left zero semigroup, or is a right zero semigroup.
The class of good semigroups is a class of subsemigroups of $N^h$, that includes the value semigroups of rings associated to curve singularities and their blowups, and allows to study combinatorically the properties of these rings. In this…
We describe new families of Eliahou semigroups, encompassing previous families described by Delgado, Eliahou and Fromentin, and Bras-Amor\'os. A crucial parameter is a Farey interval associated to the semigroup. We show that these…
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…
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,…
In this paper we give a construction for a special type of congruences on commutative semigroups. We apply our result for the multiplicative semigroup of all positive integers.
Our goal is to find classes of convolution semigroups on Lie groups $G$ that give rise to interesting processes in symmetric spaces $G/K$. The $K$-bi-invariant convolution semigroups are a well-studied example. An appealing direction for…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
The purpose of this paper is to compute the non-zero semigroup determinant of the class of finite semigroups in which every two idempotents commute. This class strictly contains the class of finite semigroups that have central idempotents…