Pages that link to "Item:Q633183"
From MaRDI portal
The following pages link to An algorithm to compute \(\omega\)-primality in a numerical monoid. (Q633183):
Displaying 12 items.
- Semigroup-theoretical characterizations of arithmetical invariants with applications to numerical monoids and Krull monoids. (Q358929) (← links)
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup (Q420862) (← links)
- On the arithmetic of tame monoids with applications to Krull monoids and Mori domains. (Q989074) (← links)
- On divisor-closed submonoids and minimal distances in finitely generated monoids (Q1733316) (← links)
- An improved algorithm to compute the \(\omega\)-primality (Q1996743) (← links)
- \(\omega \)-primality in arithmetic Leamer monoids (Q2003180) (← links)
- Computation of the \(\omega\)-primality and asymptotic \(\omega\)-primality with applications to numerical semigroups. (Q2339617) (← links)
- On the linearity of \(\omega\)-primality in numerical monoids. (Q2443273) (← links)
- Measuring primality in numerical semigroups with embedding dimension three (Q2788752) (← links)
- ON BOUNDING MEASURES OF PRIMENESS IN INTEGRAL DOMAINS (Q2909485) (← links)
- Factorization invariants in numerical monoids (Q2979658) (← links)
- On dynamic algorithms for factorization invariants in numerical monoids (Q2981784) (← links)
