The following pages link to How Do You Measure Primality? (Q3449603):
Displaying 13 items.
- An improved algorithm to compute the \(\omega\)-primality (Q1996743) (← links)
- \(\omega \)-primality in arithmetic Leamer monoids (Q2003180) (← links)
- On factorization invariants and Hilbert functions (Q2013549) (← links)
- Factorization length distribution for affine semigroups. I: Numerical semigroups with three generators (Q2422221) (← links)
- Factorization invariants in numerical monoids (Q2979658) (← links)
- On dynamic algorithms for factorization invariants in numerical monoids (Q2981784) (← links)
- HOW FAR IS AN ELEMENT FROM BEING PRIME? (Q3056459) (← links)
- Factoring in the Chicken McNugget Monoid (Q4622998) (← links)
- Elasticity in Apéry Sets (Q5124657) (← links)
- How strong can primes be (Q5348037) (← links)
- Augmented Hilbert series of numerical semigroups (Q5383289) (← links)
- So What Is Class Number 2? (Q5742356) (← links)
- The Importance of Being Prime <sup>⋆</sup> , a Nontrivial Generalization for Nonunique Factorizations (Q6092919) (← links)
