Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes. (Q896247): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00233-014-9687-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047731532 / rank | |||
Normal rank | |||
Revision as of 00:41, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes. |
scientific article |
Statements
Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes. (English)
0 references
9 December 2015
0 references
The authors apply \textit{Ø. J. Rødseth}'s algorithm [J. Reine Angew. Math. 301, 171-178 (1978; Zbl 0374.10011)] to get explicit polynomial formulas for the Frobenius number \(F(S)\) of a numerical semigroup \(S\) generated by three consecutive squares or cubes. For example, if \(S\) is generated by \(n^3\), \((n+1)^3\), \((n+2)^3\) with \(n=18m>0\), then \[ F(S)=1.259.712m^5+320.760m^4+44.712m^3+4644m^2+154m-1. \]
0 references
Frobenius numbers
0 references
numerical semigroups
0 references
Rødseth algorithm
0 references
