Frobenius templates in certain $2 \times 2$ matrix rings
Timothy Eller, Jakub Kraus, Yuki Takahashi, Zhichun Joy Zhang

TL;DR
This paper investigates Frobenius problems within specific rings of upper triangular 2x2 matrices with constant diagonal, extending classical number theory concepts to matrix rings.
Contribution
It introduces Frobenius problems in matrix rings of upper triangular 2x2 matrices with constant diagonal, expanding the scope of classical Frobenius problem research.
Findings
Extended Frobenius problem to matrix rings
Derived solutions for specific matrix ring structures
Connected matrix Frobenius problems to classical integer cases
Abstract
The classical Frobenius problem is to find the largest integer that cannot be written as a linear combination of a given set of positive, coprime integers using nonnegative integer coefficients. Prior work has generalized the classical Frobenius problem from integers to Frobenius problems in other rings. This paper explores Frobenius problems in various rings of (upper) triangular matrices with constant diagonal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Interconnection Networks and Systems · Finite Group Theory Research
