Algorithms for numerical semigroups with fixed maximum primitive
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914225092296704 |
|---|---|
| author | Delgado, Manuel Kumar, Neeraj |
| author_facet | Delgado, Manuel Kumar, Neeraj |
| contents | We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's conjecture among the numerical semigroups with maximum primitive up to \(60\). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_23891 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Algorithms for numerical semigroups with fixed maximum primitive Delgado, Manuel Kumar, Neeraj Combinatorics 20M14, 20--04, 05A15 We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's conjecture among the numerical semigroups with maximum primitive up to \(60\). |
| title | Algorithms for numerical semigroups with fixed maximum primitive |
| topic | Combinatorics 20M14, 20--04, 05A15 |
| url | https://arxiv.org/abs/2512.23891 |