2016
DOI: 10.1007/978-3-319-38855-7_7
|View full text |Cite
|
Sign up to set email alerts
|

An Overview of the Computational Aspects of Nonunique Factorization Invariants

Abstract: ABSTRACT. We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 24 publications
(27 citation statements)
references
References 37 publications
0
27
0
Order By: Relevance
“…The study of these simplicial affine semigroups may be an interesting topic for further research. Thirdly, it is possible that some non-unique factorization invariants ( [17,14] and [2, Chapter 5]) may be computed or bounded for Betti divisible semigroups. Again this topic is not related with isolated factorizations and, therefore, we did not dig into this topic in the present work.…”
Section: Further Researchmentioning
confidence: 99%
See 1 more Smart Citation
“…The study of these simplicial affine semigroups may be an interesting topic for further research. Thirdly, it is possible that some non-unique factorization invariants ( [17,14] and [2, Chapter 5]) may be computed or bounded for Betti divisible semigroups. Again this topic is not related with isolated factorizations and, therefore, we did not dig into this topic in the present work.…”
Section: Further Researchmentioning
confidence: 99%
“…The set of the Betti elements of M is denoted by Betti(M ). Betti elements and their R-classes can be used to characterize the minimal presentations of M , see Section 2.5, and, thus, they are widely studied in the theory of commutative monoids (see for instance [15,14]…”
Section: Introductionmentioning
confidence: 99%
“…Such minimal presentations arise in the study of toric ideals, where they correspond to minimal generating sets for kernels of monomial maps [7], and algebraic statistics, where they correspond to Markov bases [9]. Additionally, many arithmetic invariants of interest in combinatorial commutative algebra and factorization theory can be easily recovered (both theoretically and computationally) from a minimal presentation, making them a particularly useful tool in computational algebra [10,14].…”
Section: Introductionmentioning
confidence: 99%
“…Our intention is to provide as many functions as possible for affine semigroups as we offer for numerical semigroups. Along this line, we present methods for membership, computing minimal presentations, determine gluings, Betti and primitive elements, and the whole series of procedures for nonunique factorization invariants (an overview of the existing methods for the calculation of these invariants can be found in [30]). New procedures are now under development based in Hilbert functions and binomial ideals ( [37]).…”
Section: 4mentioning
confidence: 99%