Related papers: Algorithms for Generalized Numerical Semigroups

We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…

We investigate complement-finite submonoids of the monoid of nonnegative integer points of a unipotent linear algebraic group $G$. These monoids are in general noncommutative but they specialize to the generalized numerical monoids of…

Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…

We study numerical semigroups with the property "multiplicity= embedding dimension+1", generated by concatenation of arithmetic sequences.

A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…

In this paper we present a new kind of semigroups called convex body semigroups which are generated by convex bodies of R^k. They generalize to arbitrary dimension the concept of proportionally modular numerical semigroup of [7]. Several…

We find a relation between the genus of a quotient of a numerical semigroup $S$ and the genus of $S$ itself. We use this identity to compute the genus of a quotient of $S$ when $S$ has embedding dimension $2$. We also exhibit identities…

The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…

We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers,…

This work considers a generalization of Grover's search problem, viz., to find any one element in a set of acceptable choices which constitute a fraction f of the total number of choices in an unsorted data base. An infinite family of…

Numerical monoids (cofinite, additive submonoids of the non-negative integers) arise frequently in additive combinatorics, and have recently been studied in the context of factorization theory. Arithmetical numerical monoids, which are…

Let $G$ be a finite group. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that…

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…

Motivated by the change-making problem, we extend the notion of greediness to sets of positive integers not containing the element $1$, and from there to numerical semigroups. We provide an algorithm to determine if a given set (not…

We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…

In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing the structure of a finite semigroup from a generating set. As was the case with the original algorithm of Froidure and Pin, the algorithms presented…

Let $\Bbbk$ be an arbitrary field and let $b > 1, n > 1$ and $a$ be three positive integers. In this paper we explicitly describe a minimal $S-$graded free resolution of the semigroup algebra $\Bbbk[S]$ when $S$ is a generalized repunit…

Let $\mathcal{O}$ be an order, that is a commutative ring with $1$ whose additive structure is a free $\mathbb{Z}$-module of finite rank. A generalized number system (GNS for short) over $\mathcal{O}$ is a pair $(p,\mathcal{D} )$ where…