A sequence of quasipolynomials arising from random numerical semigroups
From MaRDI portal
(Redirected from Publication:5236580)
Abstract: A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of integers, denoted , that count generating sets with certain properties. We prove a recurrence that implies the sequence is eventually quasipolynomial when the second parameter is fixed.
Recommendations
- Random numerical semigroups and a simplicial complex of irreducible semigroups
- Numerical semigroups generated by quadratic sequences
- On the number of numerical semigroups containing two coprime integers p and q.
- Counting numerical semigroups with short generating functions.
- On numerical semigroups generated by compound sequences
Cites work
Cited in
(3)
This page was built for publication: A sequence of quasipolynomials arising from random numerical semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236580)