The Frobenius problem over real number fields
Abstract
Given a number field K that is a subfield of the real numbers, we generalize the notion of the classical Frobenius problem to the ring of integers OK of K by describing certain Frobenius semigroups, Frob(α1,…,αn), for appropriate elements α1,…,αn∈OK. We construct a partial ordering on Frob(α1,…,αn), and show that this set is completely described by the maximal elements with respect to this ordering. We also show that Frob(α1,…,αn) will always have finitely many such maximal elements, but in general, the number of maximal elements can grow without bound as n is fixed and α1,…,αn∈OK vary. Explicit examples of the Frobenius semigroups are also calculated for certain cases in real quadratic number fields.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.