Pages that link to "Item:Q3112587"
From MaRDI portal
The following pages link to COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS (Q3112587):
Displaying 17 items.
- Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\) (Q283342) (← links)
- Irreducible numerical semigroups with multiplicity three and four. (Q382929) (← links)
- Counting numerical semigroups by genus and some cases of a question of Wilf. (Q436083) (← links)
- Subsemigroup, ideal and congruence growth of free semigroups (Q502992) (← links)
- The set of numerical semigroups of a given genus. (Q1935456) (← links)
- The ordinarization transform of a numerical semigroup and semigroups with a large number of intervals. (Q1936119) (← links)
- An improved algorithm to compute the \(\omega\)-primality (Q1996743) (← links)
- Square-free divisor complexes of certain numerical semigroup elements (Q2037235) (← links)
- The set of numerical semigroups of a given multiplicity and Frobenius number (Q2244853) (← links)
- Counting numerical semigroups by genus and even gaps (Q2404376) (← links)
- Counting Numerical Semigroups (Q4575434) (← links)
- Parametrizing Arf numerical semigroups (Q4594936) (← links)
- Parametrizing numerical semigroups with multiplicity up to 5 (Q4608247) (← links)
- Computation of numerical semigroups by means of seeds (Q4640333) (← links)
- (Q5059493) (← links)
- Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials (Q5327451) (← links)
- Quasi-polynomial growth of numerical and affine semigroups with constrained gaps (Q6047285) (← links)