Related papers: Certified algorithms for numerical semigroups in R…
We derive the polynomial representations for minimal relations of generating set of numerical semigroups R_n^k=<(n-1)^k,n^k,(n+1)^k>, k=2,3,4, n>2. We find also the polynomial representations for degrees of syzygies in the Hilbert series…
The package numericalsgps performs computations with and for numerical semigroups. Recently also affine semigroups are admitted as objects for calculations. This manuscript is a survey of what the package does, and at the same time of the…
This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…
We propose a novel group testing method, termed semi-quantitative group testing, motivated by a class of problems arising in genome screening experiments. Semi-quantitative group testing (SQGT) is a (possibly) non-binary pooling scheme that…
This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical…
A numerical semigroup $S$ is a cofinite, additively-closed subset of the nonnegative integers that contains $0$. In this paper, we initiate the study of atomic density, an asymptotic measure of the proportion of irreducible elements in a…
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…
For a nonnegative integer $p$, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose nonnegative integral linear combinations of given positive integers $a_1,a_2,\dots,a_\kappa$ with $\gcd(a_1,a_2,\dots,a_\kappa)=1$ are…
We introduce a new way of counting numerical semigroups, namely by their maximum primitive, and show its relation with the counting of numerical semigroups by their Frobenius number. We show that these two ways of counting are M\"obius…
A natural operation on numerical semigroups is taking a quotient by a positive integer. If $\mathcal S$ is a quotient of a numerical semigroup with $k$ generators, we call $\mathcal S$ a $k$-quotient. We give a necessary condition for a…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
In this work we will show that if $F$ is a positive integer, then the set ${\mathrm{Arf}}(F)=\{S\mid S \mbox{ is an Arf numerical semigroup with Frobenius number } F\}$ verifies the following conditions: 1) $\Delta(F)=\{0,F+1,\rightarrow\}$…
Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…
In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…
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.…
Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…
Numerical semigroup rings are investigated from the relative viewpoint. It is known that algebraic properties such as singularities of a numerical semigroup ring are properties of a flat numerical semigroup algebra. In this paper, we show…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…
Motivated by a promotion to increase the number of musical downloads, we introduce the concept of $C$-incentive and show an algorithm that compute the smallest $C$-incentive containing a subset $X \subseteq {\mathbb N}$. On the other hand,…