affine semigroups
Recently Published Documents


TOTAL DOCUMENTS

51
(FIVE YEARS 9)

H-INDEX

8
(FIVE YEARS 1)

2021 ◽  
Vol 14 (4) ◽  
pp. 617-630
Author(s):  
Christopher O’Neill ◽  
Isabel White


Author(s):  
Raheleh Jafari ◽  
Marjan Yaghmaei
Keyword(s):  


2021 ◽  
Vol 569 ◽  
pp. 442-465
Author(s):  
Roberto Díaz ◽  
Alvaro Liendo
Keyword(s):  


2021 ◽  
Vol 102 (2) ◽  
pp. 340-356
Author(s):  
Tristram Bogart ◽  
John Goodrick ◽  
Kevin Woods




Author(s):  
STEPHAN RAMON GARCIA ◽  
MOHAMED OMAR ◽  
CHRISTOPHER O’NEILL ◽  
TIMOTHY WESLEY

Abstract For numerical semigroups with a specified list of (not necessarily minimal) generators, we describe the asymptotic distribution of factorization lengths with respect to an arbitrary modulus. In particular, we prove that the factorization lengths are equidistributed across all congruence classes that are not trivially ruled out by modular considerations.



2020 ◽  
Vol 309 (2) ◽  
pp. 353-380
Author(s):  
Jürgen Herzog ◽  
Raheleh Jafari ◽  
Dumitru I. Stamate
Keyword(s):  


2020 ◽  
Vol 75 (3) ◽  
Author(s):  
J. D. Díaz-Ramírez ◽  
J. I. García-García ◽  
A. Sánchez-R.-Navarro ◽  
A. Vigneron-Tenorio


Author(s):  
Carmelo Cisto ◽  
Manuel Delgado ◽  
Pedro A. García-Sánchez

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of [Formula: see text] with finite complement in [Formula: see text]. These semigroups are affine semigroups, which in particular implies that they are finitely generated. For a given finite set of elements in [Formula: see text] we show how to deduce if the monoid spanned by this set is a generalized numerical semigroup and, if so, we calculate its set of gaps. Also, given a finite set of elements in [Formula: see text] we can determine if it is the set of gaps of a generalized numerical semigroup and, if so, compute the minimal generators of this monoid. We provide a new algorithm to compute the set of all generalized numerical semigroups with a prescribed genus (the cardinality of their sets of gaps). Its implementation allowed us to compute (for various dimensions) the number of numerical semigroups of higher genus than has previously been computed.



2019 ◽  
Vol 19 (05) ◽  
pp. 2050082 ◽  
Author(s):  
Pedro A. García-Sánchez ◽  
Andrés Herrera-Poyatos

We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups. We also generalize [Formula: see text]-rectangular numerical semigroups to the context of simplicial affine semigroups and study their isolated factorizations. As a consequence of our results, we characterize those complete intersection simplicial affine semigroups with only one Betti minimal element in several ways. Moreover, we define Betti sorted and Betti divisible simplicial affine semigroups and characterize them in terms of gluings and their minimal presentations. Finally, we determine all the Betti divisible numerical semigroups, which turn out to be those numerical semigroups that are free for any arrangement of their minimal generators.



Sign in / Sign up

Export Citation Format

Share Document