The Frobenius problem for shifted square sequences starting with a multiple of 4
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913161312993280 |
|---|---|
| author | Song, Kyunghwan |
| author_facet | Song, Kyunghwan |
| contents | The greatest integer that does not belong to a numerical semigroup S is called the Frobenius number of S, and finding the Frobenius number is called the Frobenius problem. In this paper, we solve the Frobenius problem for shifted square sequences starting with a multiple of 4. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_25542 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The Frobenius problem for shifted square sequences starting with a multiple of 4 Song, Kyunghwan Number Theory 11A67, 11A07 The greatest integer that does not belong to a numerical semigroup S is called the Frobenius number of S, and finding the Frobenius number is called the Frobenius problem. In this paper, we solve the Frobenius problem for shifted square sequences starting with a multiple of 4. |
| title | The Frobenius problem for shifted square sequences starting with a multiple of 4 |
| topic | Number Theory 11A67, 11A07 |
| url | https://arxiv.org/abs/2605.25542 |