Computation of the -primality and asymptotic -primality with applications to numerical semigroups.
From MaRDI portal
Publication:2339617
Abstract: We give an algorithm to compute the -primality of finitely generated atomic monoids. Asymptotic -primality is also studied and a formula to obtain it in finitely generated quasi-Archimedean monoids is proven. The formulation is applied to numerical semigroups, obtaining an expression of this invariant in terms of its system of generators.
Recommendations
- An algorithm to compute -primality in a numerical monoid.
- \(\omega \)-primality in arithmetic Leamer monoids
- An improved algorithm to compute the \(\omega\)-primality
- On the linearity of \(\omega\)-primality in numerical monoids.
- Measuring primality in numerical semigroups with embedding dimension three.
Cites work
- scientific article; zbMATH DE number 5363552 (Why is no real title available?)
- scientific article; zbMATH DE number 1438385 (Why is no real title available?)
- scientific article; zbMATH DE number 3216273 (Why is no real title available?)
- An algorithm to compute -primality in a numerical monoid.
- Atomic commutative monoids and their elasticity.
- Chains of factorizations in weakly Krull domains
- Factorization invariants in half-factorial affine semigroups.
- HOW FAR IS AN ELEMENT FROM BEING PRIME?
- Irreducible ideals of finitely generated commutative monoids
- Local tameness of \(v\)-Noetherian monoids.
- Non-unique factorizations. Algebraic, combinatorial and analytic theory
- On a generalization of the exchange property to modules with semilocal endomorphism rings.
- On commutative, nonpotent archimedean semigroups
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids.
- numericalsgps, a GAP package for numerical semigroups
Cited in
(18)- On the omega values of generators of embedding dimension-three numerical monoids generated by an interval
- Factorization invariants of Puiseux monoids generated by geometric sequences
- On divisor-closed submonoids and minimal distances in finitely generated monoids
- How do you measure primality?
- On the linearity of \(\omega\)-primality in numerical monoids.
- \(\omega \)-primality in arithmetic Leamer monoids
- Factorizations of the same length in abelian monoids
- Factorization length distribution for affine semigroups. I: Numerical semigroups with three generators
- Factorization invariants in numerical monoids
- Measuring primality in numerical semigroups with embedding dimension three.
- Factorization invariants of the additive structure of exponential Puiseux semirings
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- An improved algorithm to compute the \(\omega\)-primality
- On dynamic algorithms for factorization invariants in numerical monoids
- Class group and factorization in orders of a PID
- The computation of factorization invariants for affine semigroups
- An algorithm to compute -primality in a numerical monoid.
- On factorization invariants and Hilbert functions
This page was built for publication: Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339617)
