On the Frobenius number of certain numerical semigroups

DOI10.1142/S0218196721500259zbMATH Open1472.11091arXiv2001.11204OpenAlexW3126786483MaRDI QIDQ4994454FDOQ4994454

Authors: Anton Rechenauer, R. Waldi, Michael Hellus 

Publication date: 18 June 2021

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Abstract: Let $0<lambdaleq1$, $lambdaotinleftfrac24,frac27,frac210,frac213,ldotsight$, be a real and $p$ a prime number, with $[p,p+lambdap]$ containing at least two primes. Denote by $f_{l}ambda(p)$ the largest integer which cannot be written as a sum of primes from $[p,p+lambdap]$. Then [f_lambda(p)simleftlfloor2+frac2lambda ight floorcdot p ext{, as }p ext{ goes to infinity.}] Further a question of Wilf about the 'Money-Changing Problem' has a positive answer for all semigroups of multiplicity $p$ containing the primes from $[p,2p]$. In particular, this holds for the semigroup generated by all primes not less than $p$. The latter special case was already shown in a previous paper.

Full work available at URL: https://arxiv.org/abs/2001.11204

Recommendations

• Primes in numerical semigroups
• Numerical semigroups generated by primes
• A generalization of Sylvester's and Frobenius' problems on numerical semigroups
• scientific article; zbMATH DE number 7233012
• On a conjecture by Wilf about the Frobenius number

zbMATH Keywords

numerical semigroupsGoldbach conjectureDiophantine Frobenius problemWilf's conjecture on numerical semigroups

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Commutative semigroups (20M14) The Frobenius problem (11D07)

Cites Work

• numericalsgps, a GAP package for numerical semigroups
• The difference between consecutive primes. II
• On the linear diophantine problem of Frobenius.
• A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
• Approximate formulas for some functions of prime numbers
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• Wilf's conjecture and Macaulay's theorem
• Vinogradov's theorem with almost equal summands
• Wilf's conjecture in fixed multiplicity
• Numerical semigroups generated by primes
• Title not available (Why is that?)

Cited In (19)

• Atoms of the set of numerical semigroups with fixed Frobenius number.
• Representing integers as sums or differences of general power products
• Title not available (Why is that?)
• Numerical semigroups generated by primes
• Title not available (Why is that?)
• On the enumeration of the set of saturated numerical semigroups with fixed Frobenius number.
• Wild and Wooley Numbers
• The Frobenius problem for repunit numerical semigroups.
• Title not available (Why is that?)
• On row-factorization relations of certain numerical semigroups
• On integer partitions corresponding to numerical semigroups
• The set of numerical semigroups of a given multiplicity and Frobenius number
• On_The_FrobeniusNumber
• On Frobenius numbers for symmetric (not complete intersection) semigroups generated by four elements
• Numerical semigroups with a given set of pseudo-Frobenius numbers
• Distribution of genus among numerical semigroups with fixed Frobenius number
• Frobenius pseudo-varieties in numerical semigroups.
• On the Frobenius Problem of Numerical Semigroups
• The Frobenius problems for sexy prime triplets

Uses Software

• GAP
• numericalsgps
• NumPy
• Matplotlib
• Python
• Rust
• GitHub

This page was built for publication: On the Frobenius number of certain numerical semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994454)