arXiv · 2605.25542
The Frobenius problem for shifted square sequences
Abstract
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 resolve the conjecture of Frobenius problem for shifted square sequences suggested by Liu and Xin.
Explore related subjects
Keep this discovery
Kyunghwan Song. 2026-05-25. The Frobenius problem for shifted square sequences. https://arxiv.org/abs/2605.25542
Cite the original work for its findings. Save a collection to share your selection of sources.