Related papers: Arf good semigroups with fixed conductor
In this paper, we introduce the notion of strongly automatic semigroup, which implies the usual notion of auto- maticity. We focus on semigroups of \beta-adics developpements, for which we obtain a criterion of strong automaticity.
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
In this article we formulate a version of the analytic Novikov conjecture for semigroups rather than groups, and show that the descent argument from coarse geometry generalises effectively to this new situation.
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
In this paper we study numerical semigroups containing a given positive integer and closed with respect to the action of an affine map. For such semigroups we find a minimal set of generators, their embedding dimension, their genus and…
Let $\mathcal{C}$ be a positive integer cone and $k\in \mathcal{C}$. A $\mathcal{C}$-semigroup $S$ is $k$-positioned if for every $h\in \mathcal{C}\setminus S$ we have that $k-h$ belongs to $S$. In this work, we focus on this family of…
We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…
We consider the hidden subgroup problem on the semi-direct product of cyclic groups $\Z_{N}\rtimes\Z_{p}$ with some restriction on $N$ and $p$. By using the homomorphic properties, we present a class of semi-direct product groups in which…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
In this article we discuss some applications of the construction of the Ap\'ery set of a good semigroup in $\mathbb{N}^d$ given in the previous paper [Partition of the complement of good semigroup ideals and Ap\'ery sets, Communications in…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. The size of its complement is called the genus and the largest number in the complement is called its Frobenius number. We consider the set of…
For the coordinate algebras of connected affine algebraic groups, we explore the problem of finding a presentation by generators and relations canonically determined by the group structure.
In this paper, the complete algebraic structure of finite semisimple group algebra of a normally monomial group is described. The main result is illustrated by computing the explicit Wedderburn decomposition of finite semisimple group…
Good semigroups form a class of submonoids of $\mathbb{N}^d$ containing the value semigroups of curve singularities. In this article, we describe a partition of the complements of good semigroup ideals, having as main application the…
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…
We introduce a new class of numerical semigroups, which we call the class of {\it acute} semigroups and we prove that they generalize symmetric and pseudo-symmetric numerical semigroups, Arf numerical semigroups and the semigroups generated…
Given a positive integer k, we investigate the class of numerical semigroups verifying the property that every two subsequent non gaps, smaller than the conductor, are spaced by at least k. These semigroups will be called k-sparse and…
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…