




















In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes), modulo an integer $N$, whose components are identical and minimal for this property. The objective here is to characterize the solutions of this type verifying a property of irreducibility modulo a prime power.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。