Frobenius templates in certain $2 \times 2$ matrix rings
Number Theory
2021-12-30 v1
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.
Keywords
Cite
@article{arxiv.2112.14411,
title = {Frobenius templates in certain $2 \times 2$ matrix rings},
author = {Timothy Eller and Jakub Kraus and Yuki Takahashi and Zhichun Joy Zhang},
journal= {arXiv preprint arXiv:2112.14411},
year = {2021}
}