arXiv · 2412.17882
The Frobenius problem for Numerical Semigroups generated by binomial coefficients
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 solve the Frobenius problem for the numerical semigroups generated by binomial coefficients. As applications, we provide some nontrivial identities among binomial coefficients, and we also connect the main results to the theory of $(s,s+1,s+p)$-core partitions of integers.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
WonTae Hwang, Kyunghwan Song. 2024-12-23. The Frobenius problem for Numerical Semigroups generated by binomial coefficients. https://arxiv.org/abs/2412.17882
Cite the original work for its findings. Save a collection to share your selection of sources.